Constructive Quantum Shannon Decomposition from Cartan Involutions
arXiv:0806.4015 · doi:10.1088/1751-8113/41/39/395305
Abstract
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.
References in corpus (32)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Simulated Quantum Computation of Molecular Energies
- Time Optimal Control in Spin Systems
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Synthesis of Quantum Logic Circuits
- Optimal Quantum Circuits for General Two-Qubit Gates
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Efficient Simulation of Quantum Systems by Quantum Computers
- Quantum Circuits for General Multiqubit Gates
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- Experimental Controlled-NOT Logic Gate for Single Photons in the Coincidence Basis
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Minimal Universal Two-qubit Quantum Circuits
- Efficient decomposition of quantum gates
- Experimental demonstration of a non-destructive controlled-NOT quantum gate for two independent photon-qubits
- Approximation by Quantum Circuits
- Simulations of Many-Body Quantum Systems by a Quantum Computer
- Quantum Algorithms and the Fourier Transform
- Simulating quantum mechanics on a quantum computer
- One-Loop Amplitudes in Euclidean Quantum Gravity
- Exact two-qubit universal quantum circuit
- Recognizing Small-Circuit Structure in Two-Qubit Operators and Timing Hamiltonians to Compute Controlled-Not Gates
- Canonical Decompositions of n-qubit Quantum Computations and Concurrence
- Realization of a General Three-Qubit Quantum Gate
- A constructive algorithm for the Cartan decomposition of SU(2^N)
- Coupling of Josephson current qubits using a connecting loop
- A General Framework for Recursive Decompositions of Unitary Quantum Evolutions
- Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate
- A new algorithm for producing quantum circuits using KAK decompositions
Cited by in corpus (16)
- Quantum-state preparation with universal gate decompositions
- Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
- Fixed Depth Hamiltonian Simulation via Cartan Decomposition
- Evaluating energy differences on a quantum computer with robust phase estimation
- Stabilizing multiple topological fermions on a quantum computer
- Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
- Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
- Universal Programmable Quantum Circuit Schemes to Emulate an Operator
- Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
- Primitive Quantum Gates for an SU(3) Discrete Subgroup:
- Nearly-optimal state preparation for quantum simulations of lattice gauge theories
- Hybrid Stabilizer Matrix Product Operator
- An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices
- Characterizing Coherent Errors using Matrix-Element Amplification
- Capturing the Page Curve and Entanglement Dynamics of Black Holes in Quantum Computers
- Quantum circuit synthesis with SQiSW