Known Girsanov and Bismut-Elworthy-Li identities are recast as explicit grid-free Monte Carlo algorithms for coupled Fokker-Planck and Hamilton-Jacobi-Bellman systems, with a neural-network demonstration on a Schrödinger bridge problem.
Finite-time Landauer principle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study the thermodynamic cost associated with the erasure of one bit of information over a finite amount of time. We present a general framework for minimizing the average work required when full control of a system's microstates is possible. In addition to exact numerical results, we find simple bounds proportional to the variance of the microscopic distribution associated with the state of the bit. In the short-time limit, we get a closed expression for the minimum average amount of work needed to erase a bit. The average work associated with the optimal protocol can be up to a factor of four smaller relative to protocols constrained to end in local equilibrium. Assessing prior experimental and numerical results based on heuristic protocols, we find that our bounds often dissipate an order of magnitude less energy.
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the numerical integration of the Fokker-Planck equation driven by a mechanical force and the Bismut-Elworthy-Li formula
Known Girsanov and Bismut-Elworthy-Li identities are recast as explicit grid-free Monte Carlo algorithms for coupled Fokker-Planck and Hamilton-Jacobi-Bellman systems, with a neural-network demonstration on a Schrödinger bridge problem.