5 research outputs found
Optimizing the Number of Gates in Quantum Search
In its usual form, Grover's quantum search algorithm uses
queries and other elementary gates to find a solution in
an -bit database. Grover in 2002 showed how to reduce the number of other
gates to for the special case where the database has a
unique solution, without significantly increasing the number of queries. We
show how to reduce this further to gates for any
constant , and sufficiently large . This means that, on average, the
gates between two queries barely touch more than a constant number of the qubits on which the algorithm acts. For a very large that is a power of
2, we can choose such that the algorithm uses essentially the minimal
number of queries, and only
other gates.Comment: 11 pages LaTeX. Version 2: small improvements in the proof
Introducing Structure to Expedite Quantum Search
We present a novel quantum algorithm for solving the unstructured search
problem with one marked element. Our algorithm allows generating quantum
circuits that use asymptotically fewer additional quantum gates than the famous
Grover's algorithm and may be successfully executed on NISQ devices. We prove
that our algorithm is optimal in the total number of elementary gates up to a
multiplicative constant. As many NP-hard problems are not in fact unstructured,
we also describe the \emph{partial uncompute} technique which exploits the
oracle structure and allows a significant reduction in the number of elementary
gates required to find the solution. Combining these results allows us to use
asymptotically smaller number of elementary gates than the Grover's algorithm
in various applications, keeping the number of queries to the oracle
essentially the same. We show how the results can be applied to solve hard
combinatorial problems, for example Unique k-SAT. Additionally, we show how to
asymptotically reduce the number of elementary gates required to solve the
unstructured search problem with multiple marked elements.Comment: 22 pages, 7 figure
Optimizing the Number of Gates in Quantum Search
In its usual form, Grover's quantum search algorithm uses queries and other elementary gates to find a solution in an -bit database. Grover in 2002 showed how to reduce the number of other gates to for the special case where the database has a unique solution, without significantly increasing the number of queries. We show how to reduce this further to gates for every constant~, and sufficiently large~. This means that, on average, the circuits between two queries barely touch more than a constant number of the qubits on which the algorithm acts. For a very large that is a power of~2, we can choose~ such that the algorithm uses essentially the minimal number of queries, and only other gates