Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.06519

Causal memory and structural complexity of correlated quantum sequences

Thomas J. Elliott

quant-phcond-mat.stat-mechSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations• Revised Oct 14, 2026 (v2)
v1 · Oct 5, 2026v2 · Oct 14, 2026
arXivHTMLPDF

Abstract

What makes one quantum process more complex than another? We adopt an operational approach inspired by classical complexity science, which characterises structure through the memory required for causal generation. We develop a fully-quantum extension of computational mechanics for quantum space series: Correlated sequences of quantum outputs that do not return to interact with their generator. For stationary, memoryful quantum space series admitting finite-dimensional, primitive causal models, we show that any memory-minimal causal generator can be chosen to produce outputs isometrically, without a discarded environment. The resulting canonical matrix product state representation uniquely determines the irreducible memory required for generation. In particular, the minimum memory entropy is exactly the entanglement entropy across the past-future bipartition, giving entanglement a direct operational interpretation as irreducible memory for causal generation. The same structure determines the minimum memory dimension through the corresponding Schmidt rank. Within this class, we further show that the fundamental entropy rate vanishes, that causal generation is symmetric under time reversal, and that all memoryful processes possess infinite quantum Markov order with respect to arbitrary sharp measurements. These results establish an operational framework for quantifying intrinsic quantum structure, revealing deep connections between causal generation, complexity, memory, entropy, and entanglement.

AI Summary

The paper asks how much quantum memory is required to sequentially generate a stationary correlated quantum chain whose emitted systems never interact again with the generator. It develops a computational-mechanics description of these “quantum space series,” allowing generators to retain memory and discard an environment. Its causality condition requires that, after every rank-one projective measurement of any finite output block, the corresponding discarded environment be independent of subsequent outputs conditioned on the outcome. For memoryful processes admitting finite-dimensional primitive causal generators, the main theorem establishes a generator that discards no environment and simultaneously minimises stationary memory entropy and dimension. The admissible processes are precisely primitive finite-bond-dimension pure infinite matrix product states. If $\{\lambda_j\}_{j=1}^r$ is the squared Schmidt spectrum across the past–future cut, the minimum costs are $C_q=H(\{\lambda_j\})$ and $D_q=\log_2 r$, even among faithful stationary finite-memory generators without the causality restriction. The proof uses a conditional-product-state lemma to force output–environment factorisation, followed by canonical MPS structure and information-theoretic lower bounds. Within this class, the entropy density vanishes, past–future mutual information satisfies $E_q=2C_q$, forward and reverse memory costs coincide, and no finite measurement window screens off earlier history for every sharp measurement choice. Examples based on perturbed-coin and Nemo processes illustrate the distinction from measured classical sequences. The scope excludes feedback, nonprimitive generators, and memoryful positive-entropy-rate chains with finite causal memory under this definition—including ordinary classical Markov chains embedded diagonally. Restricted-observer and genuinely temporal extensions remain open.

Little sign of AI-generated textAI use disclosedStrong assumptions
The final stages of manuscript preparation were carried out with critical feedback from OpenAI and Anthropic models.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages, 2 figures

Related papers

Quantum generation of stochastic processes: spectral invariants and memory bounds

Magdalini Zonnios, Alexander B. Boyd, Felix C. Binder

Abstract Stochastic processes abound in nature and accurately modeling them is essential across the quantitative sciences. They can be described by hidden Markov models or by their quantum extensions. These models explain and give rise to process outputs in terms of an observed system interacting with an unobserved memory. Although there are infinitely many models that can generate a given process, they can vary greatly in their memory requirements. It is therefore of great fundamental and practical importance to identify memory-minimal models. This task is known to be hard in general, due to both the number of generating models, and the lack of invariant features that determine elements of the set. In general, it is forbiddingly difficult to ascertain that a given model is minimal. Addressing this challenge, we here identify spectral invariants of a process that can be calculated from any model that generates it. This allows us to determine strict bounds on the quantum generative complexity of the process—its minimal memory requirement. We then show that the bound is raised quadratically when we restrict to classical operations. This is an entirely quantum-coherent effect, as we express precisely, using the resource theory of coherence. Finally, we demonstrate that the classical bound can be violated by quantum models.

arXiv:2412.12812•New Journal of Physics•May 22, 2025•3 citations

How much randomness in a quantum process can be explained using memory?

Derek D. C. Chang, Graeme D. Berk, Mile Gu

For a stochastic process describing observations of a dynamical system, complexity science provides systematic methods to decompose the information produced into true irreducible randomness, and that which corresponds to structure superficially disguised as random but can in fact be learned and predicted. Such methods then equip vital tools for prediction, control and inference of the system's internal structure. However, quantum analogs remain underdeveloped due to the inherent complications of invasive measurements and quantum correlations. By harnessing the Choi state representation of process tensors which encode multi-time input-output relations, we formulate a convergent measure of irreducible randomness in stationary quantum stochastic processes. This directly enables a measure of temporal correlations which lower bounds the memory resources required to replicate the process via a recurrent quantum circuit.

quant-pharXiv:2608.25878•Aug 27, 2026•3 citations

Causal and causally separable processes

Ognyan Oreshkov, Christina Giarmatzi

The idea that events are equipped with a partial causal order is central to our understanding of physics in the tested regimes: given two pointlike events A and B , either A is in the causal past of B , B is in the causal past of A , or A and B are space-like separated. Operationally, the meaning of these order relations corresponds to constraints on the possible correlations between experiments performed in the vicinities of the respective events: if A is in the causal past of B , an experimenter at A could signal to an experimenter at B but not the other way around, while if A and B are space-like separated, no signaling is possible in either direction. In the context of a concrete physical theory, the correlations compatible with a given causal configuration may obey further constraints. For instance, space-like correlations in quantum mechanics arise from local measurements on joint quantum states, while time-like correlations are established via quantum channels. Similarly to other variables, however, the causal order of a set of events could be random, and little is understood about the constraints that causality implies in this case. A main difficulty concerns the fact that the order of events can now generally depend on the operations performed at the locations of these events, since, for instance, an operation at A could influence the order in which B and C occur in A ’s future. So far, no formal theory of causality compatible with such dynamical causal order has been developed. Apart from being of fundamental interest in the context of inferring causal relations, such a theory is imperative for understanding recent suggestions that the causal order of events in quantum mechanics can be indefinite. Here, we develop such a theory in the general multipartite case. Starting from a background-independent definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal correlations. For a fixed number of settings and outcomes for each party, these correlations form a polytope whose facets define causal inequalities. The case of quantum correlations in this paradigm is captured by the process matrix formalism. We investigate the link between causality and the closely related notion of causal separability of quantum processes, which we here define rigorously in analogy with the link between Bell locality and separability of quantum states. We show that causality and causal separability are not equivalent in general by giving an example of a physically admissible tripartite quantum process that is causal but not causally separable. We also show that there are causally separable quantum processes that become non-causal if extended by supplying the parties with entangled ancillas. This motivates the concepts of extensibly causal and extensibly causally separable (ECS) processes, for which the respective property remains invariant under extension. We characterize the class of ECS quantum processes in the tripartite case via simple conditions on the form of the process matrix. We show that the processes realizable by classically controlled quantum circuits are ECS and conjecture that the reverse also holds.

arXiv:1506.05449•New Journal of Physics•Sep 7, 2016•188 citations

Optimality and Complexity in Measured Quantum-State Stochastic Processes

Ariadna Venegas-Li, James P. Crutchfield

Abstract If an experimentalist observes a sequence of emitted quantum states via either projective or positive-operator-valued measurements, the outcomes form a time series. Individual time series are realizations of a stochastic process over the measurements’ classical outcomes. We recently showed that, in general, the resulting stochastic process is highly complex in two specific senses: (i) it is inherently unpredictable to varying degrees that depend on measurement choice and (ii) optimal prediction requires using an infinite number of temporal features. Here, we identify the mechanism underlying this complicatedness as generator nonunifilarity—the degeneracy between sequences of generator states and sequences of measurement outcomes. This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process’ degrees of randomness and structural complexity using recently introduced methods from ergodic theory. Progress in this, though, requires quantitative measures of structure and memory in observed time series. And, success requires accurate and efficient estimation algorithms that overcome the requirement to explicitly represent an infinite set of predictive features. We provide these metrics and associated algorithms, using them to design informationally-optimal measurements of open quantum dynamical systems.

arXiv:2205.03958•Journal of Statistical Physics•May 29, 2023•3 citations

Finite Realizations and Effective Memory in Nonlinear Quantum Filtering

Jacob Emerson

Nonlinear dynamics generate non-Gaussian states and operations, but they also make continuously monitored quantum systems difficult to track. A quantum filter performs this task by compressing a noisy measurement record into a set of evolving variables that predict future observables. For Gaussian dynamics, this compression is exact and finite. In nonlinear systems, conventional moment equations generally expand without bound, but the failure of one representation does not prove that every finite description is impossible. Here we formulate quantum filtering as a realization problem for general quantum input--output maps. We introduce the linearized observable Hankel operator $K_O$, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces $K_O$ to have finite rank, so infinite rank provides a coordinate-independent proof that no exact finite-dimensional filter exists. Applied to single-mode polynomial bosonic systems under continuous quadrature monitoring, this yields a sharp boundary: Gaussian dynamics and the measurement-aligned Conditional Momentum Moment class admit finite realizations, whereas dynamics outside these classes produce infinitely many response directions and admit no finite-dimensional smooth exact filter. Exact impossibility, however, need not imply large practical complexity. The singular values of $K_O$ quantify how many response directions matter at a chosen local accuracy, defining the effective memory of an observable. For the Kerr and Duffing oscillators, these singular values decay rapidly despite infinite exact rank, showing that infinite exact memory can coexist with low finite-accuracy complexity. The framework therefore separates exact realizability from effective complexity in nonlinear quantum filtering.

quant-pharXiv:2609.09663•Sep 10, 2026•1 citation

Matrix Product States for Quantum Stochastic Modeling

Chengran Yang, Felix C. Binder, Varun Narasimhachar +1 more

In stochastic modeling, there has been a significant effort towards finding predictive models that predict a stochastic process' future using minimal information from its past. Meanwhile, in condensed matter physics, matrix product states (MPS) are known as a particularly efficient representation of 1D spin chains. In this Letter, we associate each stochastic process with a suitable quantum state of a spin chain. We then show that the optimal predictive model for the process leads directly to an MPS representation of the associated quantum state. Conversely, MPS methods offer a systematic construction of the best known quantum predictive models. This connection allows an improved method for computing the quantum memory needed for generating optimal predictions. We prove that this memory coincides with the entanglement of the associated spin chain across the past-future bipartition.

arXiv:1803.08220•Physical Review Letters•Dec 27, 2018•31 citations
What makes one quantum process more complex than another? We adopt an operational approach inspired by classical complexity science, which characterises structure through the memory required for causal generation. We develop a fully-quantum extension of computational mechanics for quantum space series: Correlated sequences of quantum outputs that do not return to interact with their generator. For stationary, memoryful quantum space series admitting finite-dimensional, primitive causal models, we show that any memory-minimal causal generator can be chosen to produce outputs isometrically, without a discarded environment. The resulting canonical matrix product state representation uniquely determines the irreducible memory required for generation. In particular, the minimum memory entropy is exactly the entanglement entropy across the past-future bipartition, giving entanglement a direct operational interpretation as irreducible memory for causal generation. The same structure determines the minimum memory dimension through the corresponding Schmidt rank. Within this class, we further show that the fundamental entropy rate vanishes, that causal generation is symmetric under time reversal, and that all memoryful processes possess infinite quantum Markov order with respect to arbitrary sharp measurements. These results establish an operational framework for quantifying intrinsic quantum structure, revealing deep connections between causal generation, complexity, memory, entropy, and entanglement.
The paper asks how much quantum memory is required to sequentially generate a stationary correlated quantum chain whose emitted systems never interact again with the generator. It develops a computational-mechanics description of these “quantum space series,” allowing generators to retain memory and discard an environment. Its causality condition requires that, after every rank-one projective measurement of any finite output block, the corresponding discarded environment be independent of subsequent outputs conditioned on the outcome.
For memoryful processes admitting finite-dimensional primitive causal generators, the main theorem establishes a generator that discards no environment and simultaneously minimises stationary memory entropy and dimension. The admissible processes are precisely primitive finite-bond-dimension pure infinite matrix product states. If {λj}j=1r\{\lambda_j\}_{j=1}^r{λj​}j=1r​ is the squared Schmidt spectrum across the past–future cut, the minimum costs are Cq=H({λj})C_q=H(\{\lambda_j\})Cq​=H({λj​}) and Dq=log⁡2rD_q=\log_2 rDq​=log2​r, even among faithful stationary finite-memory generators without the causality restriction. The proof uses a conditional-product-state lemma to force output–environment factorisation, followed by canonical MPS structure and information-theoretic lower bounds.
Within this class, the entropy density vanishes, past–future mutual information satisfies Eq=2CqE_q=2C_qEq​=2Cq​, forward and reverse memory costs coincide, and no finite measurement window screens off earlier history for every sharp measurement choice. Examples based on perturbed-coin and Nemo processes illustrate the distinction from measured classical sequences. The scope excludes feedback, nonprimitive generators, and memoryful positive-entropy-rate chains with finite causal memory under this definition—including ordinary classical Markov chains embedded diagonally. Restricted-observer and genuinely temporal extensions remain open.
Abstract Stochastic processes abound in nature and accurately modeling them is essential across the quantitative sciences. They can be described by hidden Markov models or by their quantum extensions. These models explain and give rise to process outputs in terms of an observed system interacting with an unobserved memory. Although there are infinitely many models that can generate a given process, they can vary greatly in their memory requirements. It is therefore of great fundamental and practical importance to identify memory-minimal models. This task is known to be hard in general, due to both the number of generating models, and the lack of invariant features that determine elements of the set. In general, it is forbiddingly difficult to ascertain that a given model is minimal. Addressing this challenge, we here identify spectral invariants of a process that can be calculated from any model that generates it. This allows us to determine strict bounds on the quantum generative complexity of the process—its minimal memory requirement. We then show that the bound is raised quadratically when we restrict to classical operations. This is an entirely quantum-coherent effect, as we express precisely, using the resource theory of coherence. Finally, we demonstrate that the classical bound can be violated by quantum models.
For a stochastic process describing observations of a dynamical system, complexity science provides systematic methods to decompose the information produced into true irreducible randomness, and that which corresponds to structure superficially disguised as random but can in fact be learned and predicted. Such methods then equip vital tools for prediction, control and inference of the system's internal structure. However, quantum analogs remain underdeveloped due to the inherent complications of invasive measurements and quantum correlations. By harnessing the Choi state representation of process tensors which encode multi-time input-output relations, we formulate a convergent measure of irreducible randomness in stationary quantum stochastic processes. This directly enables a measure of temporal correlations which lower bounds the memory resources required to replicate the process via a recurrent quantum circuit.
The idea that events are equipped with a partial causal order is central to our understanding of physics in the tested regimes: given two pointlike events A and B , either A is in the causal past of B , B is in the causal past of A , or A and B are space-like separated. Operationally, the meaning of these order relations corresponds to constraints on the possible correlations between experiments performed in the vicinities of the respective events: if A is in the causal past of B , an experimenter at A could signal to an experimenter at B but not the other way around, while if A and B are space-like separated, no signaling is possible in either direction. In the context of a concrete physical theory, the correlations compatible with a given causal configuration may obey further constraints. For instance, space-like correlations in quantum mechanics arise from local measurements on joint quantum states, while time-like correlations are established via quantum channels. Similarly to other variables, however, the causal order of a set of events could be random, and little is understood about the constraints that causality implies in this case. A main difficulty concerns the fact that the order of events can now generally depend on the operations performed at the locations of these events, since, for instance, an operation at A could influence the order in which B and C occur in A ’s future. So far, no formal theory of causality compatible with such dynamical causal order has been developed. Apart from being of fundamental interest in the context of inferring causal relations, such a theory is imperative for understanding recent suggestions that the causal order of events in quantum mechanics can be indefinite. Here, we develop such a theory in the general multipartite case. Starting from a background-independent definition of causality, we derive an iteratively formulated canonical decomposition of multipartite causal correlations. For a fixed number of settings and outcomes for each party, these correlations form a polytope whose facets define causal inequalities. The case of quantum correlations in this paradigm is captured by the process matrix formalism. We investigate the link between causality and the closely related notion of causal separability of quantum processes, which we here define rigorously in analogy with the link between Bell locality and separability of quantum states. We show that causality and causal separability are not equivalent in general by giving an example of a physically admissible tripartite quantum process that is causal but not causally separable. We also show that there are causally separable quantum processes that become non-causal if extended by supplying the parties with entangled ancillas. This motivates the concepts of extensibly causal and extensibly causally separable (ECS) processes, for which the respective property remains invariant under extension. We characterize the class of ECS quantum processes in the tripartite case via simple conditions on the form of the process matrix. We show that the processes realizable by classically controlled quantum circuits are ECS and conjecture that the reverse also holds.
Abstract If an experimentalist observes a sequence of emitted quantum states via either projective or positive-operator-valued measurements, the outcomes form a time series. Individual time series are realizations of a stochastic process over the measurements’ classical outcomes. We recently showed that, in general, the resulting stochastic process is highly complex in two specific senses: (i) it is inherently unpredictable to varying degrees that depend on measurement choice and (ii) optimal prediction requires using an infinite number of temporal features. Here, we identify the mechanism underlying this complicatedness as generator nonunifilarity—the degeneracy between sequences of generator states and sequences of measurement outcomes. This makes it possible to quantitatively explore the influence that measurement choice has on a quantum process’ degrees of randomness and structural complexity using recently introduced methods from ergodic theory. Progress in this, though, requires quantitative measures of structure and memory in observed time series. And, success requires accurate and efficient estimation algorithms that overcome the requirement to explicitly represent an infinite set of predictive features. We provide these metrics and associated algorithms, using them to design informationally-optimal measurements of open quantum dynamical systems.
Nonlinear dynamics generate non-Gaussian states and operations, but they also make continuously monitored quantum systems difficult to track. A quantum filter performs this task by compressing a noisy measurement record into a set of evolving variables that predict future observables. For Gaussian dynamics, this compression is exact and finite. In nonlinear systems, conventional moment equations generally expand without bound, but the failure of one representation does not prove that every finite description is impossible. Here we formulate quantum filtering as a realization problem for general quantum input--output maps. We introduce the linearized observable Hankel operator KOK_OKO​, which maps changes in the past measurement record to changes in a future conditional observable. Any finite-dimensional smooth filter forces KOK_OKO​ to have finite rank, so infinite rank provides a coordinate-independent proof that no exact finite-dimensional filter exists. Applied to single-mode polynomial bosonic systems under continuous quadrature monitoring, this yields a sharp boundary: Gaussian dynamics and the measurement-aligned Conditional Momentum Moment class admit finite realizations, whereas dynamics outside these classes produce infinitely many response directions and admit no finite-dimensional smooth exact filter. Exact impossibility, however, need not imply large practical complexity. The singular values of KOK_OKO​ quantify how many response directions matter at a chosen local accuracy, defining the effective memory of an observable. For the Kerr and Duffing oscillators, these singular values decay rapidly despite infinite exact rank, showing that infinite exact memory can coexist with low finite-accuracy complexity. The framework therefore separates exact realizability from effective complexity in nonlinear quantum filtering.
In stochastic modeling, there has been a significant effort towards finding predictive models that predict a stochastic process' future using minimal information from its past. Meanwhile, in condensed matter physics, matrix product states (MPS) are known as a particularly efficient representation of 1D spin chains. In this Letter, we associate each stochastic process with a suitable quantum state of a spin chain. We then show that the optimal predictive model for the process leads directly to an MPS representation of the associated quantum state. Conversely, MPS methods offer a systematic construction of the best known quantum predictive models. This connection allows an improved method for computing the quantum memory needed for generating optimal predictions. We prove that this memory coincides with the entanglement of the associated spin chain across the past-future bipartition.