Complete Adiabatic Quantum Search in Unsorted Databases

TL;DR

This paper introduces a new adiabatic quantum search algorithm that reduces qubit requirements by two-thirds and offers improved speedup over previous adiabatic methods for unsorted database search.

Contribution

The paper presents a novel adiabatic quantum search algorithm that is more resource-efficient and faster than existing adiabatic algorithms, with detailed complexity analysis.

Findings

Reduces qubit usage by two-thirds compared to Grover's algorithm.

Achieves better speedup than previous adiabatic search algorithms.

Validated through perturbative analysis and numerical simulation.

Abstract

We propose a new adiabatic algorithm for the unsorted database search problem. This algorithm saves two thirds of qubits than Grover's algorithm in realizations. Meanwhile, we analyze the time complexity of the algorithm by both perturbative method and numerical simulation. The results show it provides a better speedup than the previous adiabatic search algorithm.