论文标题
使用Grover算法的通用版本优化量子搜索
Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm
论文作者
论文摘要
Grover的搜索算法是在引入时的突破性，其幅度放大的基本过程是许多其他算法和模式的基础，用于提取在量子状态下编码的信息。在本文中，我们介绍了该算法的均值倒数步骤的优化。该优化有两个目的：从实际的角度来看，它可以改善性能；从理论上讲，它导致了对这一步骤实际性质的新颖解释。此步骤是一种反思，它是通过（a）取消一般状态的叠加来恢复原始的全ZOROS状态，（b）翻转all-Zeros状态幅度的迹象，最后（c）恢复到叠加状态。我们的方法没有取消叠加，而是可以向前迈进另一个使反射更容易的状态。我们在设置和数组搜索中验证我们的方法，并在实际量子硬件上实验确认结果。
Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in quantum states. In this paper, we introduce an optimization of the inversion-by-the-mean step of the algorithm. This optimization serves two purposes: from a practical perspective, it can lead to a performance improvement; from a theoretical one, it leads to a novel interpretation of the actual nature of this step. This step is a reflection, which is realized by (a) cancelling the superposition of a general state to revert to the original all-zeros state, (b) flipping the sign of the amplitude of the all-zeros state, and finally (c) reverting back to the superposition state. Rather than canceling the superposition, our approach allows for going forward to another state that makes the reflection easier. We validate our approach on set and array search, and confirm our results experimentally on real quantum hardware.
