A Quantum Variational Approach to Prototypical Recurrent Unit
arXiv:2609.04354 · doi:10.1109/QCNC69040.2026.00126
Abstract
We introduce a lightweight Quantum Prototypical Recurrent Unit (QPRU) that requires significantly fewer parameters than both classical recurrent architectures, such as Long Short- Term Memory (LSTM) and Gated Recurrent Unit (GRU), and quantum variants, including Quantum LSTM (QLSTM) and Quantum GRU (QGRU). Despite its compact design, the QPRU achieves competitive forecasting performance, matching state-of-the-art baselines while offering important structural and practical advantages, including enhanced scalability and a reduced number of trainable parameters.
arXiv comment12 pages, 5 figures, 4 tables
References in corpus (12)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum machine learning in feature Hilbert spaces
- An introduction to quantum machine learning
- Evaluating analytic gradients on quantum hardware
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Continuous-variable quantum neural networks
- Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spaces
- Rapid training of quantum recurrent neural networks