A new algorithm for producing quantum circuits using KAK decompositions
arXiv:quant-ph/0509196
Abstract
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.
14 pages, 4 figures, to appear in Quantum Information & Computation, vol. 6, no. 1, 067-080 (2006)
References in corpus (9)
- Elementary gates for quantum computation
- Time Optimal Control in Spin Systems
- Quantum Circuits for General Multiqubit Gates
- Decompositions of general quantum gates
- An Arbitrary Two-qubit Computation In 23 Elementary Gates
- A Rudimentary Quantum Compiler
- Cartan Decomposition of SU(2^n), Constructive Controllability of Spin systems and Universal Quantum Computing
- Time Reversal and n-qubit Canonical Decompositions
- Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition