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

Scientific Reports

Geometry of Quantum Computation with Qudits

Ming-Xing Luo, Xiu‐Bo Chen, Yixian Yang, Xiaojun Wang

Published Feb 10, 2014• 33 citations
Publisher

Abstract

The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(d(n)). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.

DOI
10.1038/srep04044

Related papers

Geometry of Quantum Computation with Qutrits

Bin Li, Zuhuan Yu, Shao-Ming Fei

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 of SU(3(n)). As an example, three-qutrit systems are investigated in detail.

arXiv:1309.3357•Scientific Reports•Sep 5, 2013•59 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

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

Quantum Computation as Geometry

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

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

arXiv:quant-ph/0603161•Science•Feb 23, 2006•539 citations

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•137 citations

Riemann curvature in quantum computational geometry

Howard E. Brandt

In the Riemannian geometry of quantum computation, the quantum evolution is described in terms of the special unitary group SU(2n) of n-qubit unitary operators with unit determinant. To elaborate on one aspect of the methodology, the Riemann curvature and sectional curvature are explicitly derived using the Lie algebra su(2n). This is important for investigations of the global characteristics of geodesic paths in the group manifold.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 24, 2009•0 citations
The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(d(n)). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.
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.
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 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.
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.