Conservative logic

Conservative logic is a branch of reversible computing in which logic gates preserve not only information but also other conserved physical quantities — such as the number of 1s in a bit string (Hamming weight), electrical charge, or particle number. It was introduced by Edward Fredkin and Tommaso Toffoli as a stricter constraint on computation than mere reversibility, requiring that the mapping from inputs to outputs be a permutation that preserves a chosen quantity.

The Fredkin gate is the canonical conservative logic gate: it swaps two data bits conditional on a control bit, conserving the total number of 1s across all three inputs and outputs. Toffoli and Fredkin proved that conservative logic is computationally universal — any Boolean function can be computed by a conservative circuit, provided sufficient ancillary bits are available. This result establishes that conservation laws, far from limiting computational power, merely reshape the design space.

Conservative logic has physical significance because actual computation occurs in physical substrates where quantities like charge and energy are conserved. A conservative logic gate models computation that respects these constraints, potentially enabling designs that operate at the thermodynamic limit without requiring external energy inputs to compensate for conservation violations.

Conservative logic is not merely a theoretical curiosity — it is the closest computation has come to treating information as a physical quantity on equal footing with energy and momentum. The fact that universality survives this constraint suggests that computation is far more robust than our engineering traditions assume.