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:2205.03958 · Journal of Statistical Physics

Optimality and Complexity in Measured Quantum-State Stochastic Processes

Ariadna Venegas-Li, James P. Crutchfield

Published May 29, 2023• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1007/s10955-023-03112-8

Related papers

Measurement-induced randomness and structure in controlled qubit processes

Ariadna Venegas-Li, Alexandra M. Jurgens, James P. Crutchfield

When an experimentalist measures a time series of qubits, the outcomes constitute a classical stochastic process. We show that projective measurement induces high complexity in these processes in two specific senses: They are inherently random (finite Shannon entropy rate) and they require infinite memory for optimal prediction (divergent statistical complexity). We identify nonorthogonality of the quantum states as the mechanism underlying the resulting complexities and examine the influence that measurement choice has on the randomness and structure of measured qubit processes. We introduce quantitative measures of this complexity and provide efficient algorithms for their estimation.

arXiv:1908.09053•Physical review. E•Oct 6, 2020•8 citations

Memory effects in quantum processes

Philip Taranto

Understanding temporal processes and their correlations in time is of paramount importance for the development of near-term technologies that operate under realistic conditions. Capturing the complete multi-time statistics that define a stochastic process lies at the heart of any proper treatment of memory effects. This is well understood in classical theory, where a hierarchy of joint probability distributions completely characterizes the process at hand. However, attempting to generalize this notion to quantum mechanics is problematic: observing realizations of a quantum process necessarily disturbs the state of the system, breaking an implicit, and crucial, assumption in the classical setting. This issue can be overcome by separating the experimental interventions from the underlying process, enabling an unambiguous description of the process itself and accounting for all possible multi-time correlations for any choice of interrogating instruments. In this paper, using a novel framework for the characterization of quantum stochastic processes, we first solve the long standing question of unambiguously describing the memory length of a quantum processes. This is achieved by constructing a quantum Markov order condition, which naturally generalizes its classical counterpart for the quantification of finite-length memory effects. As measurements are inherently invasive in quantum mechanics, one has no choice but to define Markov order with respect to the interrogating instruments that are used to probe the process at hand: different memory effects are exhibited depending on how one addresses the system, in contrast to the standard classical setting. We then fully characterize the structural constraints imposed on quantum processes with finite Markov order, shedding light on a variety of memory effects that can arise through various examples. Finally, we introduce an instrument-specific notion of memory strength that allows for a meaningful quantification of the temporal correlations between the history and the future of a process for a given choice of experimental intervention. These findings are directly relevant to both characterizing and exploiting memory effects that persist for a finite duration. In particular, immediate applications range from developing efficient compression and recovery schemes for the description of quantum processes with memory to designing coherent control protocols that efficiently perform information-theoretic tasks, amongst a plethora of others.

arXiv:1909.05245•International Journal of Quantum Information•Jan 7, 2020•16 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

Structure of quantum stochastic processes with finite Markov order

Philip Taranto, Simon Milz, Felix A. Pollock +1 more

Non-Markovian quantum processes exhibit different memory effects when measured in different ways; an unambiguous characterization of memory length requires accounting for the sequence of instruments applied to probe the system dynamics. This instrument-specific notion of quantum Markov order displays stark differences to its classical counterpart. Here, we explore the structure of quantum stochastic processes with finite memory length in detail. We begin by examining a generalized collision model with memory, before framing this instance within the general theory. We detail the constraints that are placed on the underlying system-environment dynamics for a process to exhibit finite Markov order with respect to natural classes of probing instruments, including deterministic (unitary) operations and sequences of generalized quantum measurements with informationally complete repreparations. Lastly, we show how processes with vanishing quantum conditional mutual information form a special case of the theory. Throughout, we provide a number of representative, pedagogical examples to display the salient features of memory effects in quantum processes.

arXiv:1810.10809•Physical Review A•Apr 9, 2019•68 citations

Causal memory and structural complexity of correlated quantum sequences

Thomas J. Elliott

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.

quant-pharXiv:2610.06519•Oct 6, 2026•0 citations

Minimized state complexity of quantum-encoded cryptic processes

Paul M. Riechers, John R. Mahoney, Cina Aghamohammadi +1 more

The predictive information required for proper trajectory sampling of a stochastic process can be more efficiently transmitted via a quantum channel than a classical one. This recent discovery allows quantum information processing to drastically reduce the memory necessary to simulate complex classical stochastic processes. It also points to a new perspective on the intrinsic complexity that nature must employ in generating the processes we observe. The quantum advantage increases with codeword length: the length of process sequences used in constructing the quantum communication scheme. In analogy with the classical complexity measure, statistical complexity, we use this reduced communication cost as an entropic measure of state complexity in the quantum representation. Previously difficult to compute, the quantum advantage is expressed here in closed form using spectral decomposition. This allows for efficient numerical computation of the quantum-reduced state complexity at all encoding lengths, including infinite. Additionally, it makes clear how finite-codeword reduction in state complexity is controlled by the classical process's cryptic order, and it allows asymptotic analysis of infinite-cryptic-order processes.

arXiv:1510.08186•Physical Review A•May 16, 2016•41 citations
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.
When an experimentalist measures a time series of qubits, the outcomes constitute a classical stochastic process. We show that projective measurement induces high complexity in these processes in two specific senses: They are inherently random (finite Shannon entropy rate) and they require infinite memory for optimal prediction (divergent statistical complexity). We identify nonorthogonality of the quantum states as the mechanism underlying the resulting complexities and examine the influence that measurement choice has on the randomness and structure of measured qubit processes. We introduce quantitative measures of this complexity and provide efficient algorithms for their estimation.
Understanding temporal processes and their correlations in time is of paramount importance for the development of near-term technologies that operate under realistic conditions. Capturing the complete multi-time statistics that define a stochastic process lies at the heart of any proper treatment of memory effects. This is well understood in classical theory, where a hierarchy of joint probability distributions completely characterizes the process at hand. However, attempting to generalize this notion to quantum mechanics is problematic: observing realizations of a quantum process necessarily disturbs the state of the system, breaking an implicit, and crucial, assumption in the classical setting. This issue can be overcome by separating the experimental interventions from the underlying process, enabling an unambiguous description of the process itself and accounting for all possible multi-time correlations for any choice of interrogating instruments. In this paper, using a novel framework for the characterization of quantum stochastic processes, we first solve the long standing question of unambiguously describing the memory length of a quantum processes. This is achieved by constructing a quantum Markov order condition, which naturally generalizes its classical counterpart for the quantification of finite-length memory effects. As measurements are inherently invasive in quantum mechanics, one has no choice but to define Markov order with respect to the interrogating instruments that are used to probe the process at hand: different memory effects are exhibited depending on how one addresses the system, in contrast to the standard classical setting. We then fully characterize the structural constraints imposed on quantum processes with finite Markov order, shedding light on a variety of memory effects that can arise through various examples. Finally, we introduce an instrument-specific notion of memory strength that allows for a meaningful quantification of the temporal correlations between the history and the future of a process for a given choice of experimental intervention. These findings are directly relevant to both characterizing and exploiting memory effects that persist for a finite duration. In particular, immediate applications range from developing efficient compression and recovery schemes for the description of quantum processes with memory to designing coherent control protocols that efficiently perform information-theoretic tasks, amongst a plethora of others.
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.
Non-Markovian quantum processes exhibit different memory effects when measured in different ways; an unambiguous characterization of memory length requires accounting for the sequence of instruments applied to probe the system dynamics. This instrument-specific notion of quantum Markov order displays stark differences to its classical counterpart. Here, we explore the structure of quantum stochastic processes with finite memory length in detail. We begin by examining a generalized collision model with memory, before framing this instance within the general theory. We detail the constraints that are placed on the underlying system-environment dynamics for a process to exhibit finite Markov order with respect to natural classes of probing instruments, including deterministic (unitary) operations and sequences of generalized quantum measurements with informationally complete repreparations. Lastly, we show how processes with vanishing quantum conditional mutual information form a special case of the theory. Throughout, we provide a number of representative, pedagogical examples to display the salient features of memory effects in quantum processes.
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 predictive information required for proper trajectory sampling of a stochastic process can be more efficiently transmitted via a quantum channel than a classical one. This recent discovery allows quantum information processing to drastically reduce the memory necessary to simulate complex classical stochastic processes. It also points to a new perspective on the intrinsic complexity that nature must employ in generating the processes we observe. The quantum advantage increases with codeword length: the length of process sequences used in constructing the quantum communication scheme. In analogy with the classical complexity measure, statistical complexity, we use this reduced communication cost as an entropic measure of state complexity in the quantum representation. Previously difficult to compute, the quantum advantage is expressed here in closed form using spectral decomposition. This allows for efficient numerical computation of the quantum-reduced state complexity at all encoding lengths, including infinite. Additionally, it makes clear how finite-codeword reduction in state complexity is controlled by the classical process's cryptic order, and it allows asymptotic analysis of infinite-cryptic-order processes.