Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Modern Optics

Differential geometry of quantum computation

Howard E. Brandt

Published Nov 10, 2008• 3 citations
Publisher

Abstract

This is a brief review of aspects of a recent development in the differential geometry of quantum computation. Expository descriptions are offered of the associated Riemannian geometry of the special unitary unimodular group in 2 n -dimensions, including the choice of metric, connection, and optimal geodesics for achieving minimal complexity quantum computations.

DOI
10.1080/09500340802353686

Related papers

Differential geometry of quantum computing

Howard E. Brandt

An expository review is given of recent developments in the differential geometry of quantum computation. Descriptions are given of the appropriate Riemannian geometry of the special unitary unimodular group in 2n- dimensions, including the choice of metric, connection, curvature tensor, and optimal geodesics for achieving minimal complexity quantum computations.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 6, 2008•1 citation

ASPECTS OF THE RIEMANNIAN GEOMETRY OF QUANTUM COMPUTATION

Howard E. Brandt

A review is given of some aspects of the Riemannian geometry of quantum computation in which the quantum evolution is represented in the tangent space manifold of the special unitary unimodular group SU(2n) for n qubits. The Riemannian right-invariant metric, connection, curvature, geodesic equation for minimal complexity quantum circuits, Jacobi equation and the lifted Jacobi equation for varying penalty parameter are reviewed. Sharpened tools for calculating the geodesic derivative are presented. The geodesic derivative may facilitate the numerical investigation of conjugate points and the global characteristics of geodesic paths in the group manifold, the determination of optimal quantum circuits for carrying out a quantum computation, and the determination of the complexity of particular quantum algorithms.

International Journal of Modern Physics B•Sep 18, 2012•2 citations

Jacobi fields in the Riemannian geometry of quantum computation

Howard E. Brandt

In the Riemannian geometry of quantum computation, the quantum evolution is described in terms of the special unitary group of n-qubit unitary operators with unit determinant. To elaborate on some aspects of the methodology, the generic Jacobi equation and lifted Jacobi equation, together with solutions on the group manifold, are explicitly derived. This is important for investigations of the global characteristics of geodesic paths in the group manifold, and the determination of optimal quantum circuits for carrying out a quantum computation.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 31, 2010•2 citations

Lifted Jacobi equation for varying penalty parameter in the Riemannian geometry of quantum computation

Howard E. Brandt

Recent developments in the differential geometry of quantum computation are exposited. The quantum evolution is described in terms of the special unitary group of n-qubit unitary operators with unit determinant. The group manifold is taken to be Riemannian. In the present work, the lifted Jacobi equation and geodesic derivative are reviewed. This is applicable to investigations of conjugate points and the global characteristics of geodesic paths in the group manifold, and the determination of optimal quantum circuits for carrying out a quantum computation.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 31, 2010•1 citation

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

arXiv:quant-ph/0701004•Dec 31, 2006•7 citations

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.

Quantum Information and Computation•Nov 1, 2008•94 citations
This is a brief review of aspects of a recent development in the differential geometry of quantum computation. Expository descriptions are offered of the associated Riemannian geometry of the special unitary unimodular group in 2 n -dimensions, including the choice of metric, connection, and optimal geodesics for achieving minimal complexity quantum computations.
A review is given of some aspects of the Riemannian geometry of quantum computation in which the quantum evolution is represented in the tangent space manifold of the special unitary unimodular group SU(2n) for n qubits. The Riemannian right-invariant metric, connection, curvature, geodesic equation for minimal complexity quantum circuits, Jacobi equation and the lifted Jacobi equation for varying penalty parameter are reviewed. Sharpened tools for calculating the geodesic derivative are presented. The geodesic derivative may facilitate the numerical investigation of conjugate points and the global characteristics of geodesic paths in the group manifold, the determination of optimal quantum circuits for carrying out a quantum computation, and the determination of the complexity of particular quantum algorithms.
In the Riemannian geometry of quantum computation, the quantum evolution is described in terms of the special unitary group of n-qubit unitary operators with unit determinant. To elaborate on some aspects of the methodology, the generic Jacobi equation and lifted Jacobi equation, together with solutions on the group manifold, are explicitly derived. This is important for investigations of the global characteristics of geodesic paths in the group manifold, and the determination of optimal quantum circuits for carrying out a quantum computation.
Recent developments in the differential geometry of quantum computation are exposited. The quantum evolution is described in terms of the special unitary group of n-qubit unitary operators with unit determinant. The group manifold is taken to be Riemannian. In the present work, the lifted Jacobi equation and geodesic derivative are reviewed. This is applicable to investigations of conjugate points and the global characteristics of geodesic paths in the group manifold, and the determination of optimal quantum circuits for carrying out a quantum computation.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many of the basic geometric objects associated to this space, including the Levi-Civita connection, the geodesic equation, the curvature, and the Jacobi equation. We show that the optimal Hamiltonian evolution for synthesis of a desired unitary necessarily obeys a simple universal geodesic equation. As a consequence, once the initial value of the Hamiltonian is set, subsequent changes to the Hamiltonian are completely determined by the geodesic equation. We develop many analytic solutions to the geodesic equation, and a set of invariants that completely determine the geodesics. We investigate the problem of finding minimal geodesics through a desired unitary, U, and develop a procedure which allows us to deform the (known) geodesics of a simple and well understood metric to the geodesics of the metric of interest in quantum computation. This deformation procedure is illustrated using some three-qubit numerical examples. We study the computational complexity of evaluating distances on Riemmanian manifolds, and show that no efficient classical algorithm for this problem exists, subject to the assumption that good pseudorandom generators exist. Finally, we develop a canonical extension procedure for unitary operations which allows ancilla qubits to be incorporated into the geometric approach to quantum computing.