Toffoli gate

Circuit representation of Toffoli gate

In logic circuits, the Toffoli gate (also CCNOT gate), invented by Tommaso Toffoli, is a universal reversible logic gate, which means that any reversible circuit can be constructed from Toffoli gates. It is also known as the "controlled-controlled-not" gate, which describes its action. It has 3-bit inputs and outputs; if the first two bits are both set to 1, it inverts the third bit, otherwise all bits stay the same.

Background

An input-consuming logic gate L is reversible if, for any output y, there is a unique input x such that applying L(x) = y. If a gate L is reversible, there is an inverse gate L′, which maps y to x for which L′(y) = x. From common logic gates, NOT is reversible, as can be seen from its truth table below.

INPUT	OUTPUT
0	1
1	0

The common AND gate is not reversible, however. The inputs 00, 01 and 10 are all mapped to the output 0.

Reversible gates have been studied since the 1960s. The original motivation was that reversible gates dissipate less heat (or, in principle, no heat). If we think of a logic gate as consuming its input, information is lost since less information is present in the output than was present at the input. This loss of information loses energy to the surrounding area as heat, because of thermodynamic entropy. Another way to understand this is that charges on a circuit are grounded and thus flow away, taking a small quantity of energy with them when they change state. A reversible gate only moves the states around, and since no information is lost, energy is conserved.

More recent motivation comes from quantum computing. Quantum mechanics requires the transformations to be reversible and allows more general states of the computation than classical computers (superpositions).

Universality and Toffoli gate

Any reversible gate that consumes its inputs and allows all input computations must have no more input bits than output bits, by the pigeonhole principle. For one input bit, there are two possible reversible gates. One of them is NOT. The other is the identity gate, which maps its input to the output unchanged. For two input bits, the only non-trivial gate is the controlled NOT gate, which XORs the first bit to the second bit and leaves the first bit unchanged.

Truth table	Permutation matrix form
INPUT OUTPUT  0   0   0   0  0 1 0 1 1 0 1 1 1 1 1 0	${\begin{bmatrix}1&0&0&0\\0&1&0&0\\0&0&0&1\\0&0&1&0\\\end{bmatrix}}$

Unfortunately, there are reversible functions that cannot be computed using just those gates. In other words, the set consisting of NOT and XOR gates is not universal. If we want to compute an arbitrary function using reversible gates, we need another gate. One possibility is the Toffoli gate, proposed in 1980 by Toffoli.

This gate has 3-bit inputs and outputs. If the first two bits are set, it flips the third bit. The following is a table of the input and output bits:

Truth table	Permutation matrix form
INPUT OUTPUT  0   0   0   0   0   0  0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0	${\begin{bmatrix}1&0&0&0&0&0&0&0\\0&1&0&0&0&0&0&0\\0&0&1&0&0&0&0&0\\0&0&0&1&0&0&0&0\\0&0&0&0&1&0&0&0\\0&0&0&0&0&1&0&0\\0&0&0&0&0&0&0&1\\0&0&0&0&0&0&1&0\\\end{bmatrix}}$

It can be also described as mapping bits {a, b, c} to {a, b, c XOR (a AND b)}.

The Toffoli gate is universal; this means that for any Boolean function f(x₁, x₂, ..., x_m), there is a circuit consisting of Toffoli gates that takes x₁, x₂, ..., x_m and some extra bits set to 0 or 1 to outputs x₁, x₂, ..., x_m, f(x₁, x₂, ..., x_m), and some extra bits (called garbage). Essentially, this means that one can use Toffoli gates to build systems that will perform any desired Boolean function computation in a reversible manner.

Related logic gates

The Toffoli gate can be constructed from single qubit gates and a minimum of six CNOTs.

• The Fredkin gate is a universal reversible 3-bit gate that swaps the last two bits if the first bit is 1; a controlled-swap operation.
• The n-bit Toffoli gate is a generalization of Toffoli gate. It takes n bits x₁, x₂, ..., x_n as inputs and outputs n bits. The first n−1 output bits are just x₁, ..., x_n−1. The last output bit is (x₁ AND ... AND x_n−1) XOR x_n.
• The Toffoli gate can be realized by five two-qubit quantum gates.

• A related quantum gate, the Deutsch gate, can be realized by five optical pulses with neutral atoms.

Relation to quantum computing

Any reversible gate can be implemented on a quantum computer, and hence the Toffoli gate is also a quantum operator. However, the Toffoli gate can not be used for universal quantum computation, though it does mean that a quantum computer can implement all possible classical computations. The Toffoli gate has to be implemented along with some inherently quantum gate(s) in order to be universal for quantum computation. In fact, any single-qubit gate with real coefficients that can create a nontrivial quantum state suffices. A quantum mechanics-based Toffoli gate has been successfully realized in January 2009 at the University of Innsbruck, Austria.

See also

• Fredkin gate
• Reversible computing
• Bijection
• Quantum computing
• Quantum gate
• Quantum programming
• Adiabatic logic

External links

• CNOT and Toffoli Gates in Multi-Qubit Setting at the Wolfram Demonstrations Project.