Papers › An Introduction to Cartan's KAK Decomposition for QC Programmers
An Introduction to Cartan's KAK Decomposition for QC Programmers
Robert R. Tucci
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections