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:quant-ph/0403141 · Quantum Information and Computation

Note on the Khaneja Glaser decomposition

Stephen S. Bullock

Published Sep 1, 2004• 25 citations
arXivHTMLPDF

Abstract

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.

DOI
10.26421/qic4.5-5

Related papers

A new algorithm for producing quantum circuits using KAK decompositions

M.Y. Nakajima, Y. Kawano, Hiroshi Sekigawa

We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived according to the given Cartan involution. Our algorithm contains, as its special cases, Cosine-Sine decomposition (CSD) and Khaneja-Glaser decomposition (KGD) in the sense that it derives the same quantum circuits as the ones obtained by them if we select suitable Cartan involutions and square root matrices. The selections of Cartan involutions for computing CSD and KGD will be shown explicitly. As an example, we show explicitly that our method can automatically reproduce the well-known efficient quantum circuit for the $n$-qubit quantum Fourier transform.

arXiv:quant-ph/0509196•Quantum Information and Computation•Jan 1, 2006•59 citations

Modified Khaneja–Glaser Decomposition and Realization of Three-Qubit Quantum Gate

Hai‐Rui Wei, Yao-Min Di, ZHANG-Jie

Optimal implementation of quantum gates is crucial for realization of quantum computation. We slightly modify the Khaneja-Glaser decomposition (KGD) for n-qubits and give a new Cartan subalgbra in the second step of the decomposition. Based on this modified KGD, we investigate the realization of three-qubit logic gate and obtain the result that a general three-qubit quantum logic gate can be implemented using at most 73 one-qubit gates rotations with respect to the y and z axes and 26 CNOT gates.

Chinese Physics Letters•Sep 1, 2008•8 citations

Constructive quantum Shannon decomposition from Cartan involutions

Byron C. Drury, Peter J. Love

The work presented here extends upon the best known universal quantum circuit, the Quantum Shannon Decomposition proposed in [Vivek V. Shende, Stephen S. Bullock and Igor Markov, Synthesis of Quantum Logic Circuits, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25 (6): 1000-1010 (2006)]. We obtain the basis of the circuit's design in a pair of Cartan decompositions. This insight gives a simple constructive algorithm for obtaining the Quantum Shannon Decomposition of a given unitary matrix in terms of the corresponding Cartan involutions.

arXiv:0806.4015•Journal of Physics A Mathematical and Theoretical•Sep 4, 2008•43 citations

Block- ZXZ synthesis of an arbitrary quantum circuit

Alexis De Vos, Stijn De Baerdemacker

Given an arbitrary ${2}^{w}\ifmmode\times\else\texttimes\fi{}{2}^{w}$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by H. F\"uhr and Z. Rzeszotnik [Linear Algebra Its Appl. 484, 86 (2015)] generalizing the scaling of single-bit unitary gates ($w=1$) to gates with arbitrary value of $w$. The synthesized circuit consists of controlled one-qubit gates, such as negator gates and phasor gates. Interestingly, the approach reduces to a known synthesis method for classical logic circuits consisting of controlled not gates in the case that $U$ is a permutation matrix.

arXiv:1512.07240•Physical Review A•Nov 14, 2016•31 citations

Beyond quantum Shannon decomposition: Circuit construction for n -qubit gates based on block- Z X Z decomposition

Anna M. Krol, Zaid Al-Ars

This paper proposes an optimized quantum block-$ZXZ$ decomposition method that results in more optimal quantum circuits than the quantum Shannon decomposition, which was presented in 2005 by M. M\"ott\"onen, and J. J. Vartiainen [in Trends in quantum computing research, edited by S. Shannon (Nova Science Publishers, 2006) Chap. 7, p. 149, arXiv:quant-ph/0504100]. The decomposition is applied recursively to generic quantum gates, and can take advantage of existing and future small-circuit optimizations. Because our method uses only single-qubit gates and uniformly controlled rotation-Z gates, it can easily be adapted to use other types of multi-qubit gates. With the proposed decomposition, a general three-qubit gate can be decomposed using 19 cnot gates (rather than 20). For general $n$-qubit gates, the proposed decomposition generates circuits that have $\frac{22}{48}{4}^{n}\ensuremath{-}\frac{3}{2}{2}^{n}+\frac{5}{3}$ cnot gates, which is less than the best-known exact decomposition algorithm by $({4}^{n\ensuremath{-}2}\ensuremath{-}1)/3$ cnot gates.

arXiv:2403.13692•Physical Review Applied•Sep 9, 2024•25 citations

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

Moody T. Chu

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.

Results in Mathematics•Jul 19, 2025•1 citation
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 a=\mboxspanR{χ1n(∣j⟩⟨N−j−1∣−∣N−j−1⟩⟨j∣)χ1n}\mathfrak{a}=\mbox{span}_{\mathbb{R}} \{ \chi_1^n ( \ket{j}\bra{N-j-1} -\ket{N-j-1}\bra{j}) \chi_1^n \}a=\mboxspanR​{χ1n​(∣j⟩⟨N−j−1∣−∣N−j−1⟩⟨j∣)χ1n​} 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.
We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived according to the given Cartan involution. Our algorithm contains, as its special cases, Cosine-Sine decomposition (CSD) and Khaneja-Glaser decomposition (KGD) in the sense that it derives the same quantum circuits as the ones obtained by them if we select suitable Cartan involutions and square root matrices. The selections of Cartan involutions for computing CSD and KGD will be shown explicitly. As an example, we show explicitly that our method can automatically reproduce the well-known efficient quantum circuit for the nnn-qubit quantum Fourier transform.
Optimal implementation of quantum gates is crucial for realization of quantum computation. We slightly modify the Khaneja-Glaser decomposition (KGD) for n-qubits and give a new Cartan subalgbra in the second step of the decomposition. Based on this modified KGD, we investigate the realization of three-qubit logic gate and obtain the result that a general three-qubit quantum logic gate can be implemented using at most 73 one-qubit gates rotations with respect to the y and z axes and 26 CNOT gates.
The work presented here extends upon the best known universal quantum circuit, the Quantum Shannon Decomposition proposed in [Vivek V. Shende, Stephen S. Bullock and Igor Markov, Synthesis of Quantum Logic Circuits, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25 (6): 1000-1010 (2006)]. We obtain the basis of the circuit's design in a pair of Cartan decompositions. This insight gives a simple constructive algorithm for obtaining the Quantum Shannon Decomposition of a given unitary matrix in terms of the corresponding Cartan involutions.
Given an arbitrary ${2}^{w}\ifmmode\times\else\texttimes\fi{}{2}^{w}$ unitary matrix UUU, a powerful matrix decomposition can be applied, leading to four different syntheses of a www-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by H. F\"uhr and Z. Rzeszotnik [Linear Algebra Its Appl. 484, 86 (2015)] generalizing the scaling of single-bit unitary gates (w=1w=1w=1) to gates with arbitrary value of www. The synthesized circuit consists of controlled one-qubit gates, such as negator gates and phasor gates. Interestingly, the approach reduces to a known synthesis method for classical logic circuits consisting of controlled not gates in the case that UUU is a permutation matrix.
This paper proposes an optimized quantum block-ZXZZXZZXZ decomposition method that results in more optimal quantum circuits than the quantum Shannon decomposition, which was presented in 2005 by M. M\"ott\"onen, and J. J. Vartiainen [in Trends in quantum computing research, edited by S. Shannon (Nova Science Publishers, 2006) Chap. 7, p. 149, arXiv:quant-ph/0504100]. The decomposition is applied recursively to generic quantum gates, and can take advantage of existing and future small-circuit optimizations. Because our method uses only single-qubit gates and uniformly controlled rotation-Z gates, it can easily be adapted to use other types of multi-qubit gates. With the proposed decomposition, a general three-qubit gate can be decomposed using 19 cnot gates (rather than 20). For general nnn-qubit gates, the proposed decomposition generates circuits that have $\frac{22}{48}{4}^{n}\ensuremath{-}\frac{3}{2}{2}^{n}+\frac{5}{3}$ cnot gates, which is less than the best-known exact decomposition algorithm by $({4}^{n\ensuremath{-}2}\ensuremath{-}1)/3$ cnot gates.
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.