Work

Resonant Quantum Search with Monitor Qubits

Year: 2020

Type: preprint

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.

Source: DSpace@MIT (Massachusetts Institute of Technology)

Authors: Wilczek, F, Wilczek, F, Hu, HY, Wu, B, Wu, B, Wu, B

Institutions: Stockholm University, Shanghai Jiao Tong University, Arizona State University, Massachusetts Institute of Technology, University of California San Diego, Peking University, Collaborative Innovation Center of Quantum Matter

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3025020176

Cites: 15

Cited by: 7

Related to: 10