Cargando…
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...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689189/ https://www.ncbi.nlm.nih.gov/pubmed/36359663 http://dx.doi.org/10.3390/e24111568 |
_version_ | 1784836467432882176 |
---|---|
author | Anderson, Neal G. |
author_facet | Anderson, Neal G. |
author_sort | Anderson, Neal G. |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-9689189 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-96891892022-11-25 Generalized Landauer Bound for Information Processing: Proof and Applications Anderson, Neal G. Entropy (Basel) Article 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. MDPI 2022-10-31 /pmc/articles/PMC9689189/ /pubmed/36359663 http://dx.doi.org/10.3390/e24111568 Text en © 2022 by the author. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Anderson, Neal G. Generalized Landauer Bound for Information Processing: Proof and Applications |
title | Generalized Landauer Bound for Information Processing: Proof and Applications |
title_full | Generalized Landauer Bound for Information Processing: Proof and Applications |
title_fullStr | Generalized Landauer Bound for Information Processing: Proof and Applications |
title_full_unstemmed | Generalized Landauer Bound for Information Processing: Proof and Applications |
title_short | Generalized Landauer Bound for Information Processing: Proof and Applications |
title_sort | generalized landauer bound for information processing: proof and applications |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9689189/ https://www.ncbi.nlm.nih.gov/pubmed/36359663 http://dx.doi.org/10.3390/e24111568 |
work_keys_str_mv | AT andersonnealg generalizedlandauerboundforinformationprocessingproofandapplications |