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

量子计算的几何学

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

摘要:

确定么正操作的量子线路复杂度与在特定弯曲几何形状中找到最小长度路径的问题密切相关[Nielsen等人,Science 311,1133-1135(2006)]。本文研究了许多与此空间相关的基本几何对象,包括Levi-Civita连接,测地线方程,曲率和Jacobi方程。我们表明,最佳的哈密顿演化合成所需的酉必然服从一个简单的通用测地线方程。因此,一旦设定了哈密顿算子的初始值,哈密顿算子的后续变化就完全由测地线方程决定。我们开发了许多解析解的测地线方程,和一组不变量,完全确定测地线。我们调查的问题,找到最小的测地线通过所需的酉,U,并开发一个程序,使我们能够变形(已知)测地线的一个简单的和很好理解的度量的测地线在量子计算中的利益。这个变形过程中使用一些三量子位的数值例子说明。我们研究的计算复杂性评价距离黎曼流形,并表明,没有有效的经典算法存在这个问题,假设存在良好的伪随机生成器。最后,我们开发了一个正则扩展程序的酉操作,允许辅助量子比特被纳入几何方法的量子计算。

英文摘要:

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

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

↑