论文标题
量子设备中的量子步行过程
Quantum walk processes in quantum devices
论文作者
论文摘要
当前量子计算机作为嘈杂的中间尺度量子（NISQ）设备的模拟和编程代表当前物理和信息科学边界的热门话题。量子步行过程代表了许多量子算法中的基本子例程，并且在研究物理现象中起着重要作用。模拟量子步行过程对于经典处理器来说是计算上的挑战。随着单个寄存器中量子位的保真度和量子数的提高，有可能大大改善量子步行的模拟。但是，仍必须探索在Qubit寄存器中模拟量子步行的有效方法。在这里，我们探讨了图形上的量子步行与量子电路之间的关系。首先，我们讨论获得图形提供量子电路的方法。然后，我们探索技术在图上表示量子步行作为量子电路。具体而言，我们研究了超立方体图和任意图。我们研究图形和量子电路之间关系的方法铺平了有效实施量子步行算法在量子计算机上的方法。
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.
