Quantum computation as geometry.
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.
Nielsen
Michael A
MA
School of Physical Sciences, University of Queensland, Queensland 4072, Australia. nielsen@physics.uq.edu.au
Dowling
Mark R
MR
Gu
Mile
M
Doherty
Andrew C
AC