arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.09522quant-ph

Resonant Quantum Search with Monitor Qubits

Frank Wilczek, Hong-Ye Hu, Biao Wu

英文摘要:

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 $O(\sqrt{N/k})$ 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(\sqrt{N})$, similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑