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:2609.40172

Non-Markovian dissipation as a resource for quantum reservoir computing

Luca Nigro, Francesco Monzani, Enrico Prati

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

The control of open-system dynamics provides a powerful mechanism for using quantum information to process sequential tasks. While quantum reservoir computing typically relies on Markovian dissipation to process sequential data, the computational role of non-Markovian memory effects remains largely unexplored. We introduce a framework for quantum reservoir computing where non-Markovianity is explicitly modeled and regulated using fractional derivatives. By employing fractional time subordination, we generate tunable, heavy-tailed relaxation dynamics that govern the information backflow between the system and its environment. Non-Markovian information backflow regulates the overall temporal retention of the system, maximizing short-term linear memory capacity. Within an optimal operating regime, fractional non-Markovianity redistributes the reservoir memory towards recent inputs, improving both linear memory capacity and nonlinear prediction accuracy at short delays, at the expense of long-range temporal retention. System-environment interaction proves being not merely a requirement for quantum reservoir computing, but an active resource that embeds memory retention directly into the quantum evolution.

AI Summary

The paper asks whether tunable non-Markovian dissipation can improve temporal processing in quantum reservoir computing. It studies an amplitude-damped transverse-field Ising chain, with sequential inputs encoded through local fields and a trained linear readout of time-multiplexed local Pauli expectation values. A Caputo derivative of order $\alpha\in(0,1]$ replaces the ordinary time derivative; inverse-Lévy time subordination implements the resulting fractional dynamics as mixtures of GKSL evolutions. Importantly, the fractional memory is restarted at each input interval rather than propagated across the input sequence. Single-spin simulations report increasing trace-distance backflow as $\alpha$ decreases, assessed using a sampled BLP measure and a trace-distance-revival fraction described as a CP-divisibility diagnostic. Four-spin simulations, with damping rate $\gamma=0.4$ and eight virtual nodes per input, test convergence from different initial states, forgetting of differing input histories, delayed-input reconstruction, and NARMA prediction. The reported gains reach a factor of three in short-term linear memory capacity and up to an order-of-magnitude reduction in nonlinear prediction error. Improvements concentrate at delays or NARMA orders around five or below; longer-delay reconstruction and higher-order prediction deteriorate relative to the Markovian baseline. The findings concern this specific simulated reservoir and operating regime. Echo-state and fading-memory behavior are supported by numerical convergence tests rather than general proofs. The paper identifies propagation and characterization of multi-time correlations using process tensors, task-matched memory kernels, and automated reservoir design as future directions; it does not demonstrate a hardware implementation.

Some signs of AI-generated textOverclaimsSmall numerics onlyMissing comparisonPossible error

Central claim may not hold: Restarting the fractional dynamics at every input interval removes persistent environmental memory across updates, so the simulations do not establish the claimed cross-input environmental-backflow mechanism. The reported CP-divisibility violation fraction measures trace-distance increases rather than complete positivity of intermediate maps and cannot certify CP-divisibility when it vanishes. Finite numerical convergence and input-history tests do not establish the general ESP, fading-memory, and input-separability guarantees claimed in the text. The fixed Markovian comparison does not control for subordination-induced changes in effective evolution timescales, leaving the attribution of performance improvements specifically to non-Markovian backflow unresolved.

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

Comments
9 pages, 5 figures

Related papers

Non-Markovianity and memory enhancement in quantum reservoir computing

Antonio Sannia, Ricard Ravell Rodríguez, Gian Luca Giorgi +1 more

Featuring memory of past inputs is a fundamental requirement for machine learning models processing time-dependent data. In quantum reservoir computing, all architectures proposed so far rely on Markovian dynamics, which, as we prove, inherently lead to an exponential decay of past information, thereby limiting long-term memory capabilities. We demonstrate that non-Markovian dynamics can overcome this limitation, enabling extended memory retention. By analytically deriving memory bounds and supporting our findings with numerical simulations, we show that non-Markovian reservoirs can outperform their Markovian counterparts, particularly in tasks that require a coexistence of short- and long-term correlations. We introduce an embedding approach that allows a controlled transition from Markovian to non-Markovian evolution, providing a path for practical implementations. Our results establish quantum non-Markovianity as a key resource for enhancing memory in quantum machine learning architectures, with broad implications in quantum neural networks.

arXiv:2505.02491•npj Quantum Information•May 8, 2026•14 citations

Harnessing Environmental Memory with Reinforcement Learning in Open Quantum Systems

Safae Gaidi, Abdallah Slaoui, Mohammed EL Falaki +1 more

Non-Markovian quantum dynamics, characterized by information backflow from the environment to the system, has emerged as a potential resource for quantum technologies. A key challenge is therefore to control and enhance such memory effects. In this work, we investigate the use of reinforcement learning (RL) to maximize non-Markovianity in a driven two-level system coupled to a structured reservoir. We compare RL-based control strategies with standard optimal control theory (OCT). We show that OCT produces localized but relatively weak revivalsin the instantaneous non-Markovianity rate, whereas RL policies generate significantly stronger and better-timed information backflow by synchronizing the system dynamics with favorable memory intervals of the environment. This enhanced exploitation of memory effects leads to a higher total integrated non-Markovianity for RL than for OCT, with SAC achieving the largest overall enhancement and PPO delivering slightly lower but still strongly improved performance with smoother, experimentally attractive pulses. Our results contribute to the emerging view of non-Markovianity as an operational resource and illustrate how RL can serve as a flexible, model-free tool for non-Markovian quantum control.

quant-pharXiv:2601.01252•Jan 6, 2026•0 citations

Hamiltonian-Driven Architectures for Non-Markovian Quantum Reservoir Computing

Daiki Sasaki, Ryosuke Koga, Kuroiwa, Taihei +3 more

We propose a Hamiltonian-level framework for non-Markovian quantum reservoir computing directly tailored for analog hardware implementations. By dividing the reservoir into a system block and an environment block and evolving their joint state under a unified Hamiltonian, our architecture naturally embeds memory backflow by harnessing entanglement-induced information backflow with tunable coupling strengths. Numerical benchmarks on short-term memory tasks demonstrate that operating in non-Markovian regimes yields significantly slower memory decay compared to the Markovian limit. Further analyzing the echo-state property (ESP), showing that the non-Markovian quantum reservoir evolves from two different initial states, they do not converge to the same trajectory even after a long time, strongly suggesting that the ESP is effectively violated. Our work provides the first demonstration in quantum reservoir computing that strong non-Markovianity can fundamentally violate the ESP, such that conventional linear-regression readouts fail to deliver stable training and inference. Finally, we experimentally showed that, with an appropriate time-evolution step size, the non-Markovian reservoir exhibits superior performance on higher-order nonlinear autoregressive moving-average(NARMA) tasks.

arXiv:2505.14450•May 20, 2025•5 citations

A Fractional Calculus Framework for Open Quantum Dynamics: From Liouville to Lindblad to Memory Kernels

Bo Peng, Yu Zhang

Open quantum systems exhibit dynamics ranging from unitary evolution to irreversible dissipation. While the Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) equation uniquely characterizes Markovian CPTP evolution, many physical platforms display non-Markovian features such as algebraic relaxation and coherence backflow. Fractional calculus provides a natural way to model such long-memory behavior through power-law temporal kernels introduced by fractional time derivatives. Here we develop a unified framework that embeds fractional master equations within the broader hierarchy of open-system formalisms. The fractional equation forms a structured subclass of memory-kernel models, reduces to the Lindblad form at unit order, and, through Bochner--Phillips subordination, admits a CPTP representation as an average over Lindblad semigroups. Its resolvent structure further connects fractional dynamics to established non-Markovian approaches, including Nakajima--Zwanzig kernels and hierarchical equations of motion, providing a compact surrogate for long-memory effects. This formulation positions fractional calculus as a rigorous and practical language for quantum dynamics with intrinsic memory, supporting both analytical insight and efficient quantum simulation.

quant-pharXiv:2511.13038•The Journal of Chemical Physics•Nov 18, 2025•7 citations

Memory-Nonlinearity Trade-off across Quantum Reservoir Computing Frameworks

Saud Čindrak, Lara Giebeler, Niclas Götting +2 more

Quantum reservoir computing (QRC) harnesses driven quantum dynamics for time-series processing, yet the mechanisms behind the differing performance levels across its many implementations remain unclear. We show that apparently unrelated approaches-including memory restriction, weak measurements, operation near the edge of quantum chaos, and dissipative dynamics-are in fact governed by the same underlying principle, namely a tunable balance between memory retention and nonlinear response. Using the information processing capacity, a dynamical measure from nonlinear systems theory, we place these behaviors in a unified framework and identify the regimes in which quantum reservoirs surpass the standard protocol. Our results reveal a fundamental connection between memory and nonlinear response. This provides a general design principle for enhanced information processing and enables systematic analysis and optimization inspired by classical dynamical quantifiers.

quant-pharXiv:2603.21371•Mar 24, 2026•10 citations

Quantum magic and non-commutativity as computational resources in quantum reservoir computing

Wei Xia, Shuaifan Cao, Xingze Qiu +1 more

Quantum reservoir computing (QRC) provides a hardware-efficient paradigm for temporal information processing on near-term quantum devices. Despite rapid experimental progress, a rigorous understanding of the structural conditions required for its scalable quantum-enhanced performance remains lacking. Here, we develop a theoretical framework in Pauli-Liouville space that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources. We first analyze the widely used qubit-resetting scheme and establish that quantum magic generated by reservoir dynamics is a necessary condition for effective computation, a requirement more fundamental than ESP. However, we prove that this architecture faces inherent expressivity limitations: all nonlinear processing originates exclusively from the classical encoding map, imposing an unavoidable trade-off between nonlinearity and memory capacity. To circumvent this structural bottleneck, we rigorously analyze Hamiltonian encoding, in which temporal inputs are embedded directly into the continuous dynamics generator. We show that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic. Crucially, for any non-trivial drive Hamiltonian, the discrete-time update map exhibits a transcendental, infinite-order nonlinear dependence on the instantaneous input. Moreover, the intrinsic non-commutativity of the open-system generators governs the temporal coupling of these nonlinearities, producing highly non-separable processing of the input history. Our results establish a rigorous theoretical hierarchy of QRC architectures and provide prescriptive design principles for experiments targeting genuine quantum advantages in temporal processing.

quant-pharXiv:2607.12035•Jul 15, 2026•8 citations
The control of open-system dynamics provides a powerful mechanism for using quantum information to process sequential tasks. While quantum reservoir computing typically relies on Markovian dissipation to process sequential data, the computational role of non-Markovian memory effects remains largely unexplored. We introduce a framework for quantum reservoir computing where non-Markovianity is explicitly modeled and regulated using fractional derivatives. By employing fractional time subordination, we generate tunable, heavy-tailed relaxation dynamics that govern the information backflow between the system and its environment. Non-Markovian information backflow regulates the overall temporal retention of the system, maximizing short-term linear memory capacity. Within an optimal operating regime, fractional non-Markovianity redistributes the reservoir memory towards recent inputs, improving both linear memory capacity and nonlinear prediction accuracy at short delays, at the expense of long-range temporal retention. System-environment interaction proves being not merely a requirement for quantum reservoir computing, but an active resource that embeds memory retention directly into the quantum evolution.
The paper asks whether tunable non-Markovian dissipation can improve temporal processing in quantum reservoir computing. It studies an amplitude-damped transverse-field Ising chain, with sequential inputs encoded through local fields and a trained linear readout of time-multiplexed local Pauli expectation values. A Caputo derivative of order α∈(0,1]\alpha\in(0,1]α∈(0,1] replaces the ordinary time derivative; inverse-Lévy time subordination implements the resulting fractional dynamics as mixtures of GKSL evolutions. Importantly, the fractional memory is restarted at each input interval rather than propagated across the input sequence.
Single-spin simulations report increasing trace-distance backflow as α\alphaα decreases, assessed using a sampled BLP measure and a trace-distance-revival fraction described as a CP-divisibility diagnostic. Four-spin simulations, with damping rate γ=0.4\gamma=0.4γ=0.4 and eight virtual nodes per input, test convergence from different initial states, forgetting of differing input histories, delayed-input reconstruction, and NARMA prediction. The reported gains reach a factor of three in short-term linear memory capacity and up to an order-of-magnitude reduction in nonlinear prediction error. Improvements concentrate at delays or NARMA orders around five or below; longer-delay reconstruction and higher-order prediction deteriorate relative to the Markovian baseline.
The findings concern this specific simulated reservoir and operating regime. Echo-state and fading-memory behavior are supported by numerical convergence tests rather than general proofs. The paper identifies propagation and characterization of multi-time correlations using process tensors, task-matched memory kernels, and automated reservoir design as future directions; it does not demonstrate a hardware implementation.
Featuring memory of past inputs is a fundamental requirement for machine learning models processing time-dependent data. In quantum reservoir computing, all architectures proposed so far rely on Markovian dynamics, which, as we prove, inherently lead to an exponential decay of past information, thereby limiting long-term memory capabilities. We demonstrate that non-Markovian dynamics can overcome this limitation, enabling extended memory retention. By analytically deriving memory bounds and supporting our findings with numerical simulations, we show that non-Markovian reservoirs can outperform their Markovian counterparts, particularly in tasks that require a coexistence of short- and long-term correlations. We introduce an embedding approach that allows a controlled transition from Markovian to non-Markovian evolution, providing a path for practical implementations. Our results establish quantum non-Markovianity as a key resource for enhancing memory in quantum machine learning architectures, with broad implications in quantum neural networks.
Non-Markovian quantum dynamics, characterized by information backflow from the environment to the system, has emerged as a potential resource for quantum technologies. A key challenge is therefore to control and enhance such memory effects. In this work, we investigate the use of reinforcement learning (RL) to maximize non-Markovianity in a driven two-level system coupled to a structured reservoir. We compare RL-based control strategies with standard optimal control theory (OCT). We show that OCT produces localized but relatively weak revivalsin the instantaneous non-Markovianity rate, whereas RL policies generate significantly stronger and better-timed information backflow by synchronizing the system dynamics with favorable memory intervals of the environment. This enhanced exploitation of memory effects leads to a higher total integrated non-Markovianity for RL than for OCT, with SAC achieving the largest overall enhancement and PPO delivering slightly lower but still strongly improved performance with smoother, experimentally attractive pulses. Our results contribute to the emerging view of non-Markovianity as an operational resource and illustrate how RL can serve as a flexible, model-free tool for non-Markovian quantum control.
We propose a Hamiltonian-level framework for non-Markovian quantum reservoir computing directly tailored for analog hardware implementations. By dividing the reservoir into a system block and an environment block and evolving their joint state under a unified Hamiltonian, our architecture naturally embeds memory backflow by harnessing entanglement-induced information backflow with tunable coupling strengths. Numerical benchmarks on short-term memory tasks demonstrate that operating in non-Markovian regimes yields significantly slower memory decay compared to the Markovian limit. Further analyzing the echo-state property (ESP), showing that the non-Markovian quantum reservoir evolves from two different initial states, they do not converge to the same trajectory even after a long time, strongly suggesting that the ESP is effectively violated. Our work provides the first demonstration in quantum reservoir computing that strong non-Markovianity can fundamentally violate the ESP, such that conventional linear-regression readouts fail to deliver stable training and inference. Finally, we experimentally showed that, with an appropriate time-evolution step size, the non-Markovian reservoir exhibits superior performance on higher-order nonlinear autoregressive moving-average(NARMA) tasks.
Open quantum systems exhibit dynamics ranging from unitary evolution to irreversible dissipation. While the Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) equation uniquely characterizes Markovian CPTP evolution, many physical platforms display non-Markovian features such as algebraic relaxation and coherence backflow. Fractional calculus provides a natural way to model such long-memory behavior through power-law temporal kernels introduced by fractional time derivatives. Here we develop a unified framework that embeds fractional master equations within the broader hierarchy of open-system formalisms. The fractional equation forms a structured subclass of memory-kernel models, reduces to the Lindblad form at unit order, and, through Bochner--Phillips subordination, admits a CPTP representation as an average over Lindblad semigroups. Its resolvent structure further connects fractional dynamics to established non-Markovian approaches, including Nakajima--Zwanzig kernels and hierarchical equations of motion, providing a compact surrogate for long-memory effects. This formulation positions fractional calculus as a rigorous and practical language for quantum dynamics with intrinsic memory, supporting both analytical insight and efficient quantum simulation.
Quantum reservoir computing (QRC) harnesses driven quantum dynamics for time-series processing, yet the mechanisms behind the differing performance levels across its many implementations remain unclear. We show that apparently unrelated approaches-including memory restriction, weak measurements, operation near the edge of quantum chaos, and dissipative dynamics-are in fact governed by the same underlying principle, namely a tunable balance between memory retention and nonlinear response. Using the information processing capacity, a dynamical measure from nonlinear systems theory, we place these behaviors in a unified framework and identify the regimes in which quantum reservoirs surpass the standard protocol. Our results reveal a fundamental connection between memory and nonlinear response. This provides a general design principle for enhanced information processing and enables systematic analysis and optimization inspired by classical dynamical quantifiers.
Quantum reservoir computing (QRC) provides a hardware-efficient paradigm for temporal information processing on near-term quantum devices. Despite rapid experimental progress, a rigorous understanding of the structural conditions required for its scalable quantum-enhanced performance remains lacking. Here, we develop a theoretical framework in Pauli-Liouville space that provides a unified analytical treatment of the echo state property (ESP), nonlinear expressive power, and quantum resources. We first analyze the widely used qubit-resetting scheme and establish that quantum magic generated by reservoir dynamics is a necessary condition for effective computation, a requirement more fundamental than ESP. However, we prove that this architecture faces inherent expressivity limitations: all nonlinear processing originates exclusively from the classical encoding map, imposing an unavoidable trade-off between nonlinearity and memory capacity. To circumvent this structural bottleneck, we rigorously analyze Hamiltonian encoding, in which temporal inputs are embedded directly into the continuous dynamics generator. We show that the ESP is natively guaranteed by the Liouvillian spectral gap, decoupling it from quantum magic. Crucially, for any non-trivial drive Hamiltonian, the discrete-time update map exhibits a transcendental, infinite-order nonlinear dependence on the instantaneous input. Moreover, the intrinsic non-commutativity of the open-system generators governs the temporal coupling of these nonlinearities, producing highly non-separable processing of the input history. Our results establish a rigorous theoretical hierarchy of QRC architectures and provide prescriptive design principles for experiments targeting genuine quantum advantages in temporal processing.