Pith. sign in

REVIEW 3 cited by

Reservoir Computing via Quantum Recurrent Neural Networks

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 2211.02612 v1 pith:X3XGJT4E submitted 2022-11-04 cs.NE cs.LGquant-ph

classification cs.NEcs.LGquant-ph
keywords quantumclassicalcomputingmodelingneuralqrnnsequentialapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent developments in quantum computing and machine learning have propelled the interdisciplinary study of quantum machine learning. Sequential modeling is an important task with high scientific and commercial value. Existing VQC or QNN-based methods require significant computational resources to perform the gradient-based optimization of a larger number of quantum circuit parameters. The major drawback is that such quantum gradient calculation requires a large amount of circuit evaluation, posing challenges in current near-term quantum hardware and simulation software. In this work, we approach sequential modeling by applying a reservoir computing (RC) framework to quantum recurrent neural networks (QRNN-RC) that are based on classical RNN, LSTM and GRU. The main idea to this RC approach is that the QRNN with randomly initialized weights is treated as a dynamical system and only the final classical linear layer is trained. Our numerical simulations show that the QRNN-RC can reach results comparable to fully trained QRNN models for several function approximation and time series prediction tasks. Since the QRNN training complexity is significantly reduced, the proposed model trains notably faster. In this work we also compare to corresponding classical RNN-based RC implementations and show that the quantum version learns faster by requiring fewer training epochs in most cases. Our results demonstrate a new possibility to utilize quantum neural network for sequential modeling with greater quantum hardware efficiency, an important design consideration for noisy intermediate-scale quantum (NISQ) computers.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Gated QKAN-FWP combines fast weight programming with quantum-inspired Kolmogorov-Arnold networks via single-qubit DARUAN activations and gated updates to deliver a 12.5k-parameter model that outperforms larger classic...

  2. Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation

    quant-ph 2026-06 unverdicted novelty 4.0 of 10

    The paper introduces Recursive QLSTM via metacore recursion, numerically tests variants on sequence lengths, and offers theoretical arguments for better temporal propagation.

  3. Self-Modulating Quantum Fast-Weight Programmers for Efficient Adaptive Sequential Learning

    quant-ph 2026-06 unverdicted novelty 3.0 of 10

    Self-Modulating QFWP adds adaptive modulation to quantum fast-weight updates and memory to improve stability and performance on sequential learning tasks.

Pith tools