Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics

Abstract

Stochastic modelling of complex systems plays an essential, yet often computationally intensive role across the quantitative sciences. Recent advances in quantum information processing have elucidated the potential for quantum simulators to exhibit memory advantages for such tasks. Heretofore, the focus has been on lossless memory compression, wherein the advantage is typically in terms of lessening the amount of information tracked by the model, while -- arguably more practical -- reductions in memory dimension are not always possible. Here we address the case of lossy compression for quantum stochastic modelling of continuous-time processes, introducing a method for coarse-graining in quantum state space that drastically reduces the requisite memory dimension for modelling temporal dynamics whilst retaining near-exact statistics. In contrast to classical coarse-graining, this compression is not based on sacrificing temporal resolution, and brings memory-efficient, high-fidelity stochastic modelling within reach of present quantum technologies.

arXiv comment14 pages, 9 figures

References in corpus (23)

• Computational Mechanics: Pattern and Prediction, Structure and Simplicity
• Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• A practical, unitary simulator for non-Markovian complex processes
• The Computational Structure of Spike Trains
• Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics
• Extreme dimensionality reduction with quantum modelling
• Complexity analysis of the stock market
• Optimal stochastic modelling with unitary quantum dynamics
• The application of computational mechanics to the analysis of geomagnetic data
• Extreme Quantum Advantage for Rare-Event Sampling
• Using quantum theory to reduce the complexity of input-output processes
• Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Causal Asymmetry in a Quantum World
• Structure and Randomness of Continuous-Time Discrete-Event Processes
• Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models
• Quantum Stopwatch: How To Store Time in a Quantum Memory
• Single-shot quantum memory advantage in the simulation of stochastic processes
• Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
• Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators
• Robust inference of memory structure for efficient quantum modelling of stochastic processes

Cited by in corpus (9)

• Quantum adaptive agents with efficient long-term memories
• Implementing quantum dimensionality reduction for non-Markovian stochastic simulation
• Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications
• Accuracy vs Memory Advantage in the Quantum Simulation of Stochastic Processes
• Embedding memory-efficient stochastic simulators as quantum trajectories
• Quantum theory in finite dimension cannot explain every general process with finite memory
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage
• Quantum-inspired identification of complex cellular automata
• Quantum Dimension Reduction of Hidden Markov Models