Tradeoffs in the Quantum Search Algorithm

Abstract

Quantum search is a quantum mechanical technique for searching N possibilities in only sqrt(N) steps. This has been proved to be the best possible algorithm for the exhuastive search problem in the sense the number of queries it requires cannot be reduced. However, as this paper shows, the number of non-query operations, and thus the total number of operations, can be reduced. The number of non-query unitary operations can be reduced by a factor of log N/alpha*log(log N) while increasing the number of queries by a factor of only (1+(log N)^{-alpha}). Various choices of alpha yield different variants of the algorithm. For example, by choosing alpha to be O(log N/log(log N)), the number of non-query unitary operations can be reduced by 40% while increasing the number of queries by just two.

11 pages

Cited by in corpus (16)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Quantum algorithms for hidden nonlinear structures
• Implementation of efficient quantum search algorithms on NISQ computers
• Span-program-based quantum algorithm for evaluating formulas
• Grover search revisited; application to image pattern matching
• Quantum search on noisy intermediate-scale quantum devices
• Simple implementation of a quantum search with trapped ions
• Introducing Structure to Expedite Quantum Search
• Tree Search and Quantum Computation
• Span-program-based quantum algorithm for evaluating unbalanced formulas
• Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs
• Near-deterministic quantum search algorithm without phase design
• Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems
• Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language
• Asymptotic bounds on quantum partial search algorithm and its applications to parallel search
• Quantum Algorithms in Cybernetics