arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.10907quant-ph
收藏

无需SWAP操作的量子算法实现

SWAP-less Implementation of Quantum Algorithms

University of Innsbruck(因斯布鲁克大学);Parity Quantum Computing GmbH(Parity Quantum Computing有限公司);Parity Quantum Computing Germany GmbH(Parity Quantum Computing德国有限公司)

Berend Klaver, Stefan Rombouts, Michael Fellner, Anette Messinger, Kilian Ender, Katharina Ludwig, Wolfgang Lechner

AI总结:

无需SWAP操作,通过传输量子信息实现更高效的量子算法执行,减少电路深度和CNOT门数量。

摘要:

我们提出了一种基于追踪奇偶量子信息流动的正式ism,用于在具有有限连通性的设备上实现算法,而无需qubit开销、SWAP操作或移位。相反,我们利用纠缠门不仅操纵量子态,还可以被用来传输量子信息。我们通过将其应用于具有n个qubit的量子傅里叶变换(QFT)和量子近似优化算法(QAOA)来展示该方法的有效性。这改进了所有在线性最近邻架构上的QFT状态-of-the-art实现,结果总电路深度为5n-3,需要n²-1个CNOT门。对于QAOA,我们的方法优于SWAP网络,目前是在线性架构上最高效的QAOA实现。我们进一步展示了通过在双线性连通性上实现QAOA,使用两倍数量的qubit来平衡qubit数量与电路深度的潜力,这大约将电路深度减半。

英文摘要:

We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations or shuttling. Instead, we leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information. We demonstrate the effectiveness of this method by applying it to the quantum Fourier transform (QFT) and the Quantum Approximate Optimization Algorithm (QAOA) with $n$ qubits. This improves upon all state-of-the-art implementations of the QFT on a linear nearest-neighbor architecture, resulting in a total circuit depth of ${5n-3}$ and requiring ${n^2-1}$ CNOT gates. For the QAOA, our method outperforms SWAP networks, which are currently the most efficient implementation of the QAOA on a linear architecture. We further demonstrate the potential to balance qubit count against circuit depth by implementing the QAOA on twice the number of qubits using bi-linear connectivity, which approximately halves the circuit depth.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑