CoChat
Sign Up
Cited by 252Advanced Thermodynamics and Statistical MechanicsError Correcting Code TechniquesQuantum-Dot Cellular Automata

Energy cost of information transfer

Bekenstein, Jacob D.·1981·Physical Review Letters
DOI 10.1103/physrevlett.46.623
Open this paper in CoChat — free account

Abstract

From thermodynamic and causality considerations a general upper bound on the rate at which information can be transferred in terms of the message energy is inferred. This bound is consistent with Shannon's bounds for a band-limited channel. It prescribes the minimum energy cost for information transferred over a given time interval. As an application, a fundamental upper bound of ${10}^{15}$ operations/sec on the speed of an ideal digital computer is established.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.46.623

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The maximum bound gives the highest rate at which quantum information can be communicated.

    “In particular, equation (2) sets the maximal rate with which quant um information can be communicated [25]”

    From Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control (2017) · cites this paper as [25]

  • Bekenstein showed that essentially the same information-transfer bound follows from thermodynamic and causality considerations alone.

    “Regardless, Bekenstein showed essentially the same fundamental bound on information transfer can be formulated from purely thermodynamic and causality considerations.”

    From Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control (2017) · cites this paper as [25]

  • For orthogonal initial and final states at high temperature, equation (44) reduces to the Bremermann-Bekenstein bound.

    “It is worth noting that if initial and final states are orthogonal and in the limit of high temper atures, equation (44) simplifies to the Bremermann-Bekenstein bound [25].”

    From Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control (2017) · cites this paper as [25]

  • The serial nature of computation at the black-hole limit can be deduced from the fact that black holes attain the Bekenstein bound, k_B RE/ħcS = 1/2π.

    “As noted above, the serial nature of computation at the black-hole limit can be deduced from the fact that black holes attain the Beckenstein bound 20 -22 , k B RE/ ¯ hcS = 1 / 2 π .”

    From Ultimate physical limits to computation (2000) · cites this paper as [21]

  • As ordinary matter obeys the Bekenstein bound, k_B RE/ħcS > 1/2π, as one compresses the computer t_com/t_flip ≈ k_B RE/ħcS will remain greater than one, so the operation will still be somewhat parallel.

    “As ordinary matter obeys the Beckenstein bound 20 -22 , k B RE/ ¯ hcS > 1 / 2 π , however, as one compresses the computer t com /tfl ip ≈ k B RE/ ¯ hcS will remain greater than one: i.e., the operation will still be somewhat parallel.”

    From Ultimate physical limits to computation (2000) · cites this paper as [21]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Related

Authors
Bekenstein, J. D.
Affiliations
Princeton University (US)
Corresponding author
Bekenstein, Jacob D.
Venue
Physical Review Letters
Publisher
American Physical Society (APS)
Published
1981-03-09
Volume
46
Issue
10
Pages
623-626
ISSN
0031-9007 (ISSN-L)
DOI
10.1103/physrevlett.46.623
OpenAlex
W2072161052
Cited by
252
References
9
Citations by year
2026: 6 · 2025: 11 · 2024: 16 · 2023: 15 · 2022: 27 · 2021: 17 · 2020: 13 · 2019: 10 · 2018: 7 · 2017: 17 · 2016: 13 · 2015: 14 · 2014: 6 · 2013: 2 · 2012: 1
FWCI
7.91
Type
journal article
Language
en
Open access
closed
Licence
link.aps.org/licenses/aps-default-license (vor)
Locations
Physical Review Letters (publishedVersion)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Advanced Thermodynamics and Statistical Mechanics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
Keywords
information transmission, energy costs, thermodynamics of computation, causality, bandwidth-limited channels

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review