Energy cost of information transmission (along the path to understanding)
Open accessAbstract
It is shown that the minimum energy required to transmit a natural unit of information (nat) over a noisy channel is k T, where T is the effective noise temperature which depends on the interaction between the information career and the environment. The result follows from the entropy defect principle and general laws of quantum dynamics without any specific assumptions. © 1998 Published by Elsevier Science B.V. All rights reserved. 1.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 speed with which a physical device can process information is limited by its energy.
“In particular, the speed with which a physical device can process information is limited by its energy 11 -26 and the amount of information that it can process is limited by the number of degrees of freedom it possesses 5 -40 .”
From Ultimate physical limits to computation (2000) · cites this paper as [14]
The laws of quantum mechanics determine the maximum rate at which a system with spread in energy ΔE can move from one distinguishable state to another.
“The problem of how much energy is required for information processing was first investigated in the context of communications theory by Levitin 11 -16 , Bremermann 17 -19 , Beckenstein 20 -22 and others, who showed that the laws of quantum mechanics determine the maximum rate at which a system with spread in energy ∆ E can move from one distinguishable state to another.”
From Ultimate physical limits to computation (2000) · cites this paper as [14]
kB T ln 2 is the minimal amount of energy required to send a bit down an information channel with noise temperature T.
“( k B T ln 2 is the minimal amount of energy required to send a bit down an information channel with noise temperature T . 14 )”
From Ultimate physical limits to computation (2000) · cites this paper as [14]
Cites
Quantum detection and estimation theory
Helstrom, C. W. (1969) · Journal of Statistical Physics · doi:10.1007/bf01007479 · Cited by 3,776 · see citing works
Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV
Roy, H. L. L., LeCam, L. M., & Neyman, J. (1969) · Revue de l Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402306 · Cited by 2,878 · see citing works
Quantum Detection and Estimation Theory
(1976) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(08)x6017-5 · Cited by 2,712 · see citing works
Optimization Through Evolution and Recombination
Bremermann, H. J. (2013) · Cited by 180 · see citing works
Lower bound for accessible information in quantum mechanics
Jozsa, R., Robb, D., & Wootters, W. K. (1994) · Physical Review A · doi:10.1103/physreva.49.668 · Cited by 159 · see citing works
Ensemble-Dependent Bounds for Accessible Information in Quantum Mechanics
Fuchs, C. A., & Caves, C. M. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.3047 · Cited by 93 · see citing works
Limitation on the Amount of Accessible Information in a Quantum Channel
Schumacher, B. W., Westmoreland, M. D., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3452 · Cited by 83 · see citing works
(1967) · Project Euclid (Cornell University) · Cited by 59 · see citing works
Physical limitations of rate, depth, and minimum energy in information processing
Levitin, L. B. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857732 · Cited by 45 · see citing works
Self-citationQuantitative Aspects of Goal-Seeking Self-Organizing Systems
Bremermann, H. J. (1967) · Elsevier eBooks · doi:10.1016/b978-1-4831-9994-8.50010-7 · Cited by 43 · see citing works
IEEE International Symposium on Information Theory
中原, 悠. (2022) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.16.2_122 · Cited by 29 · see citing works
The Maximum Amount of Information Transmissible by an Electromagnetic Field
Lebedev, D. S., & Levitin, L. B. (1963) · Soviet physics. Doklady · Cited by 16 · see citing works
Self-citationLandauer, R. W. (1994) · Cited by 12 · see citing works
Physical Information Theory Part Ii: Quantum Systems
Levitin, L. B. (2005) · doi:10.1109/phycmp.1992.615543 · Cited by 11 · see citing works
Self-citationA Thermodynamic Characterization of Ideal Physical Information Channels
Levitin, L. B. (1981) · Journal of Information and Optimization Sciences · doi:10.1080/02522667.1981.10698708 · Cited by 9 · see citing works
Self-citationGibbs Paradox And Equivalence Relation Between Quantum Information And Work.
Levitin, L. B. (2005) · doi:10.1109/phycmp.1992.615545 · Cited by 6 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
- Authors
- Levitin, L. B.
- Affiliations
- Boston University (US)
- Corresponding author
- Levitin, Lev B.
- Venue
- Physica D: Nonlinear Phenomena
- Publisher
- Elsevier BV
- Published
- 1998-09
- Volume
- 120
- Issue
- 1-2
- Pages
- 162-167
- ISSN
- 0167-2789 (ISSN-L)
- OpenAlex
- W2006684849
- Cited by
- 18
- References
- 16
- Citations by year
- 2023: 1 · 2021: 2 · 2020: 1 · 2013: 1
- FWCI
- 0.28
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Physica D Nonlinear Phenomena (publishedVersion, cc-by-nc-nd)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Advanced Thermodynamics and Statistical Mechanics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- noisy channels, effective noise temperature, quantum dynamics, information theory, information thermodynamics
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
