Related papers: A Cost / Speed / Reliability Trade-off to Erasing
In 1961, Rolf Landauer pointed out that resetting a binary memory requires a minimum energy of $k_BT \ln(2)$. However, once written, any memory is doomed to loose its content if no action is taken. To avoid memory losses, a refresh…
Data storage systems are more reliable than their individual components. In order to build highly reliable systems out of less reliable parts, systems introduce redundancy. In replicated systems, objects are simply copied several times with…
Nonequilibrium information thermodynamics determines the minimum energy dissipation to reliably erase memory under time-symmetric control protocols. We demonstrate that its bounds are tight and so show that the costs overwhelm those implied…
Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classical bit, which is only reached under the ideal operation with infinite-long time. The question on the cost in the practical operation for a…
Modern digital electronics support remarkably reliable computing, especially given the challenge of controlling nanoscale logical components that interact in fluctuating environments. However, we demonstrate that the high-reliability limit…
Landauer's Principle states that the energy cost of information processing must exceed the product of the temperature and the change in Shannon entropy of the information-bearing degrees of freedom. However, this lower bound is achievable…
In 1961, R. Landauer proposed the principle that logical irreversibility is associated with physical irreversibility and further theorized that the erasure of information is fundamentally a dissipative process. Landauer posited that a…
We consider how the energy cost of bit reset scales with the time duration of the protocol. Bit reset necessarily takes place in finite time, where there is an extra penalty on top of the quasistatic work cost derived by Landauer. This…
In this article, we focus on erasure of a bit of information in finite time. Landauer's principle states that the average heat dissipation due to erasure of information is k_B T ln 2, which is achievable only in an asymptotic manner. Recent…
We investigate the performance of majority-logic decoding in both reversible and finite-time information erasure processes performed on macroscopic bits that contain $N$ microscopic binary units. While we show that for reversible erasure…
Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of…
Using an error models motivated by the Knill, Laflamme, Milburn proposal for efficient linear optics quantum computing [Nature 409,46--52, 2001], error rate thresholds for erasure errors caused by imperfect photon detectors using a 7 qubit…
Kullback-Leibler (KL) control enables efficient numerical methods for nonlinear optimal control problems. The crucial assumption of KL control is the full controllability of the transition distribution. However, this assumption is often…
The tolerable erasure error rate for scalable quantum computation is shown to be at least 0.292, given standard scalability assumptions. This bound is obtained by implementing computations with generic stabilizer code teleportation steps…
The erasure of a bit of information encoded in a physical system is an irreversible operation bound to dissipate an amount of energy $Q = k_\text{B} T\ln 2$. As a result, work $W \geq Q$ has to be applied to the physical system to restore…
The energy cost of erasing quantum states depends on our knowledge of the states. We show that learning algorithms can acquire such knowledge to erase many copies of an unknown state at the optimal energy cost. This is proved by showing…
We calculate the trade-off between the quality of estimating the quantum state of an ensemble of identically prepared qubits and the minimum level of disturbance that has to be introduced by this procedure in quantum mechanics. The…
The Landauer principle states that at least $k_B T \ln 2$ of energy is required to erase a 1-bit memory, with $k_B T$ the thermal energy of the system. We study the effects of inertia on this bound using as one-bit memory an underdamped…
How to provide information security while fulfilling ultra reliability and low-latency requirements is one of the major concerns for enabling the next generation of ultra-reliable and low-latency communications service (xURLLC), specially…
The emerging interest in low-latency high-reliability applications, such as connected vehicles, necessitates a new abstraction between communication and control. Thanks to advances in cyber-physical systems over the past decades, we…