Implementation of efficient quantum search algorithms on NISQ computers
Implementation of efficient quantum search algorithms on NISQ computers
复制标题
DOI：
10.1007/s11128-021-03165-2
复制
发表时间：
2021-02
影响因子：
2.5
通讯作者：
Kun Zhang;P. Rao;Kwangmin Yu;Hyunkyung Lim;V. Korepin
中科院分区：
文献类型：
--
作者：
Kun Zhang;P. Rao;Kwangmin Yu;Hyunkyung Lim;V. Korepin
尽管Grover的非结构化搜索算法已经出现，但其在近期量子设备上的成功实现仍然有限。我们应用三种策略来减少与实现量子搜索算法相关的错误。我们改进的搜索算法已经在IBM量子处理器上实现。使用它们，我们展示了三个和四个量子比特的搜索算法，与以前的作品相比，具有更高的平均成功概率。我们首次在IBM量子处理器上成功执行了五量子位搜索。结果已经使用退化率进行了基准测试，退化率是实验成功概率和理论成功概率之间的比率。退化率的快速衰减支持我们的分而治之的策略。我们提出的策略对于后NISQ时代量子搜索算法的实现也很有用。
Despite the advent of Grover’s algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search algorithms. Our improved search algorithms have been implemented on the IBM quantum processors. Using them, we demonstrate three- and four-qubit search algorithm with higher average success probabilities compared to previous works. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time. The results have been benchmarked using degraded ratio, which is the ratio between the experimental and the theoretical success probabilities. The fast decay of the degraded ratio supports our divide-and-conquer strategy. Our proposed strategies are also useful for implementation of quantum search algorithms in the post-NISQ era.