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

量子比特连通性是否影响量子电路复杂度?

Does qubit connectivity impact quantum circuit complexity?

Pei Yuan, Jonathan Allcock, Shengyu Zhang

AI总结:

本文证明即使在一维链等受限连通性下,所有n量子比特酉操作仍可用O(4^n/n)深度和O(4^n)规模的电路实现,并扩展到一般连通图、辅助量子比特及特殊酉族,表明连通性约束不显著影响电路复杂度。

摘要:

某些量子计算的物理实现方案只能对特定的量子比特对施加双量子比特门。这些连通性约束通常被视为一个显著的劣势。例如,将一个不受限制的$n$量子比特量子电路编译到具有较差量子比特连通性的电路(如一维链)通常会导致深度增加$O(n^2)$、规模增加$O(n)$。推测这种开销是不可避免的很有吸引力——一个在$n$个量子比特上的随机电路每层有$\Theta(n)$个双量子比特门,且其中恒定比例作用于距离为$\Theta(n)$的量子比特上。\n尽管已知几乎所有$n$量子比特酉操作都需要深度为$\Omega(4^n/n)$、规模为$\Omega(4^n)$的量子电路才能在全连接量子比特连通性下实现,但在本文中,我们表明即使在{1D链}量子比特连通性约束下,所有$n$量子比特酉操作也可以通过深度为$O(4^n/n)$、规模为$O(4^n)$的量子电路实现。\n我们扩展了这一结果,并从三个方向研究量子比特连通性。首先,我们考虑更一般的连通图,并表明只要图是连通的,电路规模总能做到$O(4^n)$。对于电路深度,我们研究了$d$维网格、完全$d$叉树和扩展图,并显示了与一维链类似的结果。其次,我们考虑存在辅助量子比特的情况。我们表明,借助辅助量子比特,电路深度可以做到多项式级别,并且空间-深度权衡不会因连通性约束而受损,除非我们拥有指数数量的辅助量子比特。第三,我们在特殊酉操作族上获得了近乎最优的结果,包括对角酉操作、2乘2分块对角酉操作以及量子态制备(QSP)酉操作,后者是许多用于机器学习和线性代数的量子算法中的基本任务。

英文摘要:

Some physical implementation schemes of quantum computing can apply two-qubit gates only on certain pairs of qubits. These connectivity constraints are commonly viewed as a significant disadvantage. For example, compiling an unrestricted $n$-qubit quantum circuit to one with poor qubit connectivity, such as a 1D chain, usually results in a blowup of depth by $O(n^2)$ and size by $O(n)$. It is appealing to conjecture that this overhead is unavoidable -- a random circuit on $n$ qubits has $Θ(n)$ two-qubit gates in each layer and a constant fraction of them act on qubits separated by distance $Θ(n)$. While it is known that almost all $n$-qubit unitary operations need quantum circuits of $Ω(4^n/n)$ depth and $Ω(4^n)$ size to realize with all-to-all qubit connectivity, in this paper, we show that all $n$-qubit unitary operations can be implemented by quantum circuits of $O(4^n/n)$ depth and $O(4^n)$ size even under {1D chain} qubit connectivity constraint. We extend this result and investigate qubit connectivity in three directions. First, we consider more general connectivity graphs and show that the circuit size can always be made $O(4^n)$ as long as the graph is connected. For circuit depth, we study $d$-dimensional grids, complete $d$-ary trees and expander graphs, and show results similar to the 1D chain. Second, we consider the case when ancillary qubits are available. We show that, with ancilla, the circuit depth can be made polynomial, and the space-depth trade-off is not impaired by connectivity constraints unless we have exponentially many ancillary qubits. Third, we obtain nearly optimal results on special families of unitaries, including diagonal unitaries, 2-by-2 block diagonal unitaries, and Quantum State Preparation (QSP) unitaries, the last being a fundamental task used in many quantum algorithms for machine learning and linear algebra.

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

↑