An autonomous information machine operating in finite time exhibits a regime where erasure power P and efficiency η increase simultaneously, governed by the trade-off v(1-η)P/η ≤ D with D an information-geometric distance.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Geometric complexity of physical maps is bounded below by execution error, forcing divergent resources for zero-error state resets in both classical and quantum settings.
citing papers explorer
-
Finite-Time Thermodynamics of an Autonomous Information Machine
An autonomous information machine operating in finite time exhibits a regime where erasure power P and efficiency η increase simultaneously, governed by the trade-off v(1-η)P/η ≤ D with D an information-geometric distance.
-
Geometric complexity in thermodynamics
Geometric complexity of physical maps is bounded below by execution error, forcing divergent resources for zero-error state resets in both classical and quantum settings.