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

Progress of Theoretical Physics

Quantum Computational Riemannian and Sub-Riemannian Geodesics

Kosuke Shizume, Takao Nakajima, Ryo Nakayama, Yutaka Takahashi

Published Jun 1, 2012• 9 citations
Publisher

Abstract

Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.

DOI
10.1143/ptp.127.997

Related papers

Optimal control, geometry, and quantum computing

Michael A. Nielsen, Mark R. Dowling, Mile Gu +1 more

We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, $U$, to the optimal control cost associated to the synthesis of $U$. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding minimal distances on certain Riemannian, sub-Riemannian, and Finslerian manifolds. These results generalize the results of [Nielsen, Dowling, Gu, and Doherty, Science 311, 1133 (2006)], which showed that the gate complexity can be related to distances on a Riemannian manifold.

arXiv:quant-ph/0603160•Physical Review A•Jun 16, 2006•136 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•130 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.

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

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

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(2 n ) 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.

WORLD SCIENTIFIC eBooks•Jun 25, 2013•0 citations

SubRiemannian geodesics and cubics for efficient quantum circuits

Michael Swaddle

Previous work argued that efficient quantum circuits can be obtained from special curves called geodesics, and they studied geodesics in Riemannian manifolds equipped with a penalty metric where the penalty was taken to infinity. Taking such limits seems problematic, because it is not clear that all extremals of a limiting optimal control problem can be arrived at as limits of solutions. To rectify this we use the Pontryagin Maximum Principle to construct equations for normal and abnormal subRiemannian geodesics and cubics. We also investigate whether neural networks can be trained to help generate quantum circuits.

•Jan 1, 2017•2 citations
Nielsen et al. have introduced a Riemannian metric on the space of n-qubit unitary operators [M. A. Nielsen, M. R. Dowling, M. Gu and A. C. Doherty, Science 311 (2006), 1133]. The length of the shortest curve connecting the identity I and a desired unitary operator W defined by this metric is essentially equivalent to the quantum gate complexity of W. This metric, and thus, the Riemannian geodesic equation for this metric, has a parameter q called “penalty” that must be large enough. In this paper, we investigate the sub-Riemannian geodesic equation obtained by taking the limit of the Riemannian geodesic equation as q →∞, and show that the Riemannian geodesics for finite q can be explicitly constructed from the sub-Riemannian geodesics. We also present a numerical algorithm for finding the (sub-)Riemannian geodesics connecting I and W, which is based on the Krotov method in optimal control theory. As an example, we give an exact sub-Riemannian geodesic connecting I and the controlled-controlled-Z gate, which is obtained by guessing from the numerical results of the algorithm.
We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, UUU, to the optimal control cost associated to the synthesis of UUU. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding minimal distances on certain Riemannian, sub-Riemannian, and Finslerian manifolds. These results generalize the results of [Nielsen, Dowling, Gu, and Doherty, Science 311, 1133 (2006)], which showed that the gate complexity can be related to distances on a Riemannian manifold.
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.
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.
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(2 n ) 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.
Previous work argued that efficient quantum circuits can be obtained from special curves called geodesics, and they studied geodesics in Riemannian manifolds equipped with a penalty metric where the penalty was taken to infinity. Taking such limits seems problematic, because it is not clear that all extremals of a limiting optimal control problem can be arrived at as limits of solutions. To rectify this we use the Pontryagin Maximum Principle to construct equations for normal and abnormal subRiemannian geodesics and cubics. We also investigate whether neural networks can be trained to help generate quantum circuits.