Quantum Computation as Geometry

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.

13 Pages, 1 Figure

References in corpus (1)

• A geometric approach to quantum circuit lower bounds

Cited by in corpus (12)

• Faster than Hermitian Quantum Mechanics
• Quantum Adiabatic Brachistochrone
• Optimal control, geometry, and quantum computing
• Quantum Phase Extraction in Isospectral Electronic Nanostructures
• Decoherence effects on the quantum spin channels
• Quantum Walks, Quantum Gates and Quantum Computers
• Hamiltonian Oracles
• Elliptic functions and efficient control of Ising spin chains with unequal couplings
• Time-optimal synthesis of unitary transformations in coupled fast and slow qubit system
• Unitary transformations can be identified locally
• Quantum Control via Geometry: An explicit example
• A Scheme of Cartan Decomposition for su(N)