Toffoli gate
From Wikipedia, the free encyclopedia
In computer science, the Toffoli 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 also describes its action.
Contents |
[edit] Background
A 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(x)=y. From common logic gates, NOT is reversible, as can be seen from its truthtable below.
| INPUT | OUTPUT |
|---|---|
| 0 | 1 |
| 1 | 0 |
The common AND gate is not reversible however. The inputs 00 and 01 both get 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). In a normal gate, input states are 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 charge 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 but allows more general states of the computation (superpositions). Thus, the reversible gates form a subset of gates allowed by quantum mechanics and, if we can compute something reversibly, we can also compute it on a quantum computer.
[edit] Universality and Toffoli gate
Any reversible gate must have the same number of input and output bits. (See pigeonhole principle.) For one input bit, there are two possible reversible gates. One of them is NOT. The other is identity gate which maps its input to the output unchanged. For two input bits, the only non-trivial gate is the reversible XOR gate which XORs the first bit to the second bit and leaves the first bit unchanged.
| INPUT | OUTPUT | ||
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 |
Unfortunately, there are reversible functions which cannot be computed using just those gates. In other terms, the set consisting of NOT and XOR gates is not universal. If we would like to compute an arbitrary function by reversible gates, we need another gate. One possibility is the Toffoli gate, proposed in 1980 by Toffoli.
This gate has a 3 bit input and output. If the first two bits are set, it flips the third bit. Following is a table over the input and output bits:
| 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 |
It can be also described as mapping bits a, b and c to a, b and c XOR (a AND b).
The Toffoli gate is universal; this means that for any boolean function f(x1, x2, ..., xm), there is a circuit consisting of Toffoli gates which takes x1, x2, ..., xm and some extra bits to 0 or 1 and outputs x1, x2, ..., xm, f(x1, x2, ..., xm). Essentially, this means that one can use Toffoli gates to build systems that will perform any desired computation in a reversible manner.
[edit] Related logic gates
- The Fredkin gate is a 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 x1, x2, ..., xn as inputs and outputs n bits. The first n−1 output bits are just x1, ..., xn-1. The last output bit is (x1 AND ... AND xn-1) XOR xn.
[edit] 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. Although it may never be implemented in an actual quantum computer, the Toffoli gate has already played an important role in theoretical research on quantum computing; for example in quantum error correction.
[edit] Examples
Here is a diagram of a full 3-bit adder using Toffoli Gates. The inputs are A, B and C with "T" and "F" for constant true and false.
[edit] See also
[edit] References
- T. Toffoli, "Reversible Computing", MIT Technical Report MIT/LCS/TM-151 (1980).
- E. Fredkin and T. Toffoli. Conservative logic. International Journal of Theoretical Physics, 21:219–253, 1982.
