论文标题
嘈杂的中间量子设备上的量子搜索
Quantum search on noisy intermediate-scale quantum devices
论文作者
论文摘要
量子搜索算法（也称为Grover的算法）为许多其他量子算法奠定了基础。尽管它非常简单，但其实现受到嘈杂的中间量子（NISQ）处理器的限制。 Grover的算法是设计的，而没有考虑实际实现中的物理资源，例如深度。因此，对于NISQ设备，可以改进Grover的算法。在本文中，我们演示了如何在NISQ设备上更好地实现量子搜索算法。我们介绍了不同量子处理器（包括IBMQ，IONQ和HONEYWELL量子设备）上五量量子搜索算法的详细基准。我们报告了与以前的作品相比，五量搜索算法的最高成功概率。我们的结果表明，设计错误感知的量子搜索算法是可能的，这可以最大程度地利用NISQ计算机的功能。
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's algorithm was designed without considering the physical resources, such as depth, in the real implementations. Therefore, Grover's algorithm can be improved for NISQ devices. In this paper, we demonstrate how to implement quantum search algorithms better on NISQ devices. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. We report the highest success probability of the five-qubit search algorithm compared to previous works. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.
