arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.01704quant-ph
收藏

量子基态移位的高效并行化

Efficient parallelization of quantum basis state shift

Ljubomir Budinski, Ossi Niemimäki, Roberto Zamora-Zamora, Valtteri Lahtinen

AI总结:

本文提出并行化量子基态移位算法,显著降低电路深度,实现门数与工作量子比特的线性扩展,优于基于量子傅里叶变换的二次扩展方法。

摘要:

基态移位是许多量子算法的核心,尤其是量子行走。高效实现对于在计算应用中实现量子加速至关重要。我们通过将不同方向的移位并行结合来优化状态移位算法。与当前已知方法相比,这显著减少了量子电路的深度,在门数量与工作量子比特之间实现线性扩展,而基于量子傅里叶变换的最先进方法则是二次扩展。对于大小为 $2^n$($n > 4$)的一维数组,我们推导出并行电路中总共 $15n + 74$ 个双量子比特 $CX$ 门,使用总共 $2n-2$ 个量子比特,包括用于分解多控制门的辅助寄存器。我们专注于一维和周期性移位,但指出该方法可以扩展到更复杂的情况。

英文摘要:

Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods, giving a linear scaling in the number of gates versus working qubits in contrast to the quadratic scaling of the state-of-the-art method based on the quantum Fourier transform. For a one-dimensional array of size $2^n$ for $n > 4$, we derive the total number of $15n + 74$ two-qubit $CX$ gates in the parallel circuit, using a total of $2n-2$ qubits including an ancilla register for the decomposition of multi-controlled gates. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.

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

↑