Elementary gates for quantum computation.

  title={Elementary gates for quantum computation.},
  author={Barenco and Bennett and Cleve and DiVincenzo and Margolus and Shor and Sleator and Smolin and Weinfurter},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  volume={52 5},
  • Barenco, Bennett, Weinfurter
  • Published 23 March 1995
  • Mathematics
  • Physical review. A, Atomic, molecular, and optical physics
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values (x,y) to (x,x ⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n )) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the… 
Universality for Sets of Three-Valued Qubit Gates
This paper does a review of the theory behind some essential proofs of quantum gate universality for qubit gates and shows a new way of extending those statements to arbitrary qutrit (qudits with 3 basis states) gates in an analogous manner.
The Classification of Reversible Bit Operations
We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are
Universality for Sets of Three-Valued Qubit (qutrit) Gates
How to find universal sets quantum gates (gates whose composition can form any other gate within a given range) is an important part of the development of quantum computation science that has been
Smaller two-qubit circuits for quantum communication and computation
This work shows how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts, and improves an earlier lower bound of 17 elementary gates by Bullock and Markov to 18.
Quantum circuits with uniformly controlled one-qubit gates (7 pages)
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which
Halving the cost of quantum addition
An n-bit controlled adder circuit with T-count of 8n+O(1), a temporary adder that can be computed for the same cost as the normal adder but whose result can be kept until it is later uncomputed without using T gates, and some other constructions whose T- Count is improved by the temporary logical-AND.
It is shown that adding ancilla qubits slightly increases the complexity of a given circuit by the order of 3n, which pales in comparison to the complex of the original circuit of...
On Universal and Fault-Tolerant Quantum Computing
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis
Ii. Quantum Gates and Circuits
  • Physics
  • 1997
1 Quantum gates Changes occurring to a quantum state vector can be modeled using a quantum circuit, composed of wires and elementary gates, much as normal electronic circuits are used to describe
Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions
A frequent physical-level requirement for the ability to implement quantum operations simultaneously is their commutativity. In this work, we asked if quantum computation by commuting Ising-type


Two-bit gates are universal for quantum computation.
  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The
Results on two-bit gate design for quantum computers
Numerical results show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates.
Quantum complexity theory
This paper gives the first formal evidence that quantum Turing machines violate the modern (complexity theoretic) formulation of the Church--Turing thesis, and proves that bits of precision suffice to support a step computation.
Quantum Circuit Complexity
  • A. Yao
  • Computer Science
  • 1993
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them.
Almost any quantum logic gate is universal.
  • Lloyd
  • Physics
    Physical review letters
  • 1995
Almost any quantum logic gate with two or more inputs is computationally universal in that copies of the gate can be "wired together" to effect any desired logic circuit, and to perform any desired unitary transformation on a set of quantum variables.
A universal two-bit gate for quantum computation
  • A. Barenco
  • Mathematics
    Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1995
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
Quantum Computers, Factoring, and Decoherence
Here it is shown how the decoherence process degrades the interference pattern that emerges from the quantum factoring algorithm, a problem of practical significance for cryptographic applications.
Realizable Universal Quantum Logic Gates.
This work identifies a 2-bit quantum gate that is sufficient to build any quantum logic network and proposes an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.
Computing Algebraic Formulas Using a Constant Number of Registers
It is shown that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by algebraic straight-line programs that use only three registers, which is an improvement over previous methods that require the number of registers to be logarithmic in the size of the formulas.
On the power of quantum computation
  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.