The classical-quantum divergence of complexity in modelling spin chains

Abstract

The minimal memory required to model a given stochastic process - known as the statistical complexity - is a widely adopted quantifier of structure in complexity science. Here, we ask if quantum mechanics can fundamentally change the qualitative behaviour of this measure. We study this question in the context of the classical Ising spin chain. In this system, the statistical complexity is known to grow monotonically with temperature. We evaluate the spin chain's quantum mechanical statistical complexity by explicitly constructing its provably simplest quantum model, and demonstrate that this measure exhibits drastically different behaviour: it rises to a maximum at some finite temperature then tends back towards zero for higher temperatures. This demonstrates how complexity, as captured by the amount of memory required to model a process, can exhibit radically different behaviour when quantum processing is allowed.

9 pages, 3 figures, comments are welcome

References in corpus (11)

• Weak pairwise correlations imply strongly correlated network states in a neural population
• Quantifying Self-Organization with Optimal Predictors
• Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
• Toward an Ising Model of Cancer and Beyond
• Computational Mechanics of Input-Output Processes: Structured transformations and the $\epsilon$-transducer
• Experimental quantum processing enhancement in modelling stochastic processes
• Inferring hidden Markov models from noisy time sequences: a method to alleviate degeneracy in molecular dynamics
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Using quantum theory to reduce the complexity of input-output processes
• Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation
• Towards Quantifying Complexity with Quantum Mechanics

Cited by in corpus (21)

• A practical, unitary simulator for non-Markovian complex processes
• Extreme dimensionality reduction with quantum modelling
• A Closed-Form Shave from Occam's Quantum Razor: Exact Results for Quantum Compression
• Optimal stochastic modelling with unitary quantum dynamics
• Quantum advantage in simulating stochastic processes
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Matrix Product States for Quantum Stochastic Modelling
• Causal Asymmetry in a Quantum World
• Single-shot quantum memory advantage in the simulation of stochastic processes
• Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes
• Quantum adaptive agents with efficient long-term memories
• Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators
• Robust inference of memory structure for efficient quantum modelling of stochastic processes
• Extreme Quantum Advantage when Simulating Strongly Coupled Classical Systems
• Surveying structural complexity in quantum many-body systems
• Error-tolerant witnessing of divergences in classical and quantum statistical complexity
• Quantum-inspired identification of complex cellular automata
• The fundamental thermodynamic bounds on finite models
• The Ambiguity of Simplicity
• Ideal stochastic process modeling with post-quantum quasiprobabilistic theories