A Universal Two--Bit Gate for Quantum Computation

Abstract

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.

3 pages, RevTeX, two figures in a uuencoded file

References in corpus (1)

• Universality in Quantum Computation

Cited by in corpus (91)

• Elementary gates for quantum computation
• Measurement of conditional phase shifts for quantum logic
• Quantum Computing
• Multiple Particle Interference and Quantum Error Correction
• Quantum Networks for Elementary Arithmetic Operations
• On the role of entanglement in quantum computational speed-up
• Preserving coherence in quantum computation by pairing quantum bits
• Information and Computation: Classical and Quantum Aspects
• Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
• A geometric theory of non-local two-qubit operations
• Multi-valued Logic Gates for Quantum Computation
• Efficient Simulation of Quantum Systems by Quantum Computers
• Quantum simulation and computing with Rydberg-interacting qubits
• Universality in Quantum Computation
• The Ion Trap Quantum Information Processor
• A universal quantum circuit for two-qubit transformations with three CNOT gates
• Quantum Computing with NMR
• Approximate Quantum Fourier Transform and Decoherence
• Basics of Quantum Computation
• Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
• Quantum Physics and Computers
• A Self Assembled Nanoelectronic Quantum Computer Based on the Rashba Effect in Quantum Dots
• Quantum gates with "hot" trapped ions
• Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
• Quantum Computation
• Characterization of two-qubit perfect entanglers
• Quantum Logic Gates and Nuclear Magnetic Resonance Pulse Sequences
• On Universal and Fault-Tolerant Quantum Computing
• Quantum logic and entanglement by neutral Rydberg atoms: methods and fidelity
• Fidelity and leakage of Josephson qubits
• Single-step implementation of high fidelity $n$-bit Toffoli gate
• Applications of coherent classical communication and the Schur transform to quantum information theory
• Quantum Computer with Mixed States and Four-Valued Logic
• Quantum computation with mesoscopic superposition states
• Experimental Realization of A Two Bit Phase Damping Quantum Code
• Implementing unitary operators in quantum computation
• Conditions for optimal construction of two-qubit non-local gates
• Graphene-based qubits in quantum communications
• Double-Transmon Coupler: Fast Two-Qubit Gate with No Residual Coupling for Highly Detuned Superconducting Qubits
• Efficiency of Producing Random Unitary Matrices with Quantum Circuits
• Digital Switching in the Quantum Domain
• Decoherence, Control, and Symmetry in Quantum Computers
• A universal set of qubit quantum channels
• Quantum computing with spin qubits in semiconductor structures
• Unitary transformations can be identified locally
• Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
• The Quantum Schur Transform: I. Efficient Qudit Circuits
• A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing
• Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
• Quantum simulation of partially distinguishable boson sampling
• Experimental implementation of optimal linear-optical controlled-unitary gates
• Quantum circuit synthesis using Householder transformations
• Quantum lattice gas algorithmic representation of gauge field theory
• Universal set of scalable dynamically corrected gates for quantum error correction with always-on qubit couplings
• Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
• Controlling NMR spin systems for quantum computation
• Quantum Ballistic Evolution in Quantum Mechanics: Application to Quantum Computers
• Dephasing-assisted entanglement in a system of strongly coupled qubits
• Signal processing techniques for efficient compilation of controlled rotations in trapped ions
• Cyclic groups and quantum logic gates
• Universal Barenco quantum gates via a tunable non-collinear interaction
• Co-Designed Architectures for Modular Superconducting Quantum Computers
• Quantum Computing via The Bethe Ansatz
• Characterization of universal two-qubit Hamiltonians
• Universal quantum computation with symmetric qubit clusters coupled to an environment
• Quantum-phase synchronization
• A minimum control ancilla driven quantum computation scheme with repeat-until-success style gate generation
• Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits
• Hardness of braided quantum circuit optimization in the surface code
• On Parametrization of the Linear GL(4,C) and Unitary SU(4) Groups in Terms of Dirac Matrices
• Manifold algorithmic errors in quantum computers with static internal imperfections
• PSPACE has 2-round quantum interactive proof systems
• Experimental Realization of an NMR Quantum Switch
• Mathematical Models of Contemporary Elementary Quantum Computing Devices
• Information-Theoretic Meaning of Quantum Information Flow and Its Applications to Amplitude Amplification Algorithms
• Quantum Phase Estimation Algorithm for Finding Polynomial Roots
• New Trends in Quantum Computing
• Characteristics, Implementation and Applications of Special Perfect Entangler Circuits
• Single and double qubit gates by manipulating degeneracy
• Reversible Logic Circuit Complexity Analysis via Functional Decomposition
• Minimal ancilla mediated quantum computation
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• A Review of Procedure to Evolve Quantum Procedures
• Some Notes on Quantum Information Theory and Emerging Computing Technologies
• Efficient Classical Simulation of the DQC1 Circuit with Zero Discord
• Open n-Qubit System as a Quantum Computer with Four-Valued Logic
• Quantum Computation: A Computer Science Perspective
• Nonlocal characteristics and argand diagram of two-qubit gates
• A complete transformation rule set and a minimal equation set for CNOT-based 3-qubit quantum circuits (Draft)
• One-way Functions In Reversible Computations
• Barenco gate implementation using driven two- and three-qubit spin chains