Robust inference of memory structure for efficient quantum modelling of stochastic processes

Abstract

A growing body of work has established the modelling of stochastic processes as a promising area of application for quantum techologies; it has been shown that quantum models are able to replicate the future statistics of a stochastic process whilst retaining less information about the past than any classical model must -- even for a purely classical process. Such memory-efficient models open a potential future route to study complex systems in greater detail than ever before, and suggest profound consequences for our notions of structure in their dynamics. Yet, to date methods for constructing these quantum models are based on having a prior knowledge of the optimal classical model. Here, we introduce a protocol for blind inference of the memory structure of quantum models -- tailored to take advantage of quantum features -- direct from time-series data, in the process highlighting the robustness of their structure to noise. This in turn provides a way to construct memory-efficient quantum models of stochastic processes whilst circumventing certain drawbacks that manifest solely as a result of classical information processing in classical inference protocols.

arXiv comment10 pages, 6 figures

References in corpus (23)

• Quantum cryptography: Public key distribution and coin tossing
• Quantum algorithms: an overview
• Computational Mechanics: Pattern and Prediction, Structure and Simplicity
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information
• Distinguishability of States and von Neumann Entropy
• A practical, unitary simulator for non-Markovian complex processes
• The Computational Structure of Spike Trains
• Bayesian Structural Inference for Hidden Processes
• Experimental quantum processing enhancement in modelling stochastic processes
• Complexity analysis of the stock market
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Optimal stochastic modelling with unitary quantum dynamics
• Using quantum theory to reduce the complexity of input-output processes
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Towards Quantifying Complexity with Quantum Mechanics
• The classical-quantum divergence of complexity in modelling spin chains
• Causal Asymmetry in a Quantum World
• How Hidden are Hidden Processes? A Primer on Crypticity and Entropy Convergence
• Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
• Single-shot quantum memory advantage in the simulation of stochastic processes
• Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators

Cited by in corpus (7)

• Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Quantum adaptive agents with efficient long-term memories
• Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics
• Surveying structural complexity in quantum many-body systems
• Unitary Evolutions Sourced By Interacting Quantum Memories: Closed Quantum Systems Directing Themselves Using Their State Histories
• Quantum-inspired identification of complex cellular automata
• Enhancing quantum models of stochastic processes with error mitigation