Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
arXiv:1808.08639 · doi:10.1007/s10955-019-02344-x
Abstract
Among the predictive hidden Markov models that describe a given stochastic process, the ε-machine is strongly minimal in that it minimizes every Rényi-based memory measure. Quantum models can be smaller still. In contrast with the ε-machine's unique role in the classical setting, however, among the class of processes described by pure-state hidden quantum Markov models, there are those for which there does not exist any strongly minimal model. Quantum memory optimization then depends on which memory measure best matches a given problem circumstance.
arXiv comment14 pages, 14 figures; http://csc.ucdavis.edu/~cmg/compmech/pubs/uemum.htm
References in corpus (20)
- Conditions for a class of entanglement transformations
- Fundamental limitations for quantum and nano thermodynamics
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- The resource theory of informational nonequilibrium in thermodynamics
- A mathematical theory of resources
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- Identifying Functional Thermodynamics in Autonomous Maxwellian Ratchets
- A practical, unitary simulator for non-Markovian complex processes
- A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
- Exact Synchronization for Finite-State Sources
- Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation
- Unbounded memory advantage in stochastic simulation using quantum mechanics
- The classical-quantum divergence of complexity in modelling spin chains
- Towards Quantifying Complexity with Quantum Mechanics
- Matrix Product States for Quantum Stochastic Modelling
- Structure and Randomness of Continuous-Time Discrete-Event Processes
- Approximate Majorization
- Spectral Simplicity of Apparent Complexity, Part II: Exact Complexities and Complexity Spectra
- Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction
- Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?
Cited by in corpus (11)
- Extreme dimensionality reduction with quantum modelling
- Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
- Quantum adaptive agents with efficient long-term memories
- Thermal Efficiency of Quantum Memory Compression
- Robust inference of memory structure for efficient quantum modelling of stochastic processes
- Implementing quantum dimensionality reduction for non-Markovian stochastic simulation
- Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics
- Measurement-Induced Randomness and Structure in Controlled Qubit Processes
- Thermodynamically-Efficient Local Computation and the Inefficiency of Quantum Memory Compression
- Surveying structural complexity in quantum many-body systems
- Quantum-inspired identification of complex cellular automata