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

Results in Mathematics

On the Refinement of Cartan Decomposition: An Implicit Commutative Substructure in $$\mathfrak {su}(2^{n})$$

Moody T. Chu

Published Jul 19, 2025• 1 citation
Publisher

Abstract

Abstract The Cartan decomposition of a semisimple Lie algebra is pivotal in both theoretical exploration and practical application. It generalizes the classical spectral, polar, and singular value decompositions found in linear algebra. This paper explores an advanced refinement of the Cartan decomposition of $$\mathfrak {su}(2^{n})$$ su ( 2 n ) , arising from the parameterization of a Hamiltonian for quantum simulation. Specifically, given an AI-type Cartan decomposition $${\mathfrak {g}} = {\mathfrak {k}} \oplus {\mathfrak {p}}$$ g = k ⊕ p of any Lie subalgebra $${\mathfrak {g}}$$ g in $$\mathfrak {su}(2^{n})$$ su ( 2 n ) , where $${\mathfrak {p}} = \widetilde{{\mathfrak {p}}} \oplus {\mathfrak {h}}$$ p = p ~ ⊕ h and $${\mathfrak {h}}$$ h is the maximal abelian subalgebra in $${\mathfrak {p}}$$ p , it is revealed that both the subalgebra $${\mathfrak {k}}$$ k and the corresponding $$\widetilde{{\mathfrak {p}}}$$ p ~ (which is generally not a subalgebra) can further be partitioned, respectively, as the direct sums of equal-dimensional commutative Lie subalgebras. With respect to the involution $$\theta (g)=-g^{\top }$$ θ ( g ) = - g ⊤ , any Lie subalgebra $${\mathfrak {g}}$$ g in $$\mathfrak {su}(2^{n})$$ su ( 2 n ) with nondegenerate Cartan decomposition can thus be fully decomposed as the orthogonal direct sum of $${\mathfrak {h}}$$ h and pairs of commutative Lie subalgebras over $${\mathfrak {k}}$$ k and $$\widetilde{{\mathfrak {p}}}$$ p ~ , all of which, except $${\mathfrak {h}}$$ h , share the same dimension.

DOI
10.1007/s00025-025-02478-3

Related papers

A Scheme of Cartan Decomposition for su(N)

Zheng-Yao Su

A scheme to perform the Cartan decomposition for the Lie algebra su(N) of arbitrary finite dimensions is introduced. The schme is based on two algebraic structures, the conjugate partition and the quotient algebra, that are easily generated by a Cartan subalgebra and generally exist in su(N). In particular, the Lie algebras su(2^p) and every su(2^{p-1} < N < 2^p) share the isomorphic structure of the quotient algebra. This structure enables an efficient algorithm for the recursive and exhaustive construction of Cartan decompositions. Further with the scheme, a unitary transformation in SU(N) can be recursively decomposed into a product of certain designated operators, e.g., local and nonlocal gates. Such a recursive decomposition of a transformation implies an evolution path on the manifold of the group.

arXiv:quant-ph/0603190•Mar 22, 2006•14 citations

Lie Group Decompositions and Control

Domenico D’Alessandro

This chapter discusses in detail the case of two-level systems and the associated Lie group. It gives an example of a general decomposition of SU(n), namely the decomposition into planar rotation, which is quite simple and can be obtained by straightforward computations. This decomposition gives a direct way to parametrize the special unitary group. The chapter presents the basics of Cartan decompositions of semisimple Lie groups. It gives some examples of applications of Lie group decompositions and introduces some notions of Lie group and Lie algebra theory. The chapter discusses Cartan decompositions of Lie groups. Cartan decompositions appear to be ubiquitous in quantum control and dynamics and in quantum information theory.

Chapman & Hall/CRC eBooks•Jul 13, 2021•0 citations

Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms

John A. Mora Rodríguez, Arthur C. R. Dutra, Henrique N. Sá Earp +1 more

We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $\mathrm{SU}\left(2^n\right)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by Sá Earp and Pachos (2005), we overcome key limitations of their method, such as reliance on ill-defined matrix logarithms and the convergence issues of truncated Baker-Campbell-Hausdorff (BCH) series. Our reformulation leverages the algebraic structure of involutive automorphisms and symmetric Lie algebra decompositions to yield a stable and recursive factorization process. We provide a full Python implementation of the algorithm, available in an open-source repository, and validate its performance on matrices in $\mathrm{SU}(8)$ and $\mathrm{SU}(16)$ using random unitary benchmarks. The algorithm produces decompositions that are directly suited to practical quantum hardware, with factors that can be implemented near-optimally using standard gate sets.

arXiv:2509.05468•Pure and Applied Mathematics Quarterly•Jan 1, 2026•1 citation

Note on the Khaneja Glaser decomposition

Stephen S. Bullock

Recently, Vatan and Williams utilize a matrix decomposition of $SU(2^n)$ introduced by Khaneja and Glaser to produce {\tt CNOT}-efficient circuits for arbitrary three-qubit unitary evolutions. In this note, we place the Khaneja Glaser Decomposition ({\tt KGD}) in context as a $SU(2^n)=KAK$ decomposition by proving that its Cartan involution is type {\bf AIII}, given $n \geq 3$. The standard type {\bf AIII} involution produces the Cosine-Sine Decomposition (CSD), a well-known decomposition in numerical linear algebra which may be computed using mature, stable algorithms. In the course of our proof that the new decomposition is type {\bf AIII}, we further establish the following. Khaneja and Glaser allow for a particular degree of freedom, namely the choice of a commutative algebra $\mathfrak{a}$, in their construction. Let $\chi_1^n$ be a {\tt SWAP} gate applied on qubits $1$, $n$. Then $\chi_1^n v \chi_1^n=k_1\; a \; k_2$ is a KGD for $\mathfrak{a}=\mbox{span}_{\mathbb{R}} \{ \chi_1^n ( \ket{j}\bra{N-j-1} -\ket{N-j-1}\bra{j}) \chi_1^n \}$ if and only if $v=(\chi_1^n k_1 \chi_1^n) (\chi_1^n a \chi_1^n)(\chi_1^n k_2 \chi_1^n)$ is a CSD.

arXiv:quant-ph/0403141•Quantum Information and Computation•Sep 1, 2004•25 citations

Preparing Hamiltonians for quantum simulation: A computational framework for Cartan decomposition via Lax dynamics

Moody T. Chu

Quantum algorithms usually are described via quantum circuits representable as unitary operators. Synthesizing the unitary operators described mathematically in terms of the unitary operators recognizable as quantum circuits is essential. One such a challenge lies in the Hamiltonian simulation problem, where the matrix exponential of a large-scale skew-Hermitian matrix is to be computed. Most current techniques are prone to approximation errors, whereas the parametrization of the underlying Hamiltonian via the Cartan decomposition is more promising. To prepare for such a simulation, this work proposes to tackle the Cartan decomposition by means of the Lax dynamics. The advantages include not only that it is numerically feasible with no matrices involved, but also that this approach offers a genuine unitary synthesis within the integration errors. This work contributes to the theoretic and algorithmic foundations in three aspects: exploiting the quaternary representation of Hamiltonian subalgebras; describing a common mechanism for deriving the Lax dynamics; and providing a mathematical theory of convergence.

Mathematics of Computation•Dec 11, 2024•3 citations

Near-optimal quantum circuit construction via Cartan decomposition

Maximilian Balthasar Mansky, Santiago Londoño Castillo, Victor Ramos Puigvert +1 more

We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum circuit representations of the algebraic generators of the relevant Lie algebras allowing the direct implementation of a Cartan decomposition on a quantum computer. The construction is recursive and allows us to expand any circuit down to generators and rotation matrices on individual qubits, where through our recursive algorithm we find that the generators themselves can be expressed with controlled-not (cnot) and swap gates explicitly. Our approach is independent of the standard cnot implementation and can be easily adapted to other cross-qubit circuit elements. In addition to its versatility, we also achieve near-optimal counts when working with cnot gates, achieving an asymptotic cnot cost of $\frac{21}{16}{4}^{n}$ for $n$ qubits.

arXiv:2212.12934•Physical Review A•Nov 15, 2023•13 citations
On the Refinement of Cartan Decomposition: An Implicit Commutative Substructure in su(2n)\mathfrak {su}(2^{n})su(2n)
Abstract The Cartan decomposition of a semisimple Lie algebra is pivotal in both theoretical exploration and practical application. It generalizes the classical spectral, polar, and singular value decompositions found in linear algebra. This paper explores an advanced refinement of the Cartan decomposition of su(2n)\mathfrak {su}(2^{n})su(2n) su ( 2 n ) , arising from the parameterization of a Hamiltonian for quantum simulation. Specifically, given an AI-type Cartan decomposition g=k⊕p{\mathfrak {g}} = {\mathfrak {k}} \oplus {\mathfrak {p}}g=k⊕p g = k ⊕ p of any Lie subalgebra g{\mathfrak {g}}g g in su(2n)\mathfrak {su}(2^{n})su(2n) su ( 2 n ) , where p=p~⊕h{\mathfrak {p}} = \widetilde{{\mathfrak {p}}} \oplus {\mathfrak {h}}p=p​⊕h p = p ~ ⊕ h and h{\mathfrak {h}}h h is the maximal abelian subalgebra in p{\mathfrak {p}}p p , it is revealed that both the subalgebra k{\mathfrak {k}}k k and the corresponding p~\widetilde{{\mathfrak {p}}}p​ p ~ (which is generally not a subalgebra) can further be partitioned, respectively, as the direct sums of equal-dimensional commutative Lie subalgebras. With respect to the involution θ(g)=−g⊤\theta (g)=-g^{\top }θ(g)=−g⊤ θ ( g ) = - g ⊤ , any Lie subalgebra g{\mathfrak {g}}g g in su(2n)\mathfrak {su}(2^{n})su(2n) su ( 2 n ) with nondegenerate Cartan decomposition can thus be fully decomposed as the orthogonal direct sum of h{\mathfrak {h}}h h and pairs of commutative Lie subalgebras over k{\mathfrak {k}}k k and p~\widetilde{{\mathfrak {p}}}p​ p ~ , all of which, except h{\mathfrak {h}}h h , share the same dimension.
A scheme to perform the Cartan decomposition for the Lie algebra su(N) of arbitrary finite dimensions is introduced. The schme is based on two algebraic structures, the conjugate partition and the quotient algebra, that are easily generated by a Cartan subalgebra and generally exist in su(N). In particular, the Lie algebras su(2^p) and every su(2^{p-1} < N < 2^p) share the isomorphic structure of the quotient algebra. This structure enables an efficient algorithm for the recursive and exhaustive construction of Cartan decompositions. Further with the scheme, a unitary transformation in SU(N) can be recursively decomposed into a product of certain designated operators, e.g., local and nonlocal gates. Such a recursive decomposition of a transformation implies an evolution path on the manifold of the group.
This chapter discusses in detail the case of two-level systems and the associated Lie group. It gives an example of a general decomposition of SU(n), namely the decomposition into planar rotation, which is quite simple and can be obtained by straightforward computations. This decomposition gives a direct way to parametrize the special unitary group. The chapter presents the basics of Cartan decompositions of semisimple Lie groups. It gives some examples of applications of Lie group decompositions and introduces some notions of Lie group and Lie algebra theory. The chapter discusses Cartan decompositions of Lie groups. Cartan decompositions appear to be ubiquitous in quantum control and dynamics and in quantum information theory.
Cartan-Khaneja-Glaser decomposition of SU(2n)SU(2^n)SU(2n) via involutive automorphisms
We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in SU(2n)\mathrm{SU}\left(2^n\right)SU(2n), a critical task for efficient quantum circuit design. Building upon the approach introduced by Sá Earp and Pachos (2005), we overcome key limitations of their method, such as reliance on ill-defined matrix logarithms and the convergence issues of truncated Baker-Campbell-Hausdorff (BCH) series. Our reformulation leverages the algebraic structure of involutive automorphisms and symmetric Lie algebra decompositions to yield a stable and recursive factorization process. We provide a full Python implementation of the algorithm, available in an open-source repository, and validate its performance on matrices in SU(8)\mathrm{SU}(8)SU(8) and SU(16)\mathrm{SU}(16)SU(16) using random unitary benchmarks. The algorithm produces decompositions that are directly suited to practical quantum hardware, with factors that can be implemented near-optimally using standard gate sets.
Recently, Vatan and Williams utilize a matrix decomposition of SU(2n)SU(2^n)SU(2n) introduced by Khaneja and Glaser to produce {\tt CNOT}-efficient circuits for arbitrary three-qubit unitary evolutions. In this note, we place the Khaneja Glaser Decomposition ({\tt KGD}) in context as a SU(2n)=KAKSU(2^n)=KAKSU(2n)=KAK decomposition by proving that its Cartan involution is type {\bf AIII}, given n≥3n \geq 3n≥3. The standard type {\bf AIII} involution produces the Cosine-Sine Decomposition (CSD), a well-known decomposition in numerical linear algebra which may be computed using mature, stable algorithms. In the course of our proof that the new decomposition is type {\bf AIII}, we further establish the following. Khaneja and Glaser allow for a particular degree of freedom, namely the choice of a commutative algebra a\mathfrak{a}a, in their construction. Let χ1n\chi_1^nχ1n​ be a {\tt SWAP} gate applied on qubits 111, nnn. Then χ1nvχ1n=k1  a  k2\chi_1^n v \chi_1^n=k_1\; a \; k_2χ1n​vχ1n​=k1​ak2​ is a KGD for $\mathfrak{a}=\mbox{span}_{\mathbb{R}} \{ \chi_1^n ( \ket{j}\bra{N-j-1} -\ket{N-j-1}\bra{j}) \chi_1^n \}$ if and only if v=(χ1nk1χ1n)(χ1naχ1n)(χ1nk2χ1n)v=(\chi_1^n k_1 \chi_1^n) (\chi_1^n a \chi_1^n)(\chi_1^n k_2 \chi_1^n)v=(χ1n​k1​χ1n​)(χ1n​aχ1n​)(χ1n​k2​χ1n​) is a CSD.
Quantum algorithms usually are described via quantum circuits representable as unitary operators. Synthesizing the unitary operators described mathematically in terms of the unitary operators recognizable as quantum circuits is essential. One such a challenge lies in the Hamiltonian simulation problem, where the matrix exponential of a large-scale skew-Hermitian matrix is to be computed. Most current techniques are prone to approximation errors, whereas the parametrization of the underlying Hamiltonian via the Cartan decomposition is more promising. To prepare for such a simulation, this work proposes to tackle the Cartan decomposition by means of the Lax dynamics. The advantages include not only that it is numerically feasible with no matrices involved, but also that this approach offers a genuine unitary synthesis within the integration errors. This work contributes to the theoretic and algorithmic foundations in three aspects: exploiting the quaternary representation of Hamiltonian subalgebras; describing a common mechanism for deriving the Lax dynamics; and providing a mathematical theory of convergence.
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation. Our method finds explicit quantum circuit representations of the algebraic generators of the relevant Lie algebras allowing the direct implementation of a Cartan decomposition on a quantum computer. The construction is recursive and allows us to expand any circuit down to generators and rotation matrices on individual qubits, where through our recursive algorithm we find that the generators themselves can be expressed with controlled-not (cnot) and swap gates explicitly. Our approach is independent of the standard cnot implementation and can be easily adapted to other cross-qubit circuit elements. In addition to its versatility, we also achieve near-optimal counts when working with cnot gates, achieving an asymptotic cnot cost of 21164n\frac{21}{16}{4}^{n}1621​4n for nnn qubits.