Quantum Computation as Geometry

DOI10.1126/SCIENCE.1121541zbMATH Open1226.81049arXivquant-ph/0603161OpenAlexW1967883933WikidataQ51631130 ScholiaQ51631130MaRDI QIDQ3101404

Author name not available (Why is that?)

Publication date: 28 November 2011

Published in: (Search for Journal in Brave)

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 work available at URL: https://arxiv.org/abs/quant-ph/0603161

Mathematics Subject Classification ID

No records found.

This page was built for publication: Quantum Computation as Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101404)