Cargando…
Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing
Landauer’s Principle states that the energy cost of information processing must exceed the product of the temperature, Boltzmann’s constant, and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable only for quasistatic, near-equilibrium...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8960662/ https://www.ncbi.nlm.nih.gov/pubmed/35400756 http://dx.doi.org/10.1007/s10955-022-02871-0 |
_version_ | 1784677425520574464 |
---|---|
author | Boyd, Alexander B. Patra, Ayoti Jarzynski, Christopher Crutchfield, James P. |
author_facet | Boyd, Alexander B. Patra, Ayoti Jarzynski, Christopher Crutchfield, James P. |
author_sort | Boyd, Alexander B. |
collection | PubMed |
description | Landauer’s Principle states that the energy cost of information processing must exceed the product of the temperature, Boltzmann’s constant, and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable only for quasistatic, near-equilibrium computations—that is, only over infinite time. In practice, information processing takes place in finite time, resulting in dissipation and potentially unreliable logical outcomes. For overdamped Langevin dynamics, we show that counterdiabatic potentials can be crafted to guide systems rapidly and accurately along desired computational paths, providing shortcuts that allow for the precise design of finite-time computations. Such shortcuts require additional work, beyond Landauer’s bound, that is irretrievably dissipated into the environment. We show that this dissipated work is proportional to the computation rate as well as the square of the information-storing system’s length scale. As a paradigmatic example, we design shortcuts to create, erase, and transfer a bit of information metastably stored in a double-well potential. Though dissipated work generally increases with operation fidelity, we show that it is possible to compute with perfect fidelity in finite time with finite work. We also show that the robustness of information storage affects an operation’s energetic cost—specifically, the dissipated work scales as the information lifetime of the bistable system. Our analysis exposes a rich and nuanced relationship between work, speed, size of the information-bearing degrees of freedom, storage robustness, and the difference between initial and final informational statistics. |
format | Online Article Text |
id | pubmed-8960662 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Springer US |
record_format | MEDLINE/PubMed |
spelling | pubmed-89606622022-04-07 Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing Boyd, Alexander B. Patra, Ayoti Jarzynski, Christopher Crutchfield, James P. J Stat Phys Article Landauer’s Principle states that the energy cost of information processing must exceed the product of the temperature, Boltzmann’s constant, and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable only for quasistatic, near-equilibrium computations—that is, only over infinite time. In practice, information processing takes place in finite time, resulting in dissipation and potentially unreliable logical outcomes. For overdamped Langevin dynamics, we show that counterdiabatic potentials can be crafted to guide systems rapidly and accurately along desired computational paths, providing shortcuts that allow for the precise design of finite-time computations. Such shortcuts require additional work, beyond Landauer’s bound, that is irretrievably dissipated into the environment. We show that this dissipated work is proportional to the computation rate as well as the square of the information-storing system’s length scale. As a paradigmatic example, we design shortcuts to create, erase, and transfer a bit of information metastably stored in a double-well potential. Though dissipated work generally increases with operation fidelity, we show that it is possible to compute with perfect fidelity in finite time with finite work. We also show that the robustness of information storage affects an operation’s energetic cost—specifically, the dissipated work scales as the information lifetime of the bistable system. Our analysis exposes a rich and nuanced relationship between work, speed, size of the information-bearing degrees of freedom, storage robustness, and the difference between initial and final informational statistics. Springer US 2022-03-28 2022 /pmc/articles/PMC8960662/ /pubmed/35400756 http://dx.doi.org/10.1007/s10955-022-02871-0 Text en © The Author(s) 2022 https://creativecommons.org/licenses/by/4.0/Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) . |
spellingShingle | Article Boyd, Alexander B. Patra, Ayoti Jarzynski, Christopher Crutchfield, James P. Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title | Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title_full | Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title_fullStr | Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title_full_unstemmed | Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title_short | Shortcuts to Thermodynamic Computing: The Cost of Fast and Faithful Information Processing |
title_sort | shortcuts to thermodynamic computing: the cost of fast and faithful information processing |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8960662/ https://www.ncbi.nlm.nih.gov/pubmed/35400756 http://dx.doi.org/10.1007/s10955-022-02871-0 |
work_keys_str_mv | AT boydalexanderb shortcutstothermodynamiccomputingthecostoffastandfaithfulinformationprocessing AT patraayoti shortcutstothermodynamiccomputingthecostoffastandfaithfulinformationprocessing AT jarzynskichristopher shortcutstothermodynamiccomputingthecostoffastandfaithfulinformationprocessing AT crutchfieldjamesp shortcutstothermodynamiccomputingthecostoffastandfaithfulinformationprocessing |