Number of hidden states needed to physically implement a given conditional distribution
arXiv:1709.00765 · doi:10.1088/1367-2630/aaf81d
Abstract
We consider the problem of how to construct a physical process over a finite state space that applies some desired conditional distribution to initial states to produce final states. This problem arises often in the thermodynamics of computation and nonequilibrium statistical physics more generally (e.g., when designing processes to implement some desired computation, feedback controller, or Maxwell demon). It was previously known that some conditional distributions cannot be implemented using any master equation that involves just the states in . However, here we show that any conditional distribution can in fact be implemented---if additional "hidden" states not in are available. Moreover, we show that it is always possible to implement in a thermodynamically reversible manner. We then investigate a novel cost of the physical resources needed to implement a given distribution : the minimal number of hidden states needed to do so. We calculate this cost exactly for the special case where represents a single-valued function, and provide an upper bound for the general case, in terms of the nonnegative rank of . These results show that having access to one extra binary degree of freedom, thus doubling the total number of states, is sufficient to implement any with a master equation in a thermodynamically reversible way, if there are no constraints on the allowed form of the master equation. (Such constraints can greatly increase the minimal needed number of hidden states.) Our results also imply that for certain that can be implemented without hidden states, having hidden states permits an implementation that generates less heat.
arXiv comment16 pages, 2 figures
References in corpus (21)
- Stochastic thermodynamics, fluctuation theorems, and molecular machines
- Ensemble and Trajectory Thermodynamics: A Brief Introduction
- The Three Faces of the Second Law: I. Master Equation Formulation
- Speed Limit for Classical Stochastic Processes
- Cost and Precision of Brownian Clocks
- Inferring dissipation from current fluctuations
- Thermodynamic and Logical Reversibilities Revisited
- Optimal finite-time erasure of a classical bit
- Finite time thermodynamics for a single level quantum dot
- Generalising Landauer's Principle
- Finite-time erasing of information stored in fermionic bits
- Coherence of Biochemical Oscillations is Bounded by Driving Force and Network Topology
- Hamiltonian dynamics, nanosystems, and nonequilibrium statistical mechanics
- Is there a Floquet Lindbladian?
- Dependence of dissipation on the initial distribution over states
- Relations between Entropies Produced in Nondeterministic Thermodynamic Processes
- The free energy requirements of biological organisms; implications for evolution
- From empirical data to continuous Markov processes: a systematic approach
- A generic map from non-Lindblad to Lindblad master equations
- Extending Landauer's Bound from Bit Erasure to Arbitrary Computation
- The Complexity of Divisibility
Cited by in corpus (12)
- Thermodynamics of computing with circuits
- Uncertainty relations and fluctuation theorems for Bayes nets
- Thermodynamics of computations with absolute irreversibility, unidirectional transitions, and stochastic computation times
- A space-time tradeoff for implementing a function with master equation dynamics
- Non-Markovian Momentum Computing: Universal and Efficient
- Biochemical Szilard engines for memory-limited inference
- Physical Limitations of Work Extraction from Temporal Correlations
- Affinity-dependent bound on the spectrum of stochastic matrices
- Entropy production given constraints on the energy functions
- Energy-Efficient Pseudo-Ratchet for Brownian Computers through One-Dimensional Quantum Brownian Motion
- Information bounds production in replicator systems
- Fluctuation theorems for multiple co-evolving systems