Ideal stochastic process modeling with post-quantum quasiprobabilistic theories

Abstract

In stochastic modeling, the excess entropy -- the mutual information shared between a process's past and future -- represents the fundamental lower bound of the memory needed to simulate its dynamics. However, this bound cannot be saturated by either classical machines or their enhanced quantum counterparts. Simulating a process fundamentally requires us to store more information in the present than is shared between the past and the future. Here, we consider a generalization of hidden Markov models beyond classical and quantum models, referred to as n-machines, that allow for negative quasiprobabilities. We show that under the collision entropy measure of information, the minimal memory of such models can equal the excess entropy. Our results suggest that negativity can be a useful resource for achieving nonclassical memory advantage.

29 pages, 15 figures, updated title. Accepted in Quantum (2026-01-31)

References in corpus (52)

• Bell nonlocality
• Error mitigation for short-depth quantum circuits
• Information Causality as a Physical Principle
• Quantum correlations with no causal order
• Contextuality supplies the magic for quantum computation
• Theoretical framework for quantum networks
• The Resource Theory of Stabilizer Computation
• Negative Quasi-Probability as a Resource for Quantum Computation
• Negativity and contextuality are equivalent notions of nonclassicality
• Classical world arising out of quantum physics under the restriction of coarse-grained measurements
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Quantum stochastic processes and quantum non-Markovian phenomena
• Quasi-probability representations of quantum theory with applications to quantum information science
• Fundamental limits of quantum error mitigation
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information
• Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations
• Prediction, Retrodiction, and The Amount of Information Stored in the Present
• Framed Hilbert space: hanging the quasi-probability pictures of quantum theory
• Information Invariance and Quantum Probabilities
• Optimal resource cost for error mitigation
• A practical, unitary simulator for non-Markovian complex processes
• The Computational Structure of Spike Trains
• Collision entropy and optimal uncertainty
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling
• Universal and Operational Benchmarking of Quantum Memories
• Extreme dimensionality reduction with quantum modelling
• Necessity of negativity in quantum theory
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Optimal stochastic modelling with unitary quantum dynamics
• Contextuality and Wigner negativity are equivalent for continuous-variable quantum measurements
• Optimal classical simulation of state-independent quantum contextuality
• The market efficiency in the stock markets
• Thermodynamics of complexity and pattern manipulation
• Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation
• Information Symmetries in Irreversible Processes
• The classical-quantum divergence of complexity in modelling spin chains
• Causal Asymmetry in a Quantum World
• Quantum learning of classical stochastic processes: The Completely-Positive Realization Problem
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Exploring non-signalling polytopes with negative probability
• Thermal Efficiency of Quantum Memory Compression
• Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?
• On pseudo-stochastic matrices and pseudo-positive maps
• Faster Born probability estimation via gate merging and frame optimisation
• Simulations of quantum nonlocality with local negative bits
• Rényi Entropy, Signed Probabilities, and the Qubit
• Deriving the Qubit from Entropy Principles
• Qubit from the classical collision entropy
• Quantum theory in finite dimension cannot explain every general process with finite memory