Generalized Landauer Bound for Information Processing: Proof and Applications

A generalized form of Landauer's bound on the dissipative cost of classical information processing in quantum-mechanical systems is proved using a new approach. This approach sidesteps some prominent objections to standard proofs of Landauer's bound-broadly interpreted here as a nonzero lower bound on the amount of energy that is irreversibly transferred from a physical system to its environment for each bit of information that is lost from the system-while establishing a far more general result. Specializations of our generalized Landauer bound for ideal and non-ideal information processing operations, including but not limited to the simplified forms for erasure and logical operations most familiar from the literature, are presented and discussed. These bounds, taken together, enable reconsideration of the links between logical reversibility, physical reversibility, and conditioning of operations in contexts that include but are far more general than the thermodynamic model systems that are most widely invoked in discussions of Landauer's Principle. Because of the strategy used to prove the generalized bounds and these specializations, this work may help to illuminate and resolve some longstanding controversies related to dissipation in computation.

Automated summary

This paper proves the generalized form of Landauer's bound on the dissipative cost of classical information processing in quantum-mechanical systems using a new approach. It also discusses the special cases of ideal and non-ideal information processing operations. These results have implications for understanding the links between logical reversibility, physical reversibility, and conditioning of operations in a broader context.