TY - JOUR
T1 - Resonant Quantum Search with Monitor Qubits
AU - Wilczek, Frank
AU - Wilczek, Frank
AU - Wilczek, Frank
AU - Wilczek, Frank
AU - Wilczek, Frank
AU - Hu, Hong Ye
AU - Wu, Biao
AU - Wu, Biao
AU - Wu, Biao
N1 - Publisher Copyright:
© 2020 Chinese Physical Society and IOP Publishing Ltd.
PY - 2020/5
Y1 - 2020/5
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85086862699&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85086862699&partnerID=8YFLogxK
U2 - 10.1088/0256-307X/37/5/050304
DO - 10.1088/0256-307X/37/5/050304
M3 - Article
AN - SCOPUS:85086862699
SN - 0256-307X
VL - 37
JO - Chinese Physics Letters
JF - Chinese Physics Letters
IS - 5
M1 - 050304
ER -