全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Physics  2006 

Quantum Computation as Geometry

DOI: 10.1126/science.1121541

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133