Report

Quantum Computation as Geometry

Science  24 Feb 2006:
Vol. 311, Issue 5764, pp. 1133-1135
DOI: 10.1126/science.1121541

You are currently viewing the abstract.

View Full Text

Via your Institution

Log in through your institution

Log in through your institution


Abstract

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.

View Full Text