Resonant Quantum Search with Monitor Qubits

Author(s)
Wilczek, Frank; Hu, Hong-Ye; Wu, Biao
Thumbnail
DownloadSubmitted version (1.146Mb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2020
URI
https://hdl.handle.net/1721.1/132573.2
Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Journal
Chinese Physics Letters
Publisher
IOP Publishing
Collections

Version History

VersionItemDateSummary
21721.1/132573.2*2021-12-17T18:20:30ZVerified or entered authority metadata.
11721.1/1325732021-09-20T18:23:08Z

*Selected version