Strong and weak optimizations in classical and quantum models of stochastic processes

DOI10.1007/S10955-019-02344-XzbMATH Open1423.60170arXiv1808.08639OpenAlexW3104101076MaRDI QIDQ2328705FDOQ2328705

Authors: Samuel P. Loomis, James P. Crutchfield 

Publication date: 10 October 2019

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: Among the predictive hidden Markov models that describe a given stochastic process, the {epsilon}-machine is strongly minimal in that it minimizes every R'enyi-based memory measure. Quantum models can be smaller still. In contrast with the {epsilon}-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.

Full work available at URL: https://arxiv.org/abs/1808.08639

Recommendations

• Quantum Predictor Models
• Predictive models and generative complexity
• Reductions of hidden information sources
• Quantum hidden Markov models based on transition operation matrices
• ON THE GENERATIVE NATURE OF PREDICTION

zbMATH Keywords

hidden Markov modelquantum informationstochastic processcausal statesepsilon-machine

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Other physical applications of random processes (60K40) Foundations of stochastic processes (60G05)

Cites Work

• Inequalities: theory of majorization and its applications
• Deterministic Nonperiodic Flow
• An Introduction to Symbolic Dynamics and Coding
• Lattice Theory: Foundation
• Extremal distributions under approximate majorization
• Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
• Computational mechanics: pattern and prediction, structure and simplicity.
• The calculi of emergence: Computation, dynamics and induction
• Exact complexity: the spectral decomposition of intrinsic computation
• A mathematical theory of resources
• The resource theory of informational nonequilibrium in thermodynamics
• Exact synchronization for finite-state sources
• ON THE GENERATIVE NATURE OF PREDICTION
• Identifying functional thermodynamics in autonomous Maxwellian ratchets
• Structure and randomness of continuous-time, discrete-event processes
• Spectral simplicity of apparent complexity. II: Exact complexities and complexity spectra
• The ambiguity of simplicity in quantum and classical simulation
• Title not available (Why is that?)
• Spectral simplicity of apparent complexity. I: The nondiagonalizable metadynamics of prediction

Cited In (5)

• Quantum Predictor Models
• Surveying structural complexity in quantum many-body systems
• Optimizing quantum models of classical channels: the reverse Holevo problem
• Title not available (Why is that?)
• Quantum theory in finite dimension cannot explain every general process with finite memory

This page was built for publication: Strong and weak optimizations in classical and quantum models of stochastic processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328705)