The Fredkin gate (also CSWAP gate and conservative logic gate) is a computational circuit suitable for reversible computing, invented by Edward Fredkin. It is universal, which means that any logical or arithmetic operation can be constructed entirely of Fredkin gates. The Fredkin gate is a circuit or device with three inputs and three outputs that transmits the first bit unchanged and swaps the last two bits if, and only if, the first bit is 1.

Definition

The basic Fredkin gate^[1] is a controlled swap gate that maps three inputs $(C, I 1, I 2)$ onto three outputs $(C, O 1, O 2)$ . The C input is mapped directly to the C output. If C = 0, no swap is performed; $I 1$ maps to $O 1$ , and $I 2$ maps to $O 2$ . Otherwise, the two outputs are swapped so that $I 1$ maps to $O 2$ , and $I 2$ maps to $O 1$ . It is easy to see that this circuit is reversible, i.e., "undoes" itself when run backwards. A generalized n × n Fredkin gate passes its first n − 2 inputs unchanged to the corresponding outputs and swaps its last two outputs if and only if the first n − 2 inputs are all 1.

The Fredkin gate is the reversible three-bit gate that swaps the last two bits if, and only if, the first bit is 1.

Truth table

Permutation matrix form

Input			Output
C	$I 1$	$I 2$	C	$O 1$	$O 2$
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	1	0
1	1	0	1	0	1
1	1	1	1	1	1

${\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&0&1&0\\0&0&0&0&0&1&0&0\\0&0&0&0&0&0&0&1\\\end{bmatrix))$

It has the useful property that the numbers of 0s and 1s are conserved throughout, which in the billiard-ball model means that the same number of balls are output as input. This corresponds nicely to the conservation of mass in physics and helps to show that the model is not wasteful.

Truth functions with AND, OR, XOR, and NOT

The Fredkin gate can be defined using truth functions with AND, OR, XOR, and NOT, as follows:

O 1 = I 1 XOR S

,

O 2 = I 2 XOR S

,

C_out = C_in,

where $S = (I 1 XOR I 2) AND C$ .

Alternatively:

O 1 = (NOT C AND I 1) OR (C AND I 2)

,

O 2 = (C AND I 1) OR (NOT C AND I 2)

,

C_out = C_in.

Completeness

One way to see that the Fredkin gate is universal is to observe that it can be used to implement AND, NOT and OR:

If

I 2 = 0

, then

O 2 = C AND I 1

.

If

I 2 = 1

, then

O 1 = C OR I 1

.

If

I 1 = 0

and

I 2 = 1

, then

O 2 = NOT C

.

Example

Three-bit full adder (add with carry) using five Fredkin gates. The "garbage" output bit $g$ is $(p NOR q)$ if $r = 0$ , and $(p NAND q)$ if $r = 1$ .

Inputs on the left, including two constants, go through three gates to quickly determine the parity. The 0 and 1 bits swap places for each input bit that is set, resulting in parity bit on the 4th row and inverse of parity on 5th row.

Then the carry row and the inverse parity row swap if the parity bit is set and swap again if one of the $p$ or $q$ input bits are set (it doesn't matter which is used) and the resulting carry output appears on the 3rd row.

The $p$ and $q$ inputs are only used as gate controls so they appear unchanged in the output.

Quantum Fredkin gate

On March 25, 2016, researchers from Griffith University and the University of Queensland announced they had built a quantum Fredkin gate that uses the quantum entanglement of particles of light to swap qubits. The availability of quantum Fredkin gates may facilitate the construction of quantum computers.^[2]^[3]

Definition

Truth functions with AND, OR, XOR, and NOT

Completeness

Example

Quantum Fredkin gate

See also

References

Further reading