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

Quantum-Fisher-information-aware optimization yields a quantum reservoir advantage over tuned classical reservoirs

Phi Hung Nguyen, Daniel Soh

quant-phSubmitted Oct 10, 2026• Announced Oct 13, 2026• 1 citation
arXivHTMLPDF

Abstract

We show that a quantum reservoir computer optimized with its quantum Fisher information (QFI) has a quantum advantage over a classical reservoir of equal readout cost, provided by a quantum-information advantage: optimizing the quantum parameters with the QFI metric. On Mackey-Glass forecasting, a driven Jaynes-Cummings reservoir with one to three atoms beats a tuned echo-state network at every size from 4 to 30 trained weights, by 25-69% in held-out error, and is ahead of 99.5% of 10,000 random networks. After grid and Bayesian searches saturate, the QFI-aware stage lowers the error by 29-51% at 12-30 weights, beyond equal-budget black-box search or classical-parameter gradients alone, and at 30 weights turns a loss into a win. We then derive a fundamental QFI bound on the first-order rate of change of the retrained loss and factorize the gap to this bound into five link efficiencies that identify the physical mechanism limiting optimization.

AI Summary

The paper asks how quantum-state sensitivity translates into improvement of a reservoir computer when its linear readout is retrained, and whether QFI-informed optimization improves forecasting relative to a tuned classical reservoir. For least-squares loss, it derives $D_v\mathcal L=-r^T X_vw^*$ and bounds the normalized slope by a feature-weighted QFI budget: $|D_v\mathcal L|/(\|r\|\|w^*\|)\le\sqrt{v^TG_Qv}$. The gap factorizes exactly into five efficiencies describing measurement, observable response, readout utilization, novelty outside the current feature span, and residual alignment. The optimal first-order decrease within one QFI unit is $\sqrt{g^TG_Q^+g}$. Small Jaynes–Cummings and four-spin Ising simulations test the chain and interventions informed by its factors. On five-step Mackey–Glass forecasting, simulated one-to-three-atom reservoirs with 4–30 readout weights obtain 25–69% lower held-out NRMSE than equal-readout-size echo-state networks, whose hyperparameters are tuned and performance evaluated over 10,000 random realizations. After grid and Bayesian search, a stage alternating QFI natural-gradient updates with classical-parameter optimization reduces held-out error by 29–51% at 12–30 weights; comparisons include continued black-box search and classical-parameter-only gradients. The comparison matches readout count, not total optimization freedom: all quantum-device parameters are optimized, while classical recurrent matrices remain random. Results use expectation values; retaining the reported margin requires estimated $7\times10^6$–$2\times10^{10}$ shots per feature per sample. QFI-based design requires density matrices, the theory is local and fixed-rank, and its bound is loose by two to six orders of magnitude. Link diagnostics do not predict finite-step improvement reliably.

Little sign of AI-generated textAI use disclosedOverclaimsMissing comparisonSmall numerics onlyStrong assumptions
A large language model (Claude, Anthropic) was used to assist with developing and reviewing analysis code

Central claim may not hold: The claimed attribution to the QFI metric is not isolated because the gradient control freezes the quantum parameters, leaving untested whether ordinary gradient-based optimization of the same parameters achieves the reported gains. At m=24 and m=30, the black-box baselines inherit controls or starting points from earlier natural-gradient optimization, so they do not independently establish that loss-only search cannot reach the reported designs.

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

Related papers

Resource map of quantum reservoir computing against tuned classical baselines

Hikaru Wakaura

Abstract Quantum reservoir computing promises an exponentially large feature map at no training cost, but reported advantages rest on classical baselines of unmatched size or tuning, on exact expectation values, or on resource counts that omit measurement. Here we introduce a benchmark protocol that charges shots, experiment restarts and readout size together and apply it to 3451 exactly simulated cells (57 quantum reservoirs, 49 tasks) against three tuned classical reservoir families. No classical- or quantum-input task yields a win in both accuracy and resource scaling; the only winning cells are Forrelation estimators on oracle pairs drawn fresh at every step with no exposed structure, which beat every implemented classical estimator in every seed from field sizes of 16 thousand, with a matching classical query budget growing as the square root of the field size. Few-photon Kerr dynamics beats its mean-field twin only until the twin is tuned, spin readouts pay up to three orders of magnitude in shot noise where quadrature readouts pay threefold, and every structured oracle family falls to a classical shortcut. Quantum reservoir advantage therefore lives in the input access model, not in the reservoir; we give the superconducting-circuit parameters at which the protocol can be run.

•Nov 2, 2026•0 citations

When Classical Baselines Are Tuned as Carefully as the Quantum Model, Does Quantum Reservoir Computing Still Win?

Tushar Pandey

Can a small quantum computer forecast a changing signal better than an ordinary classical method? Many studies say yes, but the classical methods they compare against are often left in a basic, untuned state while the quantum model is carefully optimised. We ask what happens when the classical competitor is given exactly the same care: the same size and the same amount of tuning effort. We study two popular reasons a quantum reservoir is thought to help, using exact simulations of small quantum systems (up to eleven qubits) on prediction tasks. In both cases the quantum advantage disappears once the comparison is fair. In the first, extra quantum measurements add nothing that a simple classical formula of the same size does not already provide. In the second, a feedback loop genuinely helps the quantum model, turning a useless setup into a working predictor, yet a well-tuned classical network still predicts slightly more accurately, and the gap is statistically reliable. Our point is not that quantum reservoirs can never win, but that two of their commonly cited advantages do not hold up against fair classical competitors at this scale. We provide these matched comparisons as a simple, reusable checklist for honest benchmarking. All results are fully reproducible from fixed random seeds.

quant-pharXiv:2607.09905•Jul 14, 2026•2 citations

Task-Resolved Fisher Spectroscopy for Quantum Reservoir Computing

Yang Peng

Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order $r$. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.

quant-pharXiv:2609.29570•Aug 28, 2026•0 citations

QFI‐Opt: Communication‐Efficient Quantum Federated Learning via Quantum Fisher Information

Rui Zhang, Yueheng Wang, X. G. He +5 more

ABSTRACT Background Quantum federated learning presents a promising paradigm for privacy‐preserving collaborative training across distributed quantum devices. However, its scalability is hindered by the significant communication overhead associated with transmitting high‐dimensional, high‐precision quantum model parameters over classical networks. Methods To address this bottleneck, this paper proposes QFI‐Opt (Quantum Fisher Information‐guided Adaptive Optimization), a quantum adaptive communication optimization framework based on Quantum Fisher Information. QFI‐Opt establishes a “sensing‐compression‐regulation” pipeline that achieves communication efficiency while preserving quantum model fidelity. The framework uses QFI as a physically interpretable metric to dynamically assess quantum state sensitivity to parameter perturbations, enabling a progressive pruning strategy that removes low‐sensitivity parameters during training while retaining critical quantum features. Additionally, a dynamic bit‐width quantization mechanism adapts precision based on parameter importance, maximizing compression without compromising numerical stability. This is further complemented by a physics‐aware aggregation method that weighs client updates based on both local data volume and quantum information quality derived from QFI scores, improving global model robustness. Results Extensive evaluation on quantum convolutional neural networks demonstrates that QFI‐Opt significantly reduces per‐round communication overhead compared to baseline methods. Conclusions Simultaneously, the proposed framework maintains competitive model accuracy and convergence performance across diverse quantum architectures.

Software Practice and Experience•Dec 21, 2025•3 citations

Hidden Fisher Information in Many-Body Quantum Sensors

Atta ur Rahman, Muhammad Noman, Samira Elghaayda +1 more

Quantum Fisher information (QFI) determines the ultimate precision of a quantum sensor after optimization over all allowed measurements, but it does not quantify how difficult the optimal readout is to implement. We introduce a moment Fisher hierarchy $F_M^{(k)}$, which measures the fraction of QFI accessible to collective spin moments up to degree $k$, together with a readout-complexity scale $k_{90}$ defined by the minimum degree required to recover $90\%$ of the QFI. Applying this framework to a nonlinear collective-spin sensor, we show that many-body dynamics can preserve large QFI while transferring the optimal readout into high-rank $SU(2)$ tensor sectors inaccessible to low-order collective observables. For system sizes up to $N=100$, first moments access only $\sim 10^{-2}$ of the available QFI, while the degree required to recover $90\%$ of it grows to $k_{90}\simeq 28$. A rank-resolved analysis of the symmetric logarithmic derivative (SLD) under weak damping shows that the nonlinear protocol pushes the optimal readout toward the highest available tensor ranks while strongly depleting its low-rank weight. These results identify nonlinear tangent-space shear as the mechanism behind a finite-size readout-complexity bottleneck in many-body quantum metrology.

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

Quantum Fisher Information Beyond Theory: A Paradigm Shift Towards Measurable Quantum Advantage in NISQ-Era Sensing

Volkan Erol

Quantum Fisher information (QFI) stands at a critical inflection point: transitioning from a theoretical bound to a measurable diagnostic that enables unprecedented sensing capabilities in noisy intermediate-scale quantum (NISQ) devices. Here, we present a paradigm shift where QFI becomes both the metric and mechanism for achieving practical quantum advantage. We introduce three transformative concepts: (i) noise-engineered QFI that exploits environmental correlations rather than fighting them, (ii) adaptive multiparameter sensing using real-time QFI feedback, and (iii) hybrid classical-quantum estimation that scales QFI extraction to thousands of qubits. Through quantitative analysis of emerging platforms, we demonstrate that current experiments are achieving 2-10× classical performance bounds, with a clear pathway to 100× advantage by 2030. This perspective reframes QFI from a passive bound to an active design principle, establishing sensing as quantum computing's first scalable application.

•Sep 29, 2025•0 citations
We show that a quantum reservoir computer optimized with its quantum Fisher information (QFI) has a quantum advantage over a classical reservoir of equal readout cost, provided by a quantum-information advantage: optimizing the quantum parameters with the QFI metric. On Mackey-Glass forecasting, a driven Jaynes-Cummings reservoir with one to three atoms beats a tuned echo-state network at every size from 4 to 30 trained weights, by 25-69% in held-out error, and is ahead of 99.5% of 10,000 random networks. After grid and Bayesian searches saturate, the QFI-aware stage lowers the error by 29-51% at 12-30 weights, beyond equal-budget black-box search or classical-parameter gradients alone, and at 30 weights turns a loss into a win. We then derive a fundamental QFI bound on the first-order rate of change of the retrained loss and factorize the gap to this bound into five link efficiencies that identify the physical mechanism limiting optimization.
The paper asks how quantum-state sensitivity translates into improvement of a reservoir computer when its linear readout is retrained, and whether QFI-informed optimization improves forecasting relative to a tuned classical reservoir.
For least-squares loss, it derives DvL=−rTXvw∗D_v\mathcal L=-r^T X_vw^*Dv​L=−rTXv​w∗ and bounds the normalized slope by a feature-weighted QFI budget: ∣DvL∣/(∥r∥∥w∗∥)≤vTGQv|D_v\mathcal L|/(\|r\|\|w^*\|)\le\sqrt{v^TG_Qv}∣Dv​L∣/(∥r∥∥w∗∥)≤vTGQ​v​. The gap factorizes exactly into five efficiencies describing measurement, observable response, readout utilization, novelty outside the current feature span, and residual alignment. The optimal first-order decrease within one QFI unit is gTGQ+g\sqrt{g^TG_Q^+g}gTGQ+​g​. Small Jaynes–Cummings and four-spin Ising simulations test the chain and interventions informed by its factors.
On five-step Mackey–Glass forecasting, simulated one-to-three-atom reservoirs with 4–30 readout weights obtain 25–69% lower held-out NRMSE than equal-readout-size echo-state networks, whose hyperparameters are tuned and performance evaluated over 10,000 random realizations. After grid and Bayesian search, a stage alternating QFI natural-gradient updates with classical-parameter optimization reduces held-out error by 29–51% at 12–30 weights; comparisons include continued black-box search and classical-parameter-only gradients.
The comparison matches readout count, not total optimization freedom: all quantum-device parameters are optimized, while classical recurrent matrices remain random. Results use expectation values; retaining the reported margin requires estimated 7×1067\times10^67×106–2×10102\times10^{10}2×1010 shots per feature per sample. QFI-based design requires density matrices, the theory is local and fixed-rank, and its bound is loose by two to six orders of magnitude. Link diagnostics do not predict finite-step improvement reliably.
Abstract Quantum reservoir computing promises an exponentially large feature map at no training cost, but reported advantages rest on classical baselines of unmatched size or tuning, on exact expectation values, or on resource counts that omit measurement. Here we introduce a benchmark protocol that charges shots, experiment restarts and readout size together and apply it to 3451 exactly simulated cells (57 quantum reservoirs, 49 tasks) against three tuned classical reservoir families. No classical- or quantum-input task yields a win in both accuracy and resource scaling; the only winning cells are Forrelation estimators on oracle pairs drawn fresh at every step with no exposed structure, which beat every implemented classical estimator in every seed from field sizes of 16 thousand, with a matching classical query budget growing as the square root of the field size. Few-photon Kerr dynamics beats its mean-field twin only until the twin is tuned, spin readouts pay up to three orders of magnitude in shot noise where quadrature readouts pay threefold, and every structured oracle family falls to a classical shortcut. Quantum reservoir advantage therefore lives in the input access model, not in the reservoir; we give the superconducting-circuit parameters at which the protocol can be run.
Can a small quantum computer forecast a changing signal better than an ordinary classical method? Many studies say yes, but the classical methods they compare against are often left in a basic, untuned state while the quantum model is carefully optimised. We ask what happens when the classical competitor is given exactly the same care: the same size and the same amount of tuning effort. We study two popular reasons a quantum reservoir is thought to help, using exact simulations of small quantum systems (up to eleven qubits) on prediction tasks. In both cases the quantum advantage disappears once the comparison is fair. In the first, extra quantum measurements add nothing that a simple classical formula of the same size does not already provide. In the second, a feedback loop genuinely helps the quantum model, turning a useless setup into a working predictor, yet a well-tuned classical network still predicts slightly more accurately, and the gap is statistically reliable. Our point is not that quantum reservoirs can never win, but that two of their commonly cited advantages do not hold up against fair classical competitors at this scale. We provide these matched comparisons as a simple, reusable checklist for honest benchmarking. All results are fully reproducible from fixed random seeds.
Quantum reservoir computing (QRC) uses fixed quantum dynamics to encode a time series and trains only a classical readout, but a benchmark capacity alone does not reveal whether task information is lost in the reservoir, the measurement, feature compression, or finite sampling. We introduce \emph{task-resolved Fisher spectroscopy}, in which prediction targets define orthonormal score coordinates on the stationary distribution of input histories. Reweighting labeled histories along these scores generates an exactly affine family of reservoir states and measurement outcomes. In the same coordinates, we obtain a many-body Fisher-information hierarchy relating the state quantum Fisher information, the Fisher information of the complete measurement record, and moment matrices retained through many-body order rrr. The quadratic form of each moment matrix is exactly the stationary capacity of the optimal linear readout, while a finite-measurement extension predicts the approach from one-shot records to ideal expectation-value features. The measurement-level quantities require only stationary labeled records and measured outcome strings, not an input model or quantum-state tomography. In a five-spin open reservoir, interactions route fourth-order temporal information into higher-body correlations, so low-order compression can incur orders-of-magnitude sampling overhead even when a conventional parity target remains accessible. For correlated inputs and outputs, record-defined task scores predict held-out capacities, the required feature order, and measurement-budget dependence; optimizing the local measurement axis recovers otherwise hidden task information. The framework connects benchmark performance to experimentally actionable diagnoses of reservoir encoding, measurement choice, classical representation, and shot allocation.
ABSTRACT Background Quantum federated learning presents a promising paradigm for privacy‐preserving collaborative training across distributed quantum devices. However, its scalability is hindered by the significant communication overhead associated with transmitting high‐dimensional, high‐precision quantum model parameters over classical networks. Methods To address this bottleneck, this paper proposes QFI‐Opt (Quantum Fisher Information‐guided Adaptive Optimization), a quantum adaptive communication optimization framework based on Quantum Fisher Information. QFI‐Opt establishes a “sensing‐compression‐regulation” pipeline that achieves communication efficiency while preserving quantum model fidelity. The framework uses QFI as a physically interpretable metric to dynamically assess quantum state sensitivity to parameter perturbations, enabling a progressive pruning strategy that removes low‐sensitivity parameters during training while retaining critical quantum features. Additionally, a dynamic bit‐width quantization mechanism adapts precision based on parameter importance, maximizing compression without compromising numerical stability. This is further complemented by a physics‐aware aggregation method that weighs client updates based on both local data volume and quantum information quality derived from QFI scores, improving global model robustness. Results Extensive evaluation on quantum convolutional neural networks demonstrates that QFI‐Opt significantly reduces per‐round communication overhead compared to baseline methods. Conclusions Simultaneously, the proposed framework maintains competitive model accuracy and convergence performance across diverse quantum architectures.
Quantum Fisher information (QFI) determines the ultimate precision of a quantum sensor after optimization over all allowed measurements, but it does not quantify how difficult the optimal readout is to implement. We introduce a moment Fisher hierarchy FM(k)F_M^{(k)}FM(k)​, which measures the fraction of QFI accessible to collective spin moments up to degree kkk, together with a readout-complexity scale k90k_{90}k90​ defined by the minimum degree required to recover 90%90\%90% of the QFI. Applying this framework to a nonlinear collective-spin sensor, we show that many-body dynamics can preserve large QFI while transferring the optimal readout into high-rank SU(2)SU(2)SU(2) tensor sectors inaccessible to low-order collective observables. For system sizes up to N=100N=100N=100, first moments access only ∼10−2\sim 10^{-2}∼10−2 of the available QFI, while the degree required to recover 90%90\%90% of it grows to k90≃28k_{90}\simeq 28k90​≃28. A rank-resolved analysis of the symmetric logarithmic derivative (SLD) under weak damping shows that the nonlinear protocol pushes the optimal readout toward the highest available tensor ranks while strongly depleting its low-rank weight. These results identify nonlinear tangent-space shear as the mechanism behind a finite-size readout-complexity bottleneck in many-body quantum metrology.
Quantum Fisher information (QFI) stands at a critical inflection point: transitioning from a theoretical bound to a measurable diagnostic that enables unprecedented sensing capabilities in noisy intermediate-scale quantum (NISQ) devices. Here, we present a paradigm shift where QFI becomes both the metric and mechanism for achieving practical quantum advantage. We introduce three transformative concepts: (i) noise-engineered QFI that exploits environmental correlations rather than fighting them, (ii) adaptive multiparameter sensing using real-time QFI feedback, and (iii) hybrid classical-quantum estimation that scales QFI extraction to thousands of qubits. Through quantitative analysis of emerging platforms, we demonstrate that current experiments are achieving 2-10× classical performance bounds, with a clear pathway to 100× advantage by 2030. This perspective reframes QFI from a passive bound to an active design principle, establishing sensing as quantum computing's first scalable application.