Resonant Quantum Search with Monitor Qubits
arXiv:2002.09522 · doi:10.1088/0256-307X/37/5/050304
Abstract
We present an algorithm for the generalized search problem (searching marked items among items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor" qubits, can determine precisely, if it is unknown. The time complexity of our counting algorithm is , similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.
arXiv comment12 pages, 1 figure
References in corpus (7)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Search by Local Adiabatic Evolution
- How Powerful is Adiabatic Quantum Computation?
- Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm
- Quantum independent set problem and non-abelian adiabatic mixing