论文标题
带有监视器Qubit的谐振量子搜索
Resonant Quantum Search with Monitor Qubits
论文作者
论文摘要
我们根据连续的汉密尔顿人和利用共振，为广义搜索问题（$ n $项目中的$ k $标记项目）提供了一种算法。该谐振算法具有相同的时间复杂性$ O（\ sqrt {n/k}）$作为Grover算法。如果未知的话，算法的自然扩展可以确定$ k $。我们计数算法的时间复杂性为$ o（\ sqrt {n}）$，类似于适当的物理资源，类似于最佳的量子近似计数算法，或者更好。
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.
