Pith. sign in

REVIEW 24 cited by

Large-scale quantum reservoir learning with an analog quantum computer

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.02553 v1 pith:PPQVE44A submitted 2024-07-02 quant-ph cond-mat.dis-nnphysics.atom-ph

Large-scale quantum reservoir learning with an analog quantum computer

classification quant-ph cond-mat.dis-nnphysics.atom-ph
keywords quantumlearningmachinedatatasksadvantagealgorithmanalog
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 24 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs

    quant-ph 2026-05 unverdicted novelty 7.0

    A tunable partial-SWAP mechanism enables direct control of memory dissipation rates in quantum reservoir networks on gate-based quantum processors.

  2. Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs

    quant-ph 2026-05 unverdicted novelty 7.0

    A hardware-realizable tunable partial-SWAP is introduced to control the rate of memory dissipation in recurrent quantum reservoir computing architectures, validated via simulation and IBM QPUs.

  3. Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach

    quant-ph 2026-02 unverdicted novelty 7.0

    A Pauli-transfer-matrix analysis of QELMs reveals the full set of nonlinear Pauli features generated by encoding and transformed by quantum channels, producing an interpretable classical nonlinear vector autoregressio...

  4. Susceptible Reservoir Architectures for Regime-Conditional Volatility Forecasting

    cs.LG 2026-07 conditional novelty 6.0

    Susceptible reservoir architectures, using open-vs-ring response contrasts and regime-conditioned experts, match GARCH on most assets, beat it on IWM/XLP, and stack with HARQ for a small QLIKE gain.

  5. Leveraging Metrologically Useful States in Quantum Reservoir Networks

    quant-ph 2026-07 conditional novelty 6.0

    A quantum reservoir network using GHZ-state preparation achieves an order-of-magnitude RMSE improvement over prior QRN designs on latent-space prediction of the Kuramoto-Sivashinsky equation.

  6. Temporal processing of quantum states with hybrid quantum-classical reservoirs

    quant-ph 2026-06 unverdicted novelty 6.0

    Hybrid quantum-classical reservoir computing enables nonlinear temporal processing of quantum states and outperforms pure quantum or classical reservoirs in both full-tomography and single-axis measurement regimes.

  7. Analog Quantum Asynchronous Event-Based Graph Neural Network

    quant-ph 2026-06 unverdicted novelty 6.0

    Proposes a hybrid quantum-classical framework for running event-based graph neural networks on neutral-atom processors by mapping events to atoms and programming the Rydberg Hamiltonian to realize message passing.

  8. From Pauli Strings to Quantum Dynamics: A Unified Characterization

    quant-ph 2026-06 unverdicted novelty 6.0

    Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.

  9. Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs

    quant-ph 2026-05 unverdicted novelty 6.0

    Introduces tunable partial-SWAP for controllable memory capacity in quantum reservoir networks, modeled as controlled amplitude-damping and validated via STMC and NARMA-5 benchmarks on simulators and IBM QPUs.

  10. Bridging Krylov Complexity and Universal Analog Quantum Simulator

    quant-ph 2026-05 unverdicted novelty 6.0

    Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.

  11. An architectural capacity ceiling, not a barren plateau: why a fixed-encoding variational quantum circuit cannot fit the Lorenz-63 attractor

    quant-ph 2026-04 conditional novelty 6.0

    A fixed time-encoding, not barren-plateau gradient vanishing, sets a 33-dimensional capacity ceiling (11 accessible Fourier modes per observable) that prevents a four-qubit variational QPINN from fitting Lorenz-63.

  12. Recurrent Quantum Feature Maps for Reservoir Computing

    quant-ph 2026-04 unverdicted novelty 6.0

    Recurrent quantum feature maps achieve lower mean squared error than echo state networks and multilayer perceptrons on Mackey-Glass prediction using compact quantum circuits.

  13. Quantum optical neural networks using atom-cavity interactions to provide all-optical nonlinearity

    quant-ph 2025-11 conditional novelty 6.0

    A simulated neural network uses atom-cavity two-level neurons as all-optical nonlinear activations and reports ~95% accuracy on MNIST and SAT-6.

  14. Multivariate Time Series Forecasting with Gate-Based Quantum Reservoir Computing on NISQ Hardware

    cs.LG 2025-10 conditional novelty 6.0

    A gate-based quantum reservoir computing architecture with injection/memory qubits forecasts multivariate chaotic time series competitively and, on ENSO, hardware noise appears to improve—not degrade—performance.

  15. Harnessing quantum back-action for time-series processing

    quant-ph 2024-11 unverdicted novelty 6.0

    Indirect measurements in quantum reservoir computing improve execution time scaling, overall performance, and memory capacity over projective measurements and classical feedback methods.

  16. Systematic Experiment Tracking in Quantum Software: A Case Study of Reservoir Computing with Error Mitigation

    quant-ph 2026-07 conditional novelty 5.5

    MLflow-style experiment tracking, extended with quantum provenance, supports reproducible multi-stage quantum software pipelines, shown on error-mitigated quantum reservoir computing for chaotic time-series prediction.

  17. An architectural capacity ceiling, not a barren plateau: why a fixed-encoding variational quantum circuit cannot fit the Lorenz-63 attractor

    quant-ph 2026-04 conditional novelty 5.0

    Fixed-reservoir QRC achieves 81% lower test MSE and 52,000x faster training than variational QPINN on Lorenz chaotic prediction with 4-5 qubits.

  18. Quantum reservoir computing in Jaynes-Cummings models: Nonlinear memory and time-series prediction

    quant-ph 2025-09 unverdicted novelty 5.0

    Jaynes-Cummings qubit-boson systems show superior nonlinear memory capacity and comparable Mackey-Glass forecasting performance when used as quantum reservoirs.

  19. Quantum Observers: A NISQ Hardware Demonstration of Chaotic State Prediction Using Quantum Echo-state Networks

    quant-ph 2025-05 conditional novelty 5.0

    A quantum echo-state network is implemented on NISQ superconducting qubits and shown to predict long chaotic trajectories from the Lorenz system with memory persisting over 100 times the median T1/T2 time.

  20. Quantum Reservoir Computing: Recent Advances and Future Directions

    quant-ph 2026-07 accept novelty 4.0

    A comprehensive survey of quantum reservoir computing that proposes a common system model, a memory-architecture taxonomy, and resource-accounting standards, concluding that no broad quantum advantage is currently dem...

  21. Machine learning development for quantum computing and neutrino physics

    quant-ph 2026-07 conditional novelty 4.0

    QELM classifiers plateau at accuracy matching random quantum circuits via local, classically simulable entanglement, while a timing-aware ResNet-18 distinguishes single-vertex from pile-up Hyper-K IWCD events at near-...

  22. Off-line quantum-advantage feature extraction for industrial production

    quant-ph 2026-05 unverdicted novelty 4.0

    Quantum feature surrogates let a quantum processor act as a teacher on a small data subsample while a classical surrogate applies the learned representations to the entire industrial dataset.

  23. Digital Quantum Reservoir Computing for ATM Time Series Prediction

    quant-ph 2026-06 unverdicted novelty 3.0

    A parametrized four-qubit digital QRC model with ridge-regression readout matches the classical Prophet benchmark on dynamic time warping for ATM cash-demand forecasting but underperforms on MAE and NMSE across noisel...

  24. Harnessing Quantum Dynamics for Robust and Scalable Quantum Extreme Learning Machines

    quant-ph 2025-03 unverdicted novelty 3.0

    TDVP-MPS simulations of Rydberg atom chains mitigate exponential concentration in QELM, yielding competitive MNIST accuracy via controlled entanglement and disorder without requiring exact quantum dynamics.