arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.00819quant-phmath.GR
收藏

从可逆计算到量子计算的Lagrange插值方法

From reversible computation to quantum computation by Lagrange interpolation

Alexis De Vos, Stijn De Baerdemacker

摘要:

作用于$w$ ~比特的经典可逆电路由大小为$2^w \times 2^w$的置换矩阵表示。这些矩阵形成群P($2^w$),同构于对称群{ \bf S} $_{2^w}$。置换群P($n$),同构于{ \bf S} $_n$,包含长度为~ $p$的圈,范围从~1到$L(n)$,其中$L(n)$是所谓的朗道函数。通过循环的$p$ ~矩阵之间的Lagrange插值,我们从一个~ $p$阶的有限循环群到一个1维李群,即酉群U($n$)的子群.由于U($2^w$)是作用于$w$ ~量子比特的所有可能的量子线路的组,因此这样的插值是从经典计算到量子计算的自然方式。

英文摘要:

Classical reversible circuits, acting on $w$~bits, are represented by permutation matrices of size $2^w \times 2^w$. Those matrices form the group P($2^w$), isomorphic to the symmetric group {\bf S}$_{2^w}$. The permutation group P($n$), isomorphic to {\bf S}$_n$, contains cycles with length~$p$, ranging from~1 to $L(n)$, where $L(n)$ is the so-called Landau function. By Lagrange interpolation between the $p$~matrices of the cycle, we step from a finite cyclic group of order~$p$ to a 1-dimensional Lie group, subgroup of the unitary group U($n$). As U($2^w$) is the group of all possible quantum circuits, acting on $w$~qubits, such interpolation is a natural way to step from classical computation to quantum computation.

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

↑