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

量子计算几何

Quantum Computation as Geometry

Michael A. Nielsen, Mark R. Dowling, Mile Gu, Andrew C. Doherty

摘要:

量子计算机前景广阔,但要找到解决有趣计算问题的有效量子线路仍然是一个挑战。我们发现,寻找最佳的量子线路本质上是等价于找到两点之间的最短路径在一定的弯曲几何。通过将寻找量子线路的问题重新转换为几何问题,我们开辟了使用黎曼几何的数学技术来提出新的量子算法或证明量子计算机能力的局限性的可能性。

英文摘要:

Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms, or to prove limitations on the power of quantum computers.

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

↑