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

arXiv:2609.20987

Isometry Groups of Right Invariant Metrics in Geometric Quantum Complexity

Xiaobo Liu, Lei Zheng

math.DGquant-phSubmitted Sep 17, 2026• Announced Sep 21, 2026• 0 citations
arXivHTMLPDF

Abstract

In this paper, we give a complete description for the full isometry groups of a class of right invariant Riemannian metrics on the special unitary group $\mathrm{SU}(2^N)$. These metrics have been used by physicists to study Nielsen's geometric approach for complexities in quantum computations.

AI Summary

Nielsen’s geometric approach models quantum complexity using distances on $\mathrm{SU}(2^N)$ with right-invariant metrics that penalize high-weight Pauli directions. This paper addresses the classification of all distance-preserving transformations for penalty metrics whose Pauli-string squared norms depend only on weight, through positive factors $q_1,\ldots,q_N$. For $N\geq2$, the main theorem assumes that every metric-preserving group automorphism preserves the span $W_1$ of weight-one Pauli directions. Under this condition, the full isometry group is $\mathrm{SU}(2^N)\rtimes((\mathrm{SO}(3)^N\rtimes\mathbb Z_2)\rtimes S_N)$. Thus every isometry is generated by right translations, conjugation by tensor products of single-qubit unitaries, complex conjugation, and qubit permutations. The condition holds whenever $q_1\neq q_k$ for every $k>1$, covering the binomial and exponential metrics considered here. It also holds for cliff metrics with $q_1=q_2=1$ and $q_k=q>1$ for $k\geq3$, provided $N\geq3$. The proof first uses results on invariant metrics on compact simple Lie groups to identify the connected identity stabilizer with local-unitary conjugations. A multiplicity-free representation decomposition determines its orthogonal normalizer, leaving support-dependent sign changes as possible extra symmetries. Curvature preservation reduces these to four parity-dependent choices; symmetric-space classification excludes two for non-bi-invariant metrics. The classification is conditional rather than applicable to every penalty schedule. In particular, the two-qubit cliff metric is bi-invariant and lies outside the stated hypothesis. No circuit-complexity bounds or explicit distance formulas are derived.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28 pages

Related papers

Group-theoretical analysis of quantum complexity: the oscillator group case

K. Andrzejewski, K. Bolonek-Lasoń, P. Kosiński

Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our approach is based on the observation that the whole problem refers to the structure of the underlying group. The questions concerning the complexity of particular unitaries are solved by lifting the abstract structure to the operator level by considering the relevant unitary representation. For the class of right-invariant metrics obeying natural invariance condition we solve the geodesic equations on oscillator group. The solution is given explicitly in terms of elementary functions. Imposing the boundary conditions yield a transcendental equation and the length of the geodesic is given in terms of the solutions to the latter. Since the unitary irreducible representations of oscillator group are classified this allows us to compute, at least in principle, the complexity of any unitary operator belonging to the representation.

quant-pharXiv:2512.17552•Dec 22, 2025•0 citations

Differential geometry of quantum computation

Howard E. Brandt

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.

Journal of Modern Optics•Nov 10, 2008•3 citations

Geometric Measures of Complexity for Open and Closed Quantum Systems

Alberto Acevedo, Antonio Falcó

The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion originally developed by Michael Nielsen (Circa, 2007). However, for nonunitary dynamics, it is unclear how one can recover a completely geometric characterization of Nielsen-like geometric complexity. The main obstacle to overcome is that nonunitary dynamics cannot be characterized by Lie groups (which are Riemannian manifolds), as is the case for unitary dynamics. Building on Nielsen's work, we present a definition of geometric complexity for a fairly generic family of quantum channels. These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.

arXiv:2507.18440•Jul 24, 2025•3 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

Polynomial Equivalence of Complexity Geometries

Adam R. Brown

This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group—often called `complexity geometries' following the definition of quantum complexity proposed by Nielsen—and delineate the equivalence class of metrics that have the same computational power as quantum circuits. Within this universality class, any unitary that can be reached in one metric can be approximated in any other metric in the class with a slowdown that is at-worst polynomial in the length and number of qubits and inverse-polynomial in the permitted error. We describe the equivalence classes for two different kinds of error we might tolerate: Killing-distance error, and operator-norm error. All metrics in both equivalence classes are shown to have exponential diameter; all metrics in the operator-norm equivalence class are also shown to give an alternative definition of the quantum complexity class BQP. My results extend those of Nielsen et al., who in 2006 proved that one particular metric is polynomially equivalent to quantum circuits. The Nielsen et al. metric is incredibly highly curved. I show that the greatly enlarged equivalence class established in this paper also includes metrics that have modest curvature. I argue that the modest curvature makes these metrics more amenable to the tools of differential geometry, and therefore makes them more promising starting points for Nielsen's program of using differential geometry to prove complexity lowerbounds. In a previous paper my collaborators and I—inspired by the UV/IR decoupling that happens in the phenomenon of renormalization—conjectured that high- dimensional metrics that look very different at short scales will often nevertheless give rise at long scales to the same emergent effective geometry. The results of this paper provide evidence for those conjectures, since many complexity metrics that have radically different penalty factors and therefore radically different short- distance properties are shown to belong to the same long-distance equivalence class.

arXiv:2205.04485•Quantum•Jul 2, 2024•18 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
In this paper, we give a complete description for the full isometry groups of a class of right invariant Riemannian metrics on the special unitary group SU(2N)\mathrm{SU}(2^N)SU(2N). These metrics have been used by physicists to study Nielsen's geometric approach for complexities in quantum computations.
Nielsen’s geometric approach models quantum complexity using distances on SU(2N)\mathrm{SU}(2^N)SU(2N) with right-invariant metrics that penalize high-weight Pauli directions. This paper addresses the classification of all distance-preserving transformations for penalty metrics whose Pauli-string squared norms depend only on weight, through positive factors q1,…,qNq_1,\ldots,q_Nq1​,…,qN​.
For N≥2N\geq2N≥2, the main theorem assumes that every metric-preserving group automorphism preserves the span W1W_1W1​ of weight-one Pauli directions. Under this condition, the full isometry group is SU(2N)⋊((SO(3)N⋊Z2)⋊SN)\mathrm{SU}(2^N)\rtimes((\mathrm{SO}(3)^N\rtimes\mathbb Z_2)\rtimes S_N)SU(2N)⋊((SO(3)N⋊Z2​)⋊SN​). Thus every isometry is generated by right translations, conjugation by tensor products of single-qubit unitaries, complex conjugation, and qubit permutations. The condition holds whenever q1≠qkq_1\neq q_kq1​=qk​ for every k>1k>1k>1, covering the binomial and exponential metrics considered here. It also holds for cliff metrics with q1=q2=1q_1=q_2=1q1​=q2​=1 and qk=q>1q_k=q>1qk​=q>1 for k≥3k\geq3k≥3, provided N≥3N\geq3N≥3.
The proof first uses results on invariant metrics on compact simple Lie groups to identify the connected identity stabilizer with local-unitary conjugations. A multiplicity-free representation decomposition determines its orthogonal normalizer, leaving support-dependent sign changes as possible extra symmetries. Curvature preservation reduces these to four parity-dependent choices; symmetric-space classification excludes two for non-bi-invariant metrics.
The classification is conditional rather than applicable to every penalty schedule. In particular, the two-qubit cliff metric is bi-invariant and lies outside the stated hypothesis. No circuit-complexity bounds or explicit distance formulas are derived.
Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our approach is based on the observation that the whole problem refers to the structure of the underlying group. The questions concerning the complexity of particular unitaries are solved by lifting the abstract structure to the operator level by considering the relevant unitary representation. For the class of right-invariant metrics obeying natural invariance condition we solve the geodesic equations on oscillator group. The solution is given explicitly in terms of elementary functions. Imposing the boundary conditions yield a transcendental equation and the length of the geodesic is given in terms of the solutions to the latter. Since the unitary irreducible representations of oscillator group are classified this allows us to compute, at least in principle, the complexity of any unitary operator belonging to the representation.
The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion originally developed by Michael Nielsen (Circa, 2007). However, for nonunitary dynamics, it is unclear how one can recover a completely geometric characterization of Nielsen-like geometric complexity. The main obstacle to overcome is that nonunitary dynamics cannot be characterized by Lie groups (which are Riemannian manifolds), as is the case for unitary dynamics. Building on Nielsen's work, we present a definition of geometric complexity for a fairly generic family of quantum channels. These channels are useful for modeling noise in quantum circuits, among other things, and analyze the geometric complexity of these quantum channels.
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.
This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group—often called `complexity geometries' following the definition of quantum complexity proposed by Nielsen—and delineate the equivalence class of metrics that have the same computational power as quantum circuits. Within this universality class, any unitary that can be reached in one metric can be approximated in any other metric in the class with a slowdown that is at-worst polynomial in the length and number of qubits and inverse-polynomial in the permitted error. We describe the equivalence classes for two different kinds of error we might tolerate: Killing-distance error, and operator-norm error. All metrics in both equivalence classes are shown to have exponential diameter; all metrics in the operator-norm equivalence class are also shown to give an alternative definition of the quantum complexity class BQP. My results extend those of Nielsen et al., who in 2006 proved that one particular metric is polynomially equivalent to quantum circuits. The Nielsen et al. metric is incredibly highly curved. I show that the greatly enlarged equivalence class established in this paper also includes metrics that have modest curvature. I argue that the modest curvature makes these metrics more amenable to the tools of differential geometry, and therefore makes them more promising starting points for Nielsen's program of using differential geometry to prove complexity lowerbounds. In a previous paper my collaborators and I—inspired by the UV/IR decoupling that happens in the phenomenon of renormalization—conjectured that high- dimensional metrics that look very different at short scales will often nevertheless give rise at long scales to the same emergent effective geometry. The results of this paper provide evidence for those conjectures, since many complexity metrics that have radically different penalty factors and therefore radically different short- distance properties are shown to belong to the same long-distance equivalence class.
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.