Diagnosing quantum reservoirs at scale based on expressivity and coverage

• URL: http://arxiv.org/abs/2607.09445v1
• Date: Fri, 10 Jul 2026 14:16:13 GMT
• Title: Diagnosing quantum reservoirs at scale based on expressivity and coverage
• Abstract summary: Quantum reservoirs offer a hardware-friendly route to quantum machine learning.<n>Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family.<n>We introduce a scalable, hardware-agnostic framework built on two complementary quantities.
• Score: 42.13843953705695
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum reservoirs offer a hardware-friendly route to quantum machine learning, replacing trainable circuits with fixed random dynamics and a classical readout. Because the reservoir is not optimized, performance depends entirely on the choice of reservoir family, yet existing diagnostics demand resources that grow exponentially with system size. We introduce a scalable, hardware-agnostic framework built on two complementary quantities. The first is a task-independent order-statistics (ORS) expressivity score, which compares only the largest output probabilities of a reservoir ensemble against an analytical Haar baseline. It never reconstructs the full output distribution, is cost-independent of Hilbert-space dimension, and admits a closed-form depolarizing noise correction, making it directly usable on hardware. The second is the task-dependent effective rank $R_{\mathrm{eff}}$ of the feature matrix, which measures how much input-dependent information reaches the readout. We validate the ORS score against established complexity diagnostics and confirm it remains informative under simulated noise and on IBM quantum hardware. Across synthetic and real quantum extreme learning machine and quantum reservoir computing benchmarks, ORS captures the intrinsic expressivity hierarchy of reservoir families while $R_{\mathrm{eff}}$ determines when that expressivity becomes usable predictive information.

Related papers

• Task-Dependent Syndrome Memory in Quantum Sensing and State Recovery [0.0]
  finite detectors and memories impose an unavoidable limit on how finely noise trajectories can be resolved.<n>Using exact symmetric-logarithmic-derivative geometry, we determine when a monitored trajectory can be compressed without losing quantum Fisher information.<n>These results establish syndrome information as a task- and timing-dependent resource connecting quantum sensing, statistical sufficiency, and quantum error correction.
  arXiv  Detail & Related papers  (2026-08-03T14:53:35Z)
• Quantum Reservoir Computing: Recent Advances and Future Directions [34.77938621771246]
  Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features.<n>Its computational power is often attributed to the exponentially large Hilbert space of the quantum system.<n>On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables.
  arXiv  Detail & Related papers  (2026-07-20T22:38:49Z)
• Temporal processing of quantum states with hybrid quantum-classical reservoirs [0.5161531917413708]
  A quantum-classical hybrid architecture combines a qubit quantum reservoir with a classical echo state network (ESN)<n>We show that the hybrid system outperforms its standalone components in both linear and nonlinear tasks.<n>These results establish hybrid quantum-classical reservoir computing as a practical and scalable route for enhanced quantum machine learning on near-term qubit hardware.
  arXiv  Detail & Related papers  (2026-06-19T11:14:13Z)
• Neural Information Causality [0.0]
  We develop a framework called neural information causality (Neural-IC)<n>We show that Neural-IC is an operational diagnostic for query leakage, precision leakage, and episode-specific memory.<n>We also provide an exact one-bit classical RAC benchmark, showing explicitly that the relevant quantum enhancement is not total information beyond the bottleneck.
  arXiv  Detail & Related papers  (2026-05-10T04:25:11Z)
• Quantum Injection Pathways for Implicit Graph Neural Networks [0.8826339811274068]
  Deep Equilibrium Models replace a stack of explicit layers with a single operator whose fixed point defines the output.<n>textitIndependent injection computes the quantum signal once per graph and forward fixed-point solve, and holds it fixed throughout the solve.<n>textitState-dependent injection instead recomputes the signal at every solver step and applies it to the current iteration.<n>textitBackbone-dependent injection likewise recomputes at every but applies the signal to the classical backbone's output evaluated at the current iteration.
  arXiv  Detail & Related papers  (2026-05-09T23:51:46Z)
• Optimal quantum learning in proximity to universality [0.0]
  boundary between classically simulable and computationally superior quantum systems is fundamental to identifying true quantum advantage.<n>We introduce a tunable $N$-qubit random circuit model, where a fraction $p$ of Clifford gates are probabilistically substituted with nonstabilizing conditional-$hatT$ gates.<n>We establish a direct correspondence between the reservoir's performance on temporal processing tasks and its entanglement spectrum statistics and long-range nonstabilizer resource content.
  arXiv  Detail & Related papers  (2025-10-21T13:27:41Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.