Resonant Quantum Search with Monitor Qubits
Name
2002.09522.pdf
Description
Submitted version
Size
1.15 MB
Format
Unknown
Checksum (MD5)
549545f14cc419b6aa7de09844abd5e1
Author(s)
Wilczek, Frank
Hu, Hong-Ye
Wu, Biao
Date Issued
2020
Journal
Chinese Physics Letters
Publisher
IOP Publishing
Version
Original manuscript
Abstract
© 2020 Chinese Physical Society and IOP Publishing Ltd. 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 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.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1088/0256-307X/37/5/050304
