Thermodynamics of Information Processing
20.1 Landauer Bound in Practice
Section titled “20.1 Landauer Bound in Practice”The minimum energy dissipation per irreversible bit operation depends on the physical implementation:
- CMOS transistor (2000s-era): per switch (vastly above the Landauer limit)
- Modern CMOS (7 nm node): — per switch
- Adiabatic / reversible logic proposals: — per operation (approaching the limit)
The gap between theory ( eV at 300 K) and practice (— 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:
For a quasi-static process: (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.
20.3 Information-Theoretic Formulation
Section titled “20.3 Information-Theoretic Formulation”The Shannon entropy of a probability distribution over microstates is:
Landauer’s principle states that erasing one bit of information dissipates at least 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:
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:
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, ) to perform mechanical work, operating near the Landauer limit.
- Gene regulation: Transcription factor binding events are stochastic; cells expend — ATP per expressed gene to overcome noise.
- Neural signalling: An action potential consumes 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 W. How many per operation does this represent at 300 K? Compare with the Landauer limit.
Solution. Energy per operation: J.
The Landauer limit is . The flip-flop operates times above the fundamental limit, illustrating the vast gap between current technology and thermodynamic perfection.
Key Relationships
Section titled “Key Relationships”| Concept | Formula | Significance |
|---|---|---|
| Landauer bound | Minimum heat per erased bit | |
| Shannon entropy | Information content in bits | |
| Free energy change | Reversible work available | |
| Second law with info | Information as negative entropy | |
| Bennett’s reversible computing | No energy dissipated per logical step |
Common Pitfalls
Section titled “Common Pitfalls”- Landauer’s bound is a lower bound, not an operating point: Real devices dissipate 5—6 orders of magnitude more than . The bound applies only to logically irreversible operations — reversible operations can in principle dissipate arbitrarily little.
- 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.
- 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.
- 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.
Summary Table
Section titled “Summary Table”| Process | Information Change | Minimum Heat Dissipation |
|---|---|---|
| Bit erasure (reset) | bit (known) | |
| Bit copy (fanout) | bit copies | (reversible) |
| Measurement | Unknown known | (for resetting meter) |
| Logical AND (irreversible) | bits bit | |
| Reversible gate (CNOT, Toffoli) | bits bits | (in principle) |
Connections to Other Topics
Section titled “Connections to Other Topics”- 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 , 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 K? Compare with the energy to charge a typical DRAM capacitor ( fJ per bit).
Solution. Erasing 64 bits requires at minimum :
Per bit: J = zJ. DRAM capacitors use fJ/bit = J/bit, about 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).
Cross-References
Section titled “Cross-References”| Topic | Site | Link |
|---|---|---|
| [Thermal Physics] | A-Level | View |
| [Thermal Physics] | IB | View |
| [Thermal Physics] | DSE | View |
| [Thermal Physics] | University | View |