Quantum Reservoir Computing for Statistical Classification in a Superconducting Quantum Circuit
- URL: http://arxiv.org/abs/2602.15474v1
- Date: Tue, 17 Feb 2026 10:29:25 GMT
- Title: Quantum Reservoir Computing for Statistical Classification in a Superconducting Quantum Circuit
- Abstract summary: We show that Quantum Reservoir Computing (QRC) can accurately classify complex probability distributions.<n>We find QRC to outperform some of the best classical methods when the amount of information is limited.<n>This demonstrates its potential to be a noise-resilient quantum learning approach capable of tackling real-world problems.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We analyze numerically the performance of Quantum Reservoir Computing (QRC) for statistical and financial problems. We use a reservoir composed of two superconducting islands coupled via their charge degrees of freedom. The key non-linear elements that provide the reservoir with rich and complex dynamics are the Josephson junctions that connect each island to the ground. We show that QRC implemented in this circuit can accurately classify complex probability distributions, including those with heavy tails, and identify regimes in correlated time series, such as periods of high volatility generated by standard econometric models. We find QRC to outperform some of the best classical methods when the amount of information is limited. This demonstrates its potential to be a noise-resilient quantum learning approach capable of tackling real-world problems within currently available superconducting platforms. We further discuss how to improve our QRC algorithm in real superconducting hardware to benefit from a much larger Hilbert space.
Related papers
- Quantum Computing for Industrial Electromagnetics: Applicability and Case Studies in Solving Maxwell's Equations [0.0]
Quantum computing offers potential to accelerate large-scale simulations by encoding them with a limited number of qubits.<n>We investigate the performance of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems.<n>We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes.
arXiv Detail & Related papers (2026-08-11T08:52:25Z) - AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
arXiv Detail & Related papers (2026-02-02T14:39:42Z) - Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
arXiv Detail & Related papers (2026-01-10T02:36:03Z) - Demonstration of Discrete-Time Quantum Walks and Observation of Topological Edge States in a Superconducting Qutrit Chain [25.102971758474734]
Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research.<n>We experimentally demonstrate a scalable DTQW in a superconducting circuit, observing the ballistic spreading of quantum walk in a qutrit chain.<n>For the first time, particle-hole-symmetry-protected edge states, bounded at the interface between these two topological phases, are observed in the superconducting platform.
arXiv Detail & Related papers (2026-01-05T03:28:41Z) - Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
arXiv Detail & Related papers (2025-10-15T12:17:23Z) - Edge of Many-Body Quantum Chaos in Quantum Reservoir Computing [0.0]
In reservoir computing, optimal performance is typically achieved at the edge of chaos," the boundary between order and chaos.<n>Here, we identify its quantum many-body counterpart using the QRC implemented on the celebrated Sachdev-Ye-Kitaev model.
arXiv Detail & Related papers (2025-06-21T02:33:49Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Optimal training of finitely-sampled quantum reservoir computers for forecasting of chaotic dynamics [3.7960472831772765]
In the current Noisy Intermediate Scale Quantum (NISQ) era, the presence of noise deteriorates the performance of quantum computing algorithms.
In this paper, we analyse the effect that finite-sampling noise has on the chaotic time-series prediction capabilities of Quantum Reservoir Computing (QRC) and Recurrence-free Quantum Reservoir Computing (RF-QRC)
We show that finite sampling noise degrades the prediction capabilities of both QRC and RF-QRC while affecting QRC more due to the propagation of noise.
arXiv Detail & Related papers (2024-09-02T17:51:48Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the
Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
"Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it.
We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
arXiv Detail & Related papers (2023-07-06T17:54:08Z) - Selected applications of typicality to real-time dynamics of quantum
many-body systems [0.0]
The concept of quantum typicality refers to the fact that a single pure state can imitate the full statistical ensemble.
This fact has given rise to a rather simple but remarkably useful numerical approach to simulate the dynamics of quantum many-body systems.
arXiv Detail & Related papers (2020-01-15T13:12:07Z)
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.