An Introduction to Cartan's KAK Decomposition for QC Programmers

Abstract

This paper presents no new results; its goals are purely pedagogical. A special case of the Cartan Decomposition has found much utility in the field of quantum computing, especially in its sub-field of quantum compiling. This special case allows one to factor a general 2-qubit operation (i.e., an element of U(4)) into local operations applied before and after a three parameter, non-local operation. In this paper, we give a complete and rigorous proof of this special case of Cartan's Decomposition. From the point of view of QC programmers who might not be familiar with the subtleties of Lie Group Theory, the proof given here has the virtues, that it is constructive in nature, and that it uses only Linear Algebra. The constructive proof presented in this paper is implemented in some Octave/Matlab m-files that are included with the paper. Thus, this paper serves as documentation for the attached m-files.

12 pages (20 files: 1 .tex, 1 .sty, 1 .esp, 14 .m, 1 .html, 1 .jpg, 1 .xxx)

References in corpus (6)

• Optimal Quantum Circuits for General Two-Qubit Gates
• A geometric theory of non-local two-qubit operations
• Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing
• A Rudimentary Quantum Compiler(2cnd Ed.)
• Explicit closed-form parametrization of SU(3) and SU(4) in terms of complex quaternions and elementary functions
• Note on the Khaneja Glaser Decomposition

Cited by in corpus (23)

• Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
• Topological Quantum Compiling with Reinforcement Learning
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Quantum information transfer and models for black hole mechanics
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Distributing circuits over heterogeneous, modular quantum computing network architectures
• Quantum Mixed State Compiling
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Heuristics for Quantum Compiling with a Continuous Gate Set
• Quaternions in mathematical physics (1): Alphabetical bibliography
• Quantum Computation of Hydrogen Bond Dynamics and Vibrational Spectra
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
• Robust and Resource-Efficient Quantum Circuit Approximation
• Testing quantum computers with the protocol of quantum state matching
• Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate
• MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design using Mirror Gates
• On the role of the basis of measurement in quantum gate teleportation
• Use of a Quantum Computer and the Quick Medical Reference To Give an Approximate Diagnosis
• Replacing Two Controlled-U's with Two CNOTs
• Simplifying Quantum Circuits via Circuit Invariants and Dressed CNOTs
• A Quantum Convolutional Neural Network for Image Classification