← Back to papers
Resonant Quantum Search with Monitor Qubits
F. Wilczek, Hong-ye Hu, Biao Wu·February 21, 2020·DOI: 10.1088/0256-307X/37/5/050304
Computer SciencePhysics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity O(N/k) as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary “monitor” qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(N) , similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.