Realization of a General Three-Qubit Quantum Gate

Abstract

We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.

9 pages, 10 figures, new better bounds

References in corpus (12)

• Mixed State Entanglement and Quantum Error Correction
• Elementary gates for quantum computation
• Entanglement of a Pair of Quantum Bits
• Quantum Nonlocality without Entanglement
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• On the Entangling Power of Quantum Evolutions
• A geometric theory of non-local two-qubit operations
• Efficient decomposition of quantum gates
• Local symmetry properties of pure 3-qubit states
• Exact two-qubit universal quantum circuit
• Properties of Entanglement Monotones for Three-Qubit Pure States
• Entanglement teleportation using three-qubit entanglement

Cited by in corpus (11)

• Synthesis of Quantum Logic Circuits
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Constructive Quantum Shannon Decomposition from Cartan Involutions
• Universal Programmable Quantum Circuit Schemes to Emulate an Operator
• QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
• Quantum circuit synthesis using Householder transformations
• A General Framework for Recursive Decompositions of Unitary Quantum Evolutions
• Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
• Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate
• Note on the Khaneja Glaser Decomposition
• Designing Efficient Programmable Quantum Circuits