Resonant Quantum Search with Monitor Qubits

Frank Wilczek, Frank Wilczek, Frank Wilczek, Frank Wilczek, Frank Wilczek, Hong Ye Hu, Biao Wu, Biao Wu, Biao Wu

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 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.

Original languageEnglish (US)
Article number050304
JournalChinese Physics Letters
Volume37
Issue number5
DOIs
StatePublished - May 2020
Externally publishedYes

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint

Dive into the research topics of 'Resonant Quantum Search with Monitor Qubits'. Together they form a unique fingerprint.

Cite this