论文标题
确定性的Grover搜索有限的Oracle
Deterministic Grover search with a restricted oracle
论文作者
论文摘要
Grover的量子搜索算法在广泛的非结构化搜索问题上提供了比经典算法相对于经典算法的二次量子优势。原始协议是概率的,在每个查询上都有很大的概率返回所需结果,但通常需要该算法的几次迭代。我们提出了一个修改版本,以确定返回正确的结果,而无需对量子搜索Oracle的用户控制。我们的确定性两参数“ D2P”协议利用了标准Oracle查询后代替相位反转的广义相位旋转。与原始Grover搜索中最佳步骤相比,D2P协议在不超过一个额外的迭代中获得了100%的成功率,从而实现了相同的二次速度。我们还使用Bloch球体提供可视化,以增强几何直觉。
Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant probability on each query, but in general, requiring several iterations of the algorithm. We present a modified version to return the correct result with certainty without having user control over the quantum search oracle. Our deterministic, two-parameter "D2p" protocol utilizes generalized phase rotations replacing the phase inversions after a standard oracle query. The D2p protocol achieves a 100% success rate in no more than one additional iteration compared to the optimal number of steps in the original Grover's search enabling the same quadratic speed up. We also provide a visualization using the Bloch sphere for enhanced geometric intuition.