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.36901

Digital Twin Modeling of Quantum Dynamical Systems: Dissipative Quantum Reservoir Computing

Abhijit Sen, Bikram Keshari Parida, Shital Chauhan, Mahima Arya, Denys I. Bondar

quant-phcs.AISubmitted Sep 29, 2026• Announced Sep 30, 2026• 0 citations
arXivHTMLPDF

Abstract

Modeling the response of driven many-body quantum systems from input--output data is difficult: the dynamics are nonlinear, history dependent, and expensive to simulate as system size grows. A paradigmatic case is High-Harmonic Generation~(HHG), where a strong field drives a medium to emit radiation that is highly sensitive to the drive and encodes long-range temporal correlations. We introduce a dissipative quantum reservoir computing~(DQRC) framework that builds a digital twin of such a system, learning its input--output map directly from data while the reservoir---itself a small open quantum system---stays fixed and only a classical readout is trained. We show that a minimal single-qubit reservoir reproduces the HHG response of a substantially larger Ising spin chain, and on a representative benchmark matches and on several metrics surpasses previously reported temporal convolutional and Kolmogorov--Arnold-network models, while using a simpler, physically realizable system. A single fixed reservoir further generalizes across a broad range of drives, indicating that it learns a shared physical response structure rather than memorizing trajectories. These results establish dissipative quantum reservoirs as compact, physically grounded digital twins for nonlinear, memory-dependent quantum dynamics. Code is available at \href{https://github.com/AI-and-Quantum-Computing/DQuRC}{https://github.com/AI-and-Quantum-Computing/DQuRC}.

AI Summary

The paper studies whether a small driven, dissipative quantum system can serve as a data-trained surrogate for the observable response of a larger driven quantum system, motivated by high-harmonic generation. The target data are numerical trajectories of a ten-spin transverse-field Ising chain under monochromatic drives $h(t)=F_0\sin(\omega t)$, with the collective transverse magnetization as output. The reservoir is a single qubit governed by a driven Lindblad equation with amplitude damping. Its parameters remain fixed while each 512-point input trajectory generates a 512-point reservoir-response vector. These vectors are compressed to 15 principal components and mapped to complete target trajectories using nonlinear radial-basis-function kernel ridge regression. Readout hyperparameters are selected by five-fold cross-validation, and performance is evaluated on held-out trajectories from an 80:20 split. At fixed amplitude $F_0=20$, the reported global accuracy reaches $R^2=0.9997$ and normalized MSE $10^{-5}$ using 3,700 trajectories. Across amplitudes $F_0\in\{1,\ldots,20\}$, a model trained on 3,200 of 4,000 trajectories achieves $R^2=0.9709$; 85.88% of test trajectories exceed per-trajectory $R^2=0.95$. Comparisons with previously reported Kolmogorov–Arnold networks show comparable or higher threshold pass rates in some settings. The study is numerical and restricted to sinusoidal drives within sampled frequency–amplitude families, rather than arbitrary waveforms. It explicitly makes no quantum-advantage claim and does not model microscopic HHG processes. A full memory-capacity analysis is deferred; reduced accuracy at low frequencies and high amplitudes is discussed in terms of finite reservoir memory and signal complexity.

Likely largely AI-generatedOverclaimsMissing comparisonSmall numerics onlyPossible error

Central claim may not hold: The implemented predictor uses nonlinear RBF kernel regression on whole trajectories, contradicting repeated linear-readout descriptions and leaving the proposed causal fading-memory explanation unestablished. Random held-out sinusoidal trajectories demonstrate interpolation within a low-dimensional drive family, not extrapolation or discovery of shared physical response structure. Time-domain observable accuracy does not directly establish harmonic-spectrum accuracy, and the prior-model comparison lacks a quantitative temporal-convolutional baseline and fully matched KAN benchmarks. Under the stated identical, noninteracting reservoir dynamics and product initialization, adding a second qubit only doubles the measured feature trajectory, so the reported improvement cannot demonstrate increased feature-space dimension. Dissipative reservoir dynamics bound measured reservoir features but do not guarantee physically bounded predictions from the unconstrained kernel readout.

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

Comments
13 pages, 9 figures

Related papers

Quantum Reservoir Computing: Recent Advances and Future Directions

Shehbaz Tariq, Muhammad Talha, Arshid Ali +2 more

Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.

quant-pharXiv:2607.18552•Jul 22, 2026•5 citations

Where a Quantum Reservoir Works: A Transferable Operating Band

Markus Baumann, Itamar Fink, Johannes Wittmann +2 more

In quantum reservoir computing, a fixed quantum system transforms an input signal, while learning reduces to training a simple linear readout on its measured outputs. Since the quantum dynamics themselves are never optimized, the method is well suited to today's hardware. Yet these dynamics must still be chosen carefully, because their settings remain fixed throughout training and inference. It therefore remains open whether useful dynamics occupy a task-transferable region of control space and whether that region can be found without target-task tuning. We address this question for a dissipative reservoir by mapping performance over three central physical controls: the strength of the input drive, the coupling between neighboring qubits, and the rate of dissipation. Good performance concentrates in a well-defined operating band of this control space. This region transfers across tasks and reservoir initializations, and the same regime persists under an architectural change. It is also mechanistically grounded, since it disappears whenever any of the mechanisms that create it is removed. Finally, the region can be located cheaply before any task is run, using a simple memory diagnostic.

quant-pharXiv:2606.13284•Jun 12, 2026•1 citation

Thermally-driven quantum reservoir computing

T. Werlang, Daniel Valente

Heat generation limits computation, classical and quantum, from single logic gates to entire data centers. However, an in principle limiting physical factor can sometimes be turned into a resource. In reservoir computing, energy dissipation is what gives a reservoir its fading memory. Here, we introduce a paradigm where the data injection itself is encoded on the time-dependent temperature of a thermal bath. We derive an exact expression for the nonlinear response of any fixed readout, and prove a rigorous memory-nonlinearity trade-off which turns out to be a structural necessity, rather than a tunable dynamical regime, since the same coupling that injects data also enforces equilibration. We illustrate both results with a driven qubit, using a single free parameter, and with a pair of coupled qubits, where the breaking of a discrete symmetry opens a fifteen-dimensional space to a single observable, yet that observable alone recovers just over half of it. This refutes the misconception that large Hilbert spaces guarantee computational power. Our results relocate the memory-nonlinearity trade-off from the reservoir's dynamics to its measurement channel, pointing to observable choice and bath engineering (instead of Hamiltonian control) as the physical levers for a thermally-native quantum reservoir computer.

arXiv:2611.07187•Nov 4, 2026•0 citations

Robust Quantum Learning through Hamiltonian Reservoir Computing

Youya Xu, Chengyong Yu, Sanjib Ghosh

Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.

quant-pharXiv:2607.08037•Jul 10, 2026•0 citations

Harnessing complex quantum dynamics for reservoir computing

Guillem Llodrà

[eng] Quantum technologies are rapidly evolving toward regimes where controllable quantum dynamics can be exploited for information processing, simulation, and machine learning. Within this landscape, quantum reservoir computing (QRC) has emerged as an appealing paradigm: it harnesses the high-dimensional dynamics of quantum systems to perform temporal tasks with minimal training overhead, making it particularly well suited for current noisy intermediate-scale quantum devices. In parallel, modern perspectives on quantum many-body systems reveal that tools such as complex-network theory and spectral methods can uncover structures in quantum states and dynamics that remain hidden to conventional approaches. This thesis brings these threads together. It explores how quantum statistics, many-body correlations, chaoticity, and metastability shape information processing in QRC. Furthermore, we have also demonstrated how network-theoretic methods can reveal new features of strongly correlated phases. This thesis contributes to the emerging field of quantum reservoir computing by examining how different physical models shape the learning capabilities of quantum reservoirs. Each article investigates a distinct class of systems: simple hopping networks governed by particle statistics, interacting atomic lattices described by the Bose–Hubbard model, driven-dissipative oscillators exhibiting metastability. Through these diverse settings, a central goal is to identify which physical ingredients enhance the performance of QRC. To address these questions, we combine analytical insights with a broad range of numerical techniques, including exact diagonalization, tensor-network simulations, and open-system dynamics. Together, these approaches provide a unified framework for understanding how quantum dynamics can be exploited for computation. The main findings of the thesis on QRC and complex networks can be summarized as follows. (i) Particle statistics fundamentally shape computational power: fermions exhibit superior information spreading due to their algebra, while bosons can outperform all other substrates when input encoding is optimized. (ii) Metastability constitutes a computational resource: long-lived metastable states enhance memory capacity and allow a fast-injection protocol. (iii) In atomic lattices described by the Bose–Hubbard model, QRC performance is governed by the interplay between interactions and tunneling, with optimal regimes appearing both in the weakly interacting limit and near the onset of quantum chaos; importantly, disorder is not required to achieve high performance. (iv) Complex-network analysis reveals hidden features of the Kitaev chain: network observables sharply detect the topological transition in the Kitaev chain and uncover a previously unnoticed fully connected, perfectly clustered regime linked to ground-state factorization observed in the Ising spin chain.

•Jul 2, 2026•0 citations

Experimental quantum reservoir computing with a circuit-quantum-electrodynamics system

Baptiste Carles, Julien Dudas, Léo Balembois +2 more

Quantum reservoir computing is a machine-learning framework that offers ease of training compared to other quantum neural networks, as it does not rely on gradient-based optimization. Learning is performed in a single step on the output features measured from the quantum system. Various implementations of quantum reservoir computing have been explored in simulations, with different measured features. Although simulations have shown that quantum reservoirs present advantages in performance compared to classical reservoirs, experimental implementations have remained scarce. This is due to the challenge of obtaining a large number of output features that are nonlinear transformations of the input data. In this work, we show that even with a circuit quantum electrodynamics system as simple as a single transmon coupled to a readout resonator, we can implement a proof-of-concept realization of quantum reservoir computing. We obtain a large number of nonlinear features from a single physical system by encoding the input data in the amplitude of a coherent drive and measuring the cavity state in the Fock basis. We demonstrate classification of two classical tasks with significantly smaller hardware resources and fewer measured features compared to classical neural networks. Our experimental results are supported by numerical simulations that show additional Kerr nonlinearity is beneficial to reservoir performance. Our work demonstrates a hardware-efficient quantum neural-network implementation that can be further scaled up and generalized to other quantum machine-learning models.

arXiv:2506.22016•Physical Review Applied•Feb 2, 2026•6 citations
Modeling the response of driven many-body quantum systems from input--output data is difficult: the dynamics are nonlinear, history dependent, and expensive to simulate as system size grows. A paradigmatic case is High-Harmonic Generation~(HHG), where a strong field drives a medium to emit radiation that is highly sensitive to the drive and encodes long-range temporal correlations. We introduce a dissipative quantum reservoir computing~(DQRC) framework that builds a digital twin of such a system, learning its input--output map directly from data while the reservoir---itself a small open quantum system---stays fixed and only a classical readout is trained. We show that a minimal single-qubit reservoir reproduces the HHG response of a substantially larger Ising spin chain, and on a representative benchmark matches and on several metrics surpasses previously reported temporal convolutional and Kolmogorov--Arnold-network models, while using a simpler, physically realizable system. A single fixed reservoir further generalizes across a broad range of drives, indicating that it learns a shared physical response structure rather than memorizing trajectories. These results establish dissipative quantum reservoirs as compact, physically grounded digital twins for nonlinear, memory-dependent quantum dynamics.
Code is available at \href{https://github.com/AI-and-Quantum-Computing/DQuRC}{https://github.com/AI-and-Quantum-Computing/DQuRC}.
The paper studies whether a small driven, dissipative quantum system can serve as a data-trained surrogate for the observable response of a larger driven quantum system, motivated by high-harmonic generation. The target data are numerical trajectories of a ten-spin transverse-field Ising chain under monochromatic drives h(t)=F0sin⁡(ωt)h(t)=F_0\sin(\omega t)h(t)=F0​sin(ωt), with the collective transverse magnetization as output.
The reservoir is a single qubit governed by a driven Lindblad equation with amplitude damping. Its parameters remain fixed while each 512-point input trajectory generates a 512-point reservoir-response vector. These vectors are compressed to 15 principal components and mapped to complete target trajectories using nonlinear radial-basis-function kernel ridge regression. Readout hyperparameters are selected by five-fold cross-validation, and performance is evaluated on held-out trajectories from an 80:20 split.
At fixed amplitude F0=20F_0=20F0​=20, the reported global accuracy reaches R2=0.9997R^2=0.9997R2=0.9997 and normalized MSE 10−510^{-5}10−5 using 3,700 trajectories. Across amplitudes F0∈{1,…,20}F_0\in\{1,\ldots,20\}F0​∈{1,…,20}, a model trained on 3,200 of 4,000 trajectories achieves R2=0.9709R^2=0.9709R2=0.9709; 85.88% of test trajectories exceed per-trajectory R2=0.95R^2=0.95R2=0.95. Comparisons with previously reported Kolmogorov–Arnold networks show comparable or higher threshold pass rates in some settings.
The study is numerical and restricted to sinusoidal drives within sampled frequency–amplitude families, rather than arbitrary waveforms. It explicitly makes no quantum-advantage claim and does not model microscopic HHG processes. A full memory-capacity analysis is deferred; reduced accuracy at low frequencies and high amplitudes is discussed in terms of finite reservoir memory and signal complexity.
Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.
In quantum reservoir computing, a fixed quantum system transforms an input signal, while learning reduces to training a simple linear readout on its measured outputs. Since the quantum dynamics themselves are never optimized, the method is well suited to today's hardware. Yet these dynamics must still be chosen carefully, because their settings remain fixed throughout training and inference. It therefore remains open whether useful dynamics occupy a task-transferable region of control space and whether that region can be found without target-task tuning. We address this question for a dissipative reservoir by mapping performance over three central physical controls: the strength of the input drive, the coupling between neighboring qubits, and the rate of dissipation. Good performance concentrates in a well-defined operating band of this control space. This region transfers across tasks and reservoir initializations, and the same regime persists under an architectural change. It is also mechanistically grounded, since it disappears whenever any of the mechanisms that create it is removed. Finally, the region can be located cheaply before any task is run, using a simple memory diagnostic.
Heat generation limits computation, classical and quantum, from single logic gates to entire data centers. However, an in principle limiting physical factor can sometimes be turned into a resource. In reservoir computing, energy dissipation is what gives a reservoir its fading memory. Here, we introduce a paradigm where the data injection itself is encoded on the time-dependent temperature of a thermal bath. We derive an exact expression for the nonlinear response of any fixed readout, and prove a rigorous memory-nonlinearity trade-off which turns out to be a structural necessity, rather than a tunable dynamical regime, since the same coupling that injects data also enforces equilibration. We illustrate both results with a driven qubit, using a single free parameter, and with a pair of coupled qubits, where the breaking of a discrete symmetry opens a fifteen-dimensional space to a single observable, yet that observable alone recovers just over half of it. This refutes the misconception that large Hilbert spaces guarantee computational power. Our results relocate the memory-nonlinearity trade-off from the reservoir's dynamics to its measurement channel, pointing to observable choice and bath engineering (instead of Hamiltonian control) as the physical levers for a thermally-native quantum reservoir computer.
Quantum learning provides a versatile paradigm for information processing by exploiting the intrinsic representational capacity of high-dimensional Hilbert spaces. Here, we investigate a Hamiltonian-encoding framework for quantum reservoir computing that simultaneously addresses three key challenges in quantum learning: trainability, hardware efficiency, and information stability. In this framework, input data are directly mapped onto a fixed Hamiltonian and transformed into expressive nonlinear features through quantum dynamical evolution. By employing the reservoir-computing paradigm, the approach naturally circumvents the barren plateau problem in quantum learning landscapes. We validate the framework across two complementary platforms: an analog superconducting array processor and a digital gate-based quantum circuit implementation. Despite their fundamentally different realizations, both platforms exhibit comparable representational power and achieve competitive learning performance, establishing a unified framework for cross-platform quantum learning. While both implementations achieve comparable performance, the analog processor may offer a more hardware-efficient realization by bypassing the temporal overhead of gate-based decomposition and thereby making more effective use of finite coherence times, albeit at the expense of universality. Furthermore, we find that finite dissipation suppresses quantum-scrambling-induced instabilities at long evolution times and can enhance learning performance, revealing a constructive role for environmental coupling in stabilizing quantum learning dynamics. Collectively, these results establish Hamiltonian-encoded reservoir computing as a compact, expressive, and hardware-efficient paradigm for quantum learning on current-generation quantum platforms.
[eng] Quantum technologies are rapidly evolving toward regimes where controllable quantum dynamics can be exploited for information processing, simulation, and machine learning. Within this landscape, quantum reservoir computing (QRC) has emerged as an appealing paradigm: it harnesses the high-dimensional dynamics of quantum systems to perform temporal tasks with minimal training overhead, making it particularly well suited for current noisy intermediate-scale quantum devices. In parallel, modern perspectives on quantum many-body systems reveal that tools such as complex-network theory and spectral methods can uncover structures in quantum states and dynamics that remain hidden to conventional approaches. This thesis brings these threads together. It explores how quantum statistics, many-body correlations, chaoticity, and metastability shape information processing in QRC. Furthermore, we have also demonstrated how network-theoretic methods can reveal new features of strongly correlated phases. This thesis contributes to the emerging field of quantum reservoir computing by examining how different physical models shape the learning capabilities of quantum reservoirs. Each article investigates a distinct class of systems: simple hopping networks governed by particle statistics, interacting atomic lattices described by the Bose–Hubbard model, driven-dissipative oscillators exhibiting metastability. Through these diverse settings, a central goal is to identify which physical ingredients enhance the performance of QRC. To address these questions, we combine analytical insights with a broad range of numerical techniques, including exact diagonalization, tensor-network simulations, and open-system dynamics. Together, these approaches provide a unified framework for understanding how quantum dynamics can be exploited for computation. The main findings of the thesis on QRC and complex networks can be summarized as follows. (i) Particle statistics fundamentally shape computational power: fermions exhibit superior information spreading due to their algebra, while bosons can outperform all other substrates when input encoding is optimized. (ii) Metastability constitutes a computational resource: long-lived metastable states enhance memory capacity and allow a fast-injection protocol. (iii) In atomic lattices described by the Bose–Hubbard model, QRC performance is governed by the interplay between interactions and tunneling, with optimal regimes appearing both in the weakly interacting limit and near the onset of quantum chaos; importantly, disorder is not required to achieve high performance. (iv) Complex-network analysis reveals hidden features of the Kitaev chain: network observables sharply detect the topological transition in the Kitaev chain and uncover a previously unnoticed fully connected, perfectly clustered regime linked to ground-state factorization observed in the Ising spin chain.
Quantum reservoir computing is a machine-learning framework that offers ease of training compared to other quantum neural networks, as it does not rely on gradient-based optimization. Learning is performed in a single step on the output features measured from the quantum system. Various implementations of quantum reservoir computing have been explored in simulations, with different measured features. Although simulations have shown that quantum reservoirs present advantages in performance compared to classical reservoirs, experimental implementations have remained scarce. This is due to the challenge of obtaining a large number of output features that are nonlinear transformations of the input data. In this work, we show that even with a circuit quantum electrodynamics system as simple as a single transmon coupled to a readout resonator, we can implement a proof-of-concept realization of quantum reservoir computing. We obtain a large number of nonlinear features from a single physical system by encoding the input data in the amplitude of a coherent drive and measuring the cavity state in the Fock basis. We demonstrate classification of two classical tasks with significantly smaller hardware resources and fewer measured features compared to classical neural networks. Our experimental results are supported by numerical simulations that show additional Kerr nonlinearity is beneficial to reservoir performance. Our work demonstrates a hardware-efficient quantum neural-network implementation that can be further scaled up and generalized to other quantum machine-learning models.