Quantum Computation as Geometry

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 ...

Geometry of Quantum Computation

Riemannian Geometry of Quantum Computation

An introduction is given to some recent developments in the differential geometry of quantum computation for which the quantum evolution is described by the special unitary unimodular group SU(2n). Using the Lie algebra su(2n), detailed derivations are given of a useful Riemannian geometry of SU(2n), including the connection, curvature, the geodesic equation for minimal complexity quantum compu...

Geometry of abstraction in quantum computation

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke and Selinger. In particular, we analyze function abstraction in quantum computation, which turns out to characterize its classical interfaces. Intuitively, cla...

Geometry of Quantum Computation with Qudits

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry...