Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 24 February 2006:
Vol. 311. no. 5764, pp. 1133 - 1135
DOI: 10.1126/science.1121541
Prev | Table of Contents | Next

Reports

Quantum Computation as Geometry

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

Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here 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.

School of Physical Sciences, The University of Queensland, Queensland 4072, Australia.

* To whom correspondence should be addressed. E-mail: nielsen{at}physics.uq.edu.au

Read the Full Text


THIS ARTICLE HAS BEEN CITED BY OTHER ARTICLES:
Quantum Phase Extraction in Isospectral Electronic Nanostructures.
C. R. Moon, L. S. Mattos, B. K. Foster, G. Zeltzer, W. Ko, and H. C. Manoharan (2008)
Science 319, 782-787
   Abstract »    Full Text »    PDF »


To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)