Matrix computations (3rd ed.)
Quantum computation and quantum information
Quantum computation and quantum information
An arbitrary twoqubit computation In 23 elementary gates or less
Proceedings of the 40th annual Design Automation Conference
Note on the Khaneja glaser decomposition
Quantum Information & Computation
Transformation of quantum states using uniformly controlled rotations
Quantum Information & Computation
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An algebraic approach for quantum computation
Journal of Computing Sciences in Colleges
Block-based quantum-logic synthesis
Quantum Information & Computation
Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate
Quantum Information & Computation
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition
Quantum Information & Computation
| Hi-index | 0.01 |
We provide a new algorithm that translates a unitary matrix into a quantum circuit accordingto the G = KAK theorem in Lie group theory. With our algorithm, any matrixdecomposition corresponding to type-AIII KAK decompositions can be derived according to thegiven Cartan involution. Our algorithm contains, as its special cases, CosineSine decomposition(CSD) and Khaneja-Glaser decomposition (KGD) in the sense thatit derives the same quantum circuits as the ones obtained by them if we select suitableCartan involutions and square root matrices. The selections of Cartan involutions forcomputing CSD and KGD will be shown explicitly. As an example, we show explicitlythat our method can automatically reproduce the well-known efficient quantum circuitfor the n-qubit quantum Fourier transform.