A fundamental lower bound of the cost for bit reset

DOI10.1016/J.PHYSLETA.2023.129009MaRDI QIDQ6166605zbMATH OpenFDO

Authors Y. L. Wang, S. H. Xia, Minglong Lv, Jingyi Chen, Jincan Chen, Shanhe Su

Publication date 3 August 2023

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PHYSLETA.2023.129009

zbMATH Keywords

information erasureprojective measurementthermodynamic energy cost

Mathematics Subject Classification ID

Hyperbolic singular points with homoclinic trajectories in dynamical systems (37G20) Chains (nests) of projections or of invariant subspaces, integrals along chains, etc. (47A46) Orthogonal and unitary groups in metric geometry (51F25) Classical and relativistic thermodynamics (80A10) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum control (81Q93) Irreversible thermodynamics, including Onsager-Machlup theory (82B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• The cost of erasing information
• Information erasure in quantum systems
• Thermodynamic cost of reliability and low temperatures: Tightening Landauer's principle and the second law
• Information erasure without an energy cost
• Beyond Landauer erasure

Cites work

• An improved Landauer principle with finite-size corrections
• Irreversibility and Heat Generation in the Computing Process
• Maxwell's demon assisted thermodynamic cycle in superconducting quantum circuits

Cited in

(1)

• Bit copying: the ultimate computational simplicity

This page was built for publication: A fundamental lower bound of the cost for bit reset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166605)