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

Quantum Information and Computation•Jan 1, 2006•49 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

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

Hai‐Rui Wei, 狄尧民, 张洁

量门的最佳的实现为量计算的实现是关键的。我们稍微为 n-qubits 修改 Khaneja-Glaser 分解(KGD ) 并且在分解的第二步给新 Cartan subalgbra。基于这修改 KGD,我们调查 three-qubit 逻辑门的实现并且获得一扇一般 three-qubit 量逻辑门能被实现至多关于 y 和 z 斧子和 26 扇 CNOT 门使用 73 one-qubit 门旋转的结果。[从作者抽象]

Chinese Physics Letters•Jan 1, 2008•0 citations

A new algorithm for producing quantum circuits using KAK decompositions

Yumi Nakajima A, Yasuhito 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 hown 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•Sep 28, 2005•2 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•37 citations
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.
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.
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 hown 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.
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.