Cost of remembering a bit of information

被引:6
作者
Chiuchiu, D. [1 ,3 ]
Lopez-Suarez, M. [1 ]
Neri, I. [1 ,2 ]
Diamantini, M. C. [1 ,2 ]
Gammaitoni, L. [1 ]
机构
[1] Univ Perugia, NiPS Lab, Dipartimento Fis & Geol, I-06123 Perugia, Italy
[2] Ist Nazl Fis Nucl, Sez Perugia, I-06123 Perugia, Italy
[3] Okinawa Inst Sci & Technol, Okinawa, Japan
基金
欧盟地平线“2020”;
关键词
FUNDAMENTAL LIMITS; INTERNAL-FRICTION;
D O I
10.1103/PhysRevA.97.052108
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
In 1961, Landauer [R. Landauer, IBM J. Res. Develop. 5, 183 (1961)] pointed out that resetting a binary memory requires a minimum energy of kBT ln(2). However, once written, any memory is doomed to lose its content if no action is taken. To avoid memory losses, a refresh procedure is periodically performed. We present a theoretical model and an experiment on a microelectromechanical system to evaluate the minimum energy required to preserve one bit of information over time. Two main conclusions are drawn: (i) in principle, the energetic cost to preserve information for a fixed time duration with a given error probability can be arbitrarily reduced if the refresh procedure is performed often enough, and (ii) the Heisenberg uncertainty principle sets an upper bound on the memory lifetime.
引用
收藏
页数:6
相关论文
共 44 条
[31]   On Cache-aided Multi-user Private Information Retrieval with Small Caches [J].
Rajput, Charul ;
Rajan, B. Sundar .
2023 IEEE INFORMATION THEORY WORKSHOP, ITW, 2023, :153-158
[32]   Cache-Aided Multi-User Private Information Retrieval Using PDAs [J].
Vaidya, Kanishak ;
Rajan, B. Sundar .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (02) :991-1004
[33]   Negative feedback increases information transmission, enabling bacteria to discriminate sublethal antibiotic concentrations [J].
Ruiz, Raul ;
de la Cruz, Fernando ;
Fernandez-Lopez, Raul .
SCIENCE ADVANCES, 2018, 4 (11)
[34]   Cooperative Positioning when Using Local Position Information: Theoretical Framework and Error Analysis [J].
Hlavacs, Helmut ;
Hummel, Karin Anna .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (10) :2091-2104
[35]   Mutual Information of a class of Poisson-type Channels using Markov Renewal Theory [J].
Gehri, Maximilian ;
Engelmann, Nicolai ;
Koeppl, Heinz .
2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, :1931-1936
[36]   Cache-Aided Multi-User Private Information Retrieval using PDAs [J].
Vaidya, Kanishak ;
Rajan, B. Sundar .
2023 IEEE INFORMATION THEORY WORKSHOP, ITW, 2023, :125-130
[37]   Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node [J].
Abolpour, Milad ;
Salehi, MohammadJavad ;
Mohajer, Soheil ;
Shariatpanahi, Seyed Pooya ;
Tolli, Antti .
2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, :2233-2238
[38]   Information limits and Thouless-Anderson-Palmer equations for spiked matrix models with structured noise [J].
Barbier, Jean ;
Camilli, Francesco ;
Xu, Yizhou ;
Mondelli, Marco .
PHYSICAL REVIEW RESEARCH, 2025, 7 (01)
[39]   Cache-Aided Multi-Access Multi-User Private Information Retrieval [J].
Vaidya, Kanishak ;
Rajan, B. Sundar .
2022 20TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT 2022), 2022, :246-253
[40]   A Novel Scheme for Cache-aided Multiuser Private Information Retrieval with User-to-user Privacy [J].
Zhang, Xiang ;
Wan, Kai ;
Sun, Hua ;
Ji, Mingyue ;
Caire, Giuseppe .
FIFTY-SEVENTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, IEEECONF, 2023, :717-723