Related papers: Optimal finite-time bit erasure under full control
We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow…
Investigating principles for storage of quantum information at finite temperature with minimal need for active error correction is an active area of research. We bear upon this question in two-dimensional holographic conformal field…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
Maximum quantum work extraction is generally defined in terms of the ergotropy functional, no matter how experimentally complicated is the implementation of the optimal unitary allowing for it, especially in the case of multipartite…
We consider finite-state Markov decision processes with the combined Energy-MeanPayoff objective. The controller tries to avoid running out of energy while simultaneously attaining a strictly positive mean payoff in a second dimension. We…
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is $\sqrt{V}\Phi^{-1}(\epsilon_t)$…
We present one-shot compression protocols that optimally encode ensembles of $N$ identically prepared mixed states into $O(\log N)$ qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops…
Many work extraction or information erasure processes in the literature involve the raising and lowering of energy levels via external fields. But even if the actual system is treated quantum mechanically, the field is assumed to be…
We consider the problem of timely tracking of a Wiener process via an energy-conserving sensor by utilizing a single bit quantization strategy under periodic sampling. Contrary to conventional single bit quantizers which only utilize the…
The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing. We investigate the thermodynamic costs associated with erasing (and…
In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It…
Using a double-well potential as a physical memory, we study with experiments and numerical simulations the energy exchanges during erasure processes, and model quantitatively the cost of fast operation. Within the stochastic thermodynamics…
Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical…
Given $n$ jobs with processing times $p_1,\dotsc,p_n\in\mathbb N$ and $m\le n$ machines with speeds $s_1,\dotsc,s_m\in\mathbb N$ our goal is to allocate the jobs to machines minimizing the makespan. We present an algorithm that solves the…
Landauer's principle states that information erasure requires heat dissipation. Landauer's original result focused on equilibrium memories. We here investigate the reset of information stored in a nonequilibrium state of a symmetric…
Refresh is an important operation to prevent loss of data in dynamic random-access memory (DRAM). However, frequent refresh operations incur considerable power consumption and degrade system performance. Refresh power cost is especially…
Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on matrix product states or the multi-scale entanglement…
We study the computation of equilibrium points of electrostatic potentials: locations in space where the electrostatic force arising from a collection of charged particles vanishes. This is a novel scenario of optimization in which…
Optimal control theory is applied to analyze the time-optimal solution with a single scalar control knob in a two-level quantum system without quantum decoherence. Emphasis is \change{placed} on the dependence on the maximum control…
Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…