Fixed-Reservoir vs Variational Quantum Architectures for Chaotic Dynamics: Benchmarking QRC and QPINN on the Lorenz System

• URL: http://arxiv.org/abs/2604.23743v1
• Date: Sun, 26 Apr 2026 14:43:03 GMT
• Title: Fixed-Reservoir vs Variational Quantum Architectures for Chaotic Dynamics: Benchmarking QRC and QPINN on the Lorenz System
• Abstract summary: We compare two quantum approaches for chaotic time-series prediction on the Lorenz system.<n>We formalize a temporal windowing technique within the QRC pipeline that improves attractor reconstruction.<n>Our findings suggest the fixed-reservoir architecture is a primary driver of QRC's advantage at these scales.
• Score: 0.14323566945483496
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Deploying quantum machine learning on NISQ devices requires architectures where training overhead does not negate computational advantages. We systematically compare two quantum approaches for chaotic time-series prediction on the Lorenz system: a variational Quantum Physics-Informed Neural Network (QPINN) and a Quantum Reservoir Computing (QRC) framework utilizing a fixed transverse-field Ising Hamiltonian. Under matched resources ($4$--$5$ qubits, $2$--$3$ layers), QRC achieves an $81\%$ lower mean-squared error (test MSE $3.2 \pm 0.6$ vs. $47.9 \pm 36.6$ for QPINN) while training $\sim 52,000\times$ faster ($0.2$\,s vs. $\sim 2.4$\,h per seed). Drawing on the classical delay-embedding principle, we formalize a temporal windowing technique within the QRC pipeline that improves attractor reconstruction by providing bounded, structured input history. Analysis reveals that QPINN instability stems from capacity limitations and competing loss terms rather than barren plateaus; gradient norms remained large ($10^3$--$10^4$), ruling out exponential suppression at this scale. These failure modes are absent by construction in the non-variational QRC approach. We validate robustness across three canonical systems (Lorenz, Rössler, and Lorenz-96), where QRC consistently achieves low test MSE ($3.1 \pm 0.6$, $1.8 \pm 0.1$, and $12.4 \pm 0.6$, respectively) with sub-second training. Our findings suggest the fixed-reservoir architecture is a primary driver of QRC's advantage at these scales, warranting further investigation at larger qubit counts and on hardware where quantum-specific advantages are expected to emerge.

Related papers

• Classical $\mathrm{SU}(2)$ Models Match or Exceed Shallow Variational Quantum Circuits on Vision Benchmarks [0.0]
  Quaternion-valued neural networks and variational quantum circuits (VQCs) both derive local transformations from $mathrmSU(2)$ geometry.<n>We compare real-valued, quaternionvalued, and quantum classification heads on identical frozen features across MNIST, FashionMNIST, and CIFAR-10.<n>Our results indicate that quaternion networks provide efficient, stable alternatives to shallow VQCs on tasks lacking intrinsic quantum structure.
  arXiv  Detail & Related papers  (2026-08-07T23:50:09Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework [0.0787796182001592]
  Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations.<n>This paper introduces and evaluates the Quantum Algorithm for Distributed Reduction of Entanglements (QADR)<n>QADR decomposes a global $n$-qubit VQC into localized sub-circuits operating approximately within the causal light cones of individual target qubits.
  arXiv  Detail & Related papers  (2026-05-31T15:23:10Z)
• Quantum Tunneling-Aware Machine Learning: Physics-Derived Noise Models for Robust Deployment [5.373588450790602]
  We introduce quantum tunneling-aware machine learning (QTAML)<n>We derive the deployment-time weight-error distribution from first principles using the Wentzel-Kramers-Brillouin (WKB) approximation.<n>We package these structural properties into a single deployment-time algorithm, Tunneling-Aware Compensation (TAC), that combines closed-form mean correction with an optimal layer-budget allocation.
  arXiv  Detail & Related papers  (2026-05-30T14:21:16Z)
• Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning [0.0]
  We present DeepQMap, a deep reinforcement learning framework that integrates a bidirectional Long Short-Term Memory based Dynamic Noise Adaptation network.<n>Our method continuously adapts to hardware dynamics through learned temporal representations of quantum system behavior.<n>DeepQMap achieves mean circuit fidelity of $0.920 pm 0.023$, representing a statistically significant 49.3% improvement over state-of-the-art QUBO methods.
  arXiv  Detail & Related papers  (2025-11-22T14:27:55Z)
• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• 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)
• Practical quantum advantage on partially fault-tolerant quantum computer [0.6449786007855248]
  We propose an alternative approach to achieve practical quantum advantages on early-FTQC devices. Our framework is based on partially fault-tolerant logical operations to minimize spatial overhead. We present several promising applications that leverage the potential of our framework.
  arXiv  Detail & Related papers  (2024-08-27T07:58:09Z)
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy [6.81054341190257]
  We develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach. We evaluate our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.
  arXiv  Detail & Related papers  (2024-02-21T17:45:03Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• A Race Track Trapped-Ion Quantum Processor [0.0]
  We describe and benchmark a new quantum charge-coupled device based on a linear trap with periodic boundary conditions. The system is initially operated with 32 qubits, but future upgrades will allow for more.
  arXiv  Detail & Related papers  (2023-05-05T20:07:37Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.