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

Temporal information processing on a 4,500-qubit quantum annealer

Antonio Sannia, Roberto Menta, Pratik Sathe, Dario De Santis, Vittorio Giovannetti, Luis Pedro García-Pintos, Davide Venturelli, Gian Luca Giorgi, Roberta Zambrini, Francesco Caravelli

quant-phSubmitted Sep 16, 2026• Announced Sep 18, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum machine learning could uncover statistical structure beyond the reach of classical models, but this requires quantum models large and expressive enough to be useful and cheap enough to read out. Most approaches optimize many quantum parameters and are thus limited by expensive training loops. Here we report a quantum machine-learning model implemented on a programmable superconducting quantum annealer that processes temporal data at large scale using up to 4,500 qubits-the largest quantum machine-learning experiment performed to date. Following the quantum reservoir computing paradigm, the untrained native many-body dynamics generated by reverse annealing is directly used to process temporal data. We prove that the interactions produced during annealing are indispensable-a non-interacting reservoir retains no memory of its input. We evaluate our model experimentally on standard memory benchmarks and demonstrate that it can successfully forecast chaotic time series. These results establish quantum annealers as a scalable platform for large-scale quantum machine learning.

AI Summary

The paper investigates whether native quantum-annealer dynamics can support reservoir computing for temporal data without training quantum parameters. It implements a hybrid recurrent model on a D-Wave Advantage2 processor using up to $4{,}500$ physical qubits. Inputs set randomly masked longitudinal fields; thresholded classical reservoir variables initialize each reverse-annealing cycle. Measured magnetizations update the classical state, with explicit delayed feedback providing an additional memory channel. Only a linear readout is trained. Experiments use $K=45$ coarse-grained reservoir variables, $M=1{,}000$ shots per update, and 500 training plus 500 test points. The reverse-annealing cycle lasts $2\,\mu\mathrm{s}$, including a $1\,\mu\mathrm{s}$ pause. Linear-memory benchmarks show delayed-feedback-induced revivals and improved capacity with increasing physical-qubit count. Two-input XOR classification reaches $0.989\pm0.008$ accuracy across five realizations. The model also forecasts Mackey–Glass and double-scroll time series, including longer-horizon predictions, with lower normalized mean-square error than a two-lag linear autoregressive baseline. Setting interactions to zero experimentally removes useful memory; an analytical argument attributes this to a trade-off between threshold-branch persistence and echo-state convergence. Spin-vector Monte Carlo does not reproduce the measured memory performance, while five-qubit ideal coherent simulations show negligible memory. The paper explicitly does not establish classical intractability or quantum advantage. It notes that increasing qubit count also reduces readout noise through larger averaging groups, and that dissipation and thermal dynamics may contribute substantially; the small coherent simulations are not faithful models of the large device.

Little sign of AI-generated textOverclaimsMissing comparisonPossible error

Central claim may not hold: The advertised proof that noninteracting reservoirs cannot retain input memory analyzes independent two-branch feedback maps instead of the implemented shared-group feedback and incorrectly treats one-step branch merging as necessary for asymptotic synchronization. The reservoir-size comparison changes the number of qubits averaged and thresholded per feature alongside system size, so it does not establish that large quantum-system dimension itself is necessary for the observed memory.

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

Comments
Comments are welcome

Related papers

High-Accuracy Temporal Prediction via Experimental Quantum Reservoir Computing in Correlated Spins

Yanjun Hou, Juncheng Hua, Ze Wu +6 more

Physical reservoir computing provides a powerful machine learning paradigm that exploits nonlinear physical dynamics for efficient information processing. By incorporating quantum effects, quantum reservoir computing offers superior potential for machine learning applications, as quantum dynamics are exponentially costly to simulate classically. Here, we present a novel quantum reservoir computing approach based on correlated quantum spin systems, exploiting natural quantum many-body interactions to generate reservoir dynamics, thereby circumventing the practical challenges of deep quantum circuits. Our experimental implementation supports nontrivial quantum entanglement and exhibits sufficient dynamical complexity for high-performance machine learning. We achieve state-of-the-art performance in experiments on standard time-series benchmarks, reducing prediction error by 1 to 2 orders of magnitude compared to previous quantum reservoir experiments. In long-term weather forecasting, our 9-spin quantum reservoir delivers greater prediction accuracy than classical reservoirs with thousands of nodes. This represents the first experimental demonstration of quantum machine learning outperforming large-scale classical models on real-world tasks.

arXiv:2508.12383•Physical Review Letters•Feb 24, 2026•11 citations

Quantum neuroplastic learning for time-series processing

Mostafizur Rahaman Laskar

Quantum machine learning uses quantum states and dynamics to represent and process data. In quantum reservoir computing, the physical system is typically fixed and a classical readout is trained. Inspired by the formation, strengthening and pruning of synapses during biological learning, we propose quantum neuroplastic learning (QNL), which reorganizes the couplings among the qubits of a quantum reservoir, much as experience rewires connections among neurons. Eligibility traces guide local edits to couplings, fields, gate angles and evolution time, and an edit is retained when a statistical bound on its improvement exceeds a complexity cost. We evaluate QNL under restarting and online monitored protocols on short- and long-term memory, nonlinear autoregressive processing and forecasting, and channel equalization tasks. In simulation, QNL enhances memory capacity, develops long-term recall and sustains adaptation across multiple tasks, with the largest benefit for tasks that require extended memory. On the IBM superconducting processor \texttt{ibm\_fez}, with six seven-qubit reservoirs running in parallel on 42 qubits (1.28 million shots in total), configurations learned in simulation and frozen before execution reduced the channel-equalization symbol error rate from 9.7\% to 2.2\% and achieved a lower error rate than a matched-budget tuned baseline.

quant-pharXiv:2610.34055•Oct 27, 2026•0 citations

Large-scale quantum reservoir learning with an analog quantum computer

Milan Kornjača, Hong-Ye Hu, Chen Zhao +50 more

Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.

arXiv:2407.02553•Jul 2, 2024•106 citations

Breaking concentration barriers for quantum extreme learning on digital quantum processors

Timothée Dao, Ege Yilmaz, Ibrahim Shehzad +8 more

Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.

quant-pharXiv:2603.13005•Mar 16, 2026•5 citations

Quantum reservoir computing for predicting and characterizing chaotic maps

Qingyu Li, Chiranjib Mukhopadhyay, Ludovico Minati +1 more

Quantum reservoir computing has emerged as a promising paradigm for harnessing quantum systems to process temporal data efficiently by bypassing the costly training of gradient-based learning methods. Here, we demonstrate the capability of this approach to predict and characterize chaotic dynamics in discrete nonlinear maps, exemplified through the logistic and Hénon maps. While achieving excellent predictive accuracy, we also demonstrate the optimization of training hyperparameters of the quantum reservoir based on the properties of the underlying map, thus paving the way for efficient forecasting with other discrete and continuous time-series data. Using closed-loop prediction of distant future steps, our protocol discriminates between chaotic and nonchaotic phases without prior knowledge of the underlying map or the nature of the time series. Furthermore, the framework exhibits robustness against decoherence when trained and shows insensitivity to reservoir Hamiltonian variations as well as robustness to finite-sampling error. These results highlight quantum reservoir computing as a scalable and noise-resilient tool for modeling complex dynamical systems, with immediate applicability in near-term quantum hardware.

arXiv:2509.12071•Physical Review Research•Feb 17, 2026•3 citations

Scalable Quantum Machine Learning Framework

Jincheng Zhang

This paper addresses the critical limitations of existing quantum machine learning (QML) frameworks concerning scalability, specifically their inability to efficiently handle large-scale quantum datasets. We propose a novel, scalable QML framework designed to effectively process these datasets and accelerate the training and inference of quantum machine learning algorithms. The core mechanism leverages quantum parallelism, constructing a framework capable of handling increased complexity. This work represents a significant advancement by directly tackling the scalability bottleneck in QML, establishing a foundational element for future developments in the field. The framework utilizes a modular architecture incorporating optimized quantum circuits and classical processing units for data preparation, model training, and result evaluation. The key innovation lies in the dynamic partitioning of quantum computations across multiple quantum processors, coupled with sophisticated data encoding strategies to mitigate the effects of qubit decoherence and limited qubit counts. This approach allows for the parallel execution of complex quantum algorithms, drastically reducing computational overhead and enabling the training of larger and more sophisticated models. We demonstrate the potential of this framework through theoretical analysis and algorithmic design, highlighting its advantages over traditional, monolithic QML implementations.

•Sep 5, 2026•0 citations
Quantum machine learning could uncover statistical structure beyond the reach of classical models, but this requires quantum models large and expressive enough to be useful and cheap enough to read out. Most approaches optimize many quantum parameters and are thus limited by expensive training loops. Here we report a quantum machine-learning model implemented on a programmable superconducting quantum annealer that processes temporal data at large scale using up to 4,500 qubits-the largest quantum machine-learning experiment performed to date. Following the quantum reservoir computing paradigm, the untrained native many-body dynamics generated by reverse annealing is directly used to process temporal data. We prove that the interactions produced during annealing are indispensable-a non-interacting reservoir retains no memory of its input. We evaluate our model experimentally on standard memory benchmarks and demonstrate that it can successfully forecast chaotic time series. These results establish quantum annealers as a scalable platform for large-scale quantum machine learning.
The paper investigates whether native quantum-annealer dynamics can support reservoir computing for temporal data without training quantum parameters. It implements a hybrid recurrent model on a D-Wave Advantage2 processor using up to 4,5004{,}5004,500 physical qubits. Inputs set randomly masked longitudinal fields; thresholded classical reservoir variables initialize each reverse-annealing cycle. Measured magnetizations update the classical state, with explicit delayed feedback providing an additional memory channel. Only a linear readout is trained.
Experiments use K=45K=45K=45 coarse-grained reservoir variables, M=1,000M=1{,}000M=1,000 shots per update, and 500 training plus 500 test points. The reverse-annealing cycle lasts 2 μs2\,\mu\mathrm{s}2μs, including a 1 μs1\,\mu\mathrm{s}1μs pause. Linear-memory benchmarks show delayed-feedback-induced revivals and improved capacity with increasing physical-qubit count. Two-input XOR classification reaches 0.989±0.0080.989\pm0.0080.989±0.008 accuracy across five realizations. The model also forecasts Mackey–Glass and double-scroll time series, including longer-horizon predictions, with lower normalized mean-square error than a two-lag linear autoregressive baseline.
Setting interactions to zero experimentally removes useful memory; an analytical argument attributes this to a trade-off between threshold-branch persistence and echo-state convergence. Spin-vector Monte Carlo does not reproduce the measured memory performance, while five-qubit ideal coherent simulations show negligible memory. The paper explicitly does not establish classical intractability or quantum advantage. It notes that increasing qubit count also reduces readout noise through larger averaging groups, and that dissipation and thermal dynamics may contribute substantially; the small coherent simulations are not faithful models of the large device.
Physical reservoir computing provides a powerful machine learning paradigm that exploits nonlinear physical dynamics for efficient information processing. By incorporating quantum effects, quantum reservoir computing offers superior potential for machine learning applications, as quantum dynamics are exponentially costly to simulate classically. Here, we present a novel quantum reservoir computing approach based on correlated quantum spin systems, exploiting natural quantum many-body interactions to generate reservoir dynamics, thereby circumventing the practical challenges of deep quantum circuits. Our experimental implementation supports nontrivial quantum entanglement and exhibits sufficient dynamical complexity for high-performance machine learning. We achieve state-of-the-art performance in experiments on standard time-series benchmarks, reducing prediction error by 1 to 2 orders of magnitude compared to previous quantum reservoir experiments. In long-term weather forecasting, our 9-spin quantum reservoir delivers greater prediction accuracy than classical reservoirs with thousands of nodes. This represents the first experimental demonstration of quantum machine learning outperforming large-scale classical models on real-world tasks.
Quantum machine learning uses quantum states and dynamics to represent and process data. In quantum reservoir computing, the physical system is typically fixed and a classical readout is trained. Inspired by the formation, strengthening and pruning of synapses during biological learning, we propose quantum neuroplastic learning (QNL), which reorganizes the couplings among the qubits of a quantum reservoir, much as experience rewires connections among neurons. Eligibility traces guide local edits to couplings, fields, gate angles and evolution time, and an edit is retained when a statistical bound on its improvement exceeds a complexity cost. We evaluate QNL under restarting and online monitored protocols on short- and long-term memory, nonlinear autoregressive processing and forecasting, and channel equalization tasks. In simulation, QNL enhances memory capacity, develops long-term recall and sustains adaptation across multiple tasks, with the largest benefit for tasks that require extended memory. On the IBM superconducting processor \texttt{ibm\_fez}, with six seven-qubit reservoirs running in parallel on 42 qubits (1.28 million shots in total), configurations learned in simulation and frozen before execution reduced the channel-equalization symbol error rate from 9.7\% to 2.2\% and achieved a lower error rate than a matched-budget tuned baseline.
Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant resources for variational parameter optimization and face issues with vanishing gradients, leading to experiments that are either limited in scale or lack potential for quantum advantage. To address this, we develop a general-purpose, gradient-free, and scalable quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data. We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks, including binary and multi-class classification, as well as timeseries prediction. Effective and improving learning is observed with increasing system sizes of up to 108 qubits, demonstrating the largest quantum machine learning experiment to date. We further observe comparative quantum kernel advantage in learning tasks by constructing synthetic datasets based on the geometric differences between generated quantum and classical data kernels. Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning. We expect these results to stimulate further extensions to different quantum hardware and machine learning paradigms, including early fault-tolerant hardware and generative machine learning tasks.
Reservoir computing leverages rich, non-linear dynamics to process temporal data. Quantum variants promise enhanced expressivity from high-dimensional Hilbert spaces, yet their practical applicability is hindered by hardware noise and concentration effects that can erase input-output distinguishability at large system sizes. In this work, we present and experimentally demonstrate a Quantum Extreme Learning Machine (QELM) tailored to state-of-the-art superconducting platforms, employing up to 124 qubits and circuits with more than 5,000 two-qubit gates on IBM Quantum computers. We introduce a practical multi-objective hyperparameter tuning strategy that jointly monitors observable variability, capacity, and task performance to identify noise-robust operating points. In addition, we develop a local eigentask analysis that enables computationally efficient feature selection and effective information retrieval. We report evidence of a regime of optimality that is identifiable at small scales and transferable across tasks and larger systems, and we achieve performances competitive with leading classical baselines on representative benchmarks for time-series forecasting and satellite image classification. Together, our results establish a viable and robust framework for large-scale, pre-fault-tolerant quantum machine learning and provide a foundation for extending reservoir-based methods to more expressive architectures and real-world scenarios.
Quantum reservoir computing has emerged as a promising paradigm for harnessing quantum systems to process temporal data efficiently by bypassing the costly training of gradient-based learning methods. Here, we demonstrate the capability of this approach to predict and characterize chaotic dynamics in discrete nonlinear maps, exemplified through the logistic and Hénon maps. While achieving excellent predictive accuracy, we also demonstrate the optimization of training hyperparameters of the quantum reservoir based on the properties of the underlying map, thus paving the way for efficient forecasting with other discrete and continuous time-series data. Using closed-loop prediction of distant future steps, our protocol discriminates between chaotic and nonchaotic phases without prior knowledge of the underlying map or the nature of the time series. Furthermore, the framework exhibits robustness against decoherence when trained and shows insensitivity to reservoir Hamiltonian variations as well as robustness to finite-sampling error. These results highlight quantum reservoir computing as a scalable and noise-resilient tool for modeling complex dynamical systems, with immediate applicability in near-term quantum hardware.
This paper addresses the critical limitations of existing quantum machine learning (QML) frameworks concerning scalability, specifically their inability to efficiently handle large-scale quantum datasets. We propose a novel, scalable QML framework designed to effectively process these datasets and accelerate the training and inference of quantum machine learning algorithms. The core mechanism leverages quantum parallelism, constructing a framework capable of handling increased complexity. This work represents a significant advancement by directly tackling the scalability bottleneck in QML, establishing a foundational element for future developments in the field. The framework utilizes a modular architecture incorporating optimized quantum circuits and classical processing units for data preparation, model training, and result evaluation. The key innovation lies in the dynamic partitioning of quantum computations across multiple quantum processors, coupled with sophisticated data encoding strategies to mitigate the effects of qubit decoherence and limited qubit counts. This approach allows for the parallel execution of complex quantum algorithms, drastically reducing computational overhead and enabling the training of larger and more sophisticated models. We demonstrate the potential of this framework through theoretical analysis and algorithmic design, highlighting its advantages over traditional, monolithic QML implementations.