Skip to content

Thermodynamics of Information Processing

The minimum energy dissipation per irreversible bit operation depends on the physical implementation:

  • CMOS transistor (2000s-era): 104kBT\sim 10^4\,k_BT per switch (vastly above the Landauer limit)
  • Modern CMOS (7 nm node): 102\sim 10^2103kBT10^3\,k_BT per switch
  • Adiabatic / reversible logic proposals: 1\sim 110kBT10\,k_BT per operation (approaching the limit)

The gap between theory (kBTln20.018k_BT\ln 2 \approx 0.018 eV at 300 K) and practice (1\sim 11010 fJ per switch) spans 5—6 orders of magnitude. Closing this gap requires fundamentally different computing paradigms.

20.2 Bennett”s Clock and Reversible Computing

Section titled “20.2 Bennett”s Clock and Reversible Computing”

Bennett (1982) showed that a computer can be made logically reversible at every step if it never erases information. Such a computer dissipates energy only during the initialisation of bits and during optional output, not during computation.

A logically reversible computation can be embedded in a thermodynamically reversible process by driving the system slowly enough that it remains near equilibrium at all times. The energy cost is then:

E=0τFλ(t)λ˙(t)dtE = \int_0^\tau \frac{\partial F}{\partial \lambda(t)}\,\dot{\lambda}(t)\,dt

For a quasi-static process: EΔFE \to \Delta F (minimum possible).

Fredkin and Toffoli gates are examples of logically reversible logic gates. Any computation can be made reversible by saving all intermediate results and running the computation in reverse to restore the input tape.

The Shannon entropy of a probability distribution {pi}\{p_i\} over microstates is:

H=ipilog2piH = -\sum_i p_i \log_2 p_i

Landauer’s principle states that erasing one bit of information dissipates at least kBTln2k_B T \ln 2 of heat. This follows from the second law: the entropy decrease of the information-bearing degrees of freedom must be compensated by an entropy increase in the environment.

The fundamental equality for a quasi-static bit operation is:

ΔSsystem+ΔSbath=0QkBTln2\Delta S_{\text{system}} + \Delta S_{\text{bath}} = 0 \quad \Longrightarrow \quad Q \geq k_B T \ln 2

20.4 Maxwell’s Demon and Information-Entropy Relation

Section titled “20.4 Maxwell’s Demon and Information-Entropy Relation”

Maxwell’s demon paradox is resolved by recognising that acquiring information about particle positions requires work. The demon’s memory must be reset, and this erasure dissipates the heat required by Landauer’s bound.

The total entropy balance for a measurement-and-erasure cycle:

ΔSgas+ΔSmemory+ΔSbath0\Delta S_{\text{gas}} + \Delta S_{\text{memory}} + \Delta S_{\text{bath}} \geq 0

The net effect is that the demon cannot violate the second law when the full information-processing cycle is accounted for.

20.5 Thermodynamic Costs in Biological Systems

Section titled “20.5 Thermodynamic Costs in Biological Systems”

Living systems process information at nonzero thermodynamic cost:

  • Molecular motors: Use chemical energy (ATP hydrolysis, ΔG20kBT\Delta G \approx 20\,k_BT) to perform mechanical work, operating near the Landauer limit.
  • Gene regulation: Transcription factor binding events are stochastic; cells expend 103\sim 10^310410^4 ATP per expressed gene to overcome noise.
  • Neural signalling: An action potential consumes 106\sim 10^6 ATP per pulse, far above the Landauer limit due to redundancy and reliability requirements.

Worked Example: Landauer Limit for a Flip-Flop

Section titled “Worked Example: Landauer Limit for a Flip-Flop”

Problem. A CMOS flip-flop operating at 3 GHz dissipates 10 μ\muW. How many kBTk_B T per operation does this represent at 300 K? Compare with the Landauer limit.

Solution. Energy per operation: E=10×106/(3×109)=3.33×1015E = 10 \times 10^{-6} / (3 \times 10^9) = 3.33 \times 10^{-15} J.

E/(kBT)=3.33×1015/(1.38×1023×300)=3.33×1015/4.14×1021=8.05×105kBTE / (k_B T) = 3.33 \times 10^{-15} / (1.38 \times 10^{-23} \times 300) = 3.33 \times 10^{-15} / 4.14 \times 10^{-21} = 8.05 \times 10^5\,k_B T

The Landauer limit is ln20.693kBT\ln 2 \approx 0.693\,k_B T. The flip-flop operates 106\sim 10^6 times above the fundamental limit, illustrating the vast gap between current technology and thermodynamic perfection. \blacksquare

ConceptFormulaSignificance
Landauer boundEmin=kBTln2E_{\min} = k_B T \ln 2Minimum heat per erased bit
Shannon entropyH=ipilog2piH = -\sum_i p_i \log_2 p_iInformation content in bits
Free energy changeΔF=ΔUTΔS\Delta F = \Delta U - T\Delta SReversible work available
Second law with infoΔSuniv=ΔSsys+ΔSbathΔI0\Delta S_{\text{univ}} = \Delta S_{\text{sys}} + \Delta S_{\text{bath}} - \Delta I \geq 0Information as negative entropy
Bennett’s reversible computingWrev=ΔFW_{\text{rev}} = \Delta FNo energy dissipated per logical step
  1. Landauer’s bound is a lower bound, not an operating point: Real devices dissipate 5—6 orders of magnitude more than kBTln2k_B T \ln 2. The bound applies only to logically irreversible operations — reversible operations can in principle dissipate arbitrarily little.
  2. Information is not physical, but its representation is: The Shannon entropy of a message has no physical units until it is encoded in a physical system (spins, charges, photons). The thermodynamic cost is tied to the physical representation, not the abstract information.
  3. Measurement requires energy dissipation: Acquiring information about a system requires interaction, which disturbs the system. The minimum energy cost of a measurement is related to the distinguishability of the measured states.
  4. Maxwell’s demon does not violate the second law: The demon’s memory must be reset, and this erasure exactly compensates the apparent entropy decrease of the gas. The total entropy of the universe never decreases.
ProcessInformation ChangeMinimum Heat Dissipation
Bit erasure (reset)11 bit \to 00 (known)kBTln2k_B T \ln 2
Bit copy (fanout)11 bit \to 22 copies00 (reversible)
MeasurementUnknown \to knownkBTln2\geq k_B T \ln 2 (for resetting meter)
Logical AND (irreversible)22 bits \to 11 bitkBTln2k_B T \ln 2
Reversible gate (CNOT, Toffoli)nn bits \to nn bits00 (in principle)
  • Statistical mechanics: The Gibbs paradox resolves when identical particle distinguishability is accounted for — information about which particle is which is not physical for identical quantum particles.
  • Quantum information: The Landauer bound extends to quantum systems: erasing a qubit costs at least kBTln2k_B T \ln 2, but quantum superposition allows some computations to be more efficient per bit erased.
  • Biology: Molecular machines operate in the presence of thermal noise. The minimum energy required to maintain a nonequilibrium steady state (e.g., a concentration gradient) is set by information-theoretic bounds.
  • Computer architecture: The gap between Landauer’s limit and CMOS practice motivates research into reversible computing, adiabatic logic, and neuromorphic architectures that approach the thermodynamic limit.

Additional Worked Example: Erasing a Register

Section titled “Additional Worked Example: Erasing a Register”

Problem. A 64-bit register is initialised to a random value. How much heat must be dissipated to erase it (reset to all zeros) at T=300T = 300 K? Compare with the energy to charge a typical DRAM capacitor (4\sim 4 fJ per bit).

Solution. Erasing 64 bits requires at minimum 64kBTln264 \, k_B T \ln 2:

Qmin=64×1.38×1023×300×ln2Q_{\min} = 64 \times 1.38 \times 10^{-23} \times 300 \times \ln 2 =64×4.14×1021×0.693=64×2.87×1021=1.84×1019 J= 64 \times 4.14 \times 10^{-21} \times 0.693 = 64 \times 2.87 \times 10^{-21} = 1.84 \times 10^{-19} \text{ J}

Per bit: 2.87×10212.87 \times 10^{-21} J = 2.872.87 zJ. DRAM capacitors use 4\sim 4 fJ/bit = 4×10154 \times 10^{-15} J/bit, about 1.4×1061.4 \times 10^6 times above the Landauer limit.

This enormous gap demonstrates that current computing is limited not by thermodynamics but by engineering constraints (capacitive charging, leakage, noise margins). \blacksquare

TopicSiteLink
[Thermal Physics]A-LevelView
[Thermal Physics]IBView
[Thermal Physics]DSEView
[Thermal Physics]UniversityView