Fredkin gate

The Fredkin gate, conceptualized by Edward Fredkin and Tommaso Toffoli at the MIT Laboratory for Computer Science, was a pivotal advancement in the field of reversible computing and conservative logic. Developed within the framework of conservative logic, the gate is designed to align computing processes with fundamental physical principles such as the reversibility of dynamical laws and the conservation of energy. The technical rationale behind the Fredkin gate is rooted in addressing the inefficiencies of traditional computing, where irreversible operations typically result in significant energy dissipation. In contrast to conventional logic gates, which often erase information and thus dissipate heat as per Landauer's principle, the Fredkin gate maintains reversibility — a property that ensures no information is lost during the computation process. Each output state of the gate uniquely determines its input state, which not only preserves information but also aligns with energy conservation principles. This characteristic is particularly crucial as the demand for computational power grows, making energy efficiency a key consideration. The invention of the Fredkin gate was motivated by the quest to minimize the energy footprint of computational operations. It allows for the construction of computing systems that are not only efficient in terms of processing speed and power consumption but also environmentally sustainable. By embodying principles of reversible computing, the Fredkin gate offers a practical solution to reducing the energy costs associated with digital computations, marking a significant shift towards more sustainable computing technologies. == Definition ==

The basic Fredkin gate is a controlled swap gate (CSWAP gate) that maps three inputs onto three outputs . The C input is mapped directly to the C output. If C = 0, no swap is performed; maps to , and maps to . Otherwise, the two outputs are swapped so that maps to , and maps to . 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. • Controlled-swap logic: The Fredkin gate, a three-bit controlled-SWAP gate, operates by conditionally swapping two target bits based on the state of a control bit. If the control bit is 1, the gate swaps the target bits; if 0, the bits pass through unchanged. \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} • Reversible computing: The gate is reversible, meaning that no information is lost during computation. This property aligns with principles of conservative logic, preserving data and reducing energy dissipation. 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: : , : , : Cout = Cin, where . Alternatively: : , : , : Cout = Cin. == 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 , then . : If , then . : If and , then . == Hardware description ==

We can encode the truth table in a hardware description language such as Verilog: module fredkin_gate ( input u, input x1, input x2, output v, output y1, output y2); always @(*) begin v = u; y1 = (~u & x1) | (u & x2); y2 = (u & x1) | (~u & x2); end endmodule == Example ==

(add with carry) using five Fredkin gatesThree-bit full adder (add with carry) using five Fredkin gates. The "garbage" output bit is if , and if . 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 or input bits are set (it doesn't matter which is used) and the resulting carry output appears on the 3rd row. The and inputs are only used as gate controls so they appear unchanged in the output. == Applications ==

Quantum photonic chip implementation Recent research has demonstrated the Fredkin gate on programmable silicon photonic chips. These chips use a network of Mach-Zehnder interferometers to route photons efficiently, creating a versatile and scalable platform that can handle multiple quantum gates. This approach allows for integrating Fredkin gates into large-scale quantum processors, allowing for future quantum computing advancements. Efficient controlled-SWAP operation In a photonic setup, the Fredkin gate serves to swap the target qubits conditionally. This is useful for generating high-fidelity Greenberger-Horne-Zeilinger states, which are often used for quantum communication and other protocols. ==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. == See also ==