Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.04354

A Quantum Variational Approach to Prototypical Recurrent Unit

Mahyar Sadeghi Garjan·Tommaso Cesari·Michel Barbeau
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.LG

Keep this discovery

BibTeXRIS

Mahyar Sadeghi Garjan, Tommaso Cesari, Michel Barbeau. 2026-09-03. A Quantum Variational Approach to Prototypical Recurrent Unit. https://doi.org/10.1109/qcnc69040.2026.00126

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.LG subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Deep belief networks are exact

We prove that every strictly positive probability distribution on \(\{-1,1\}^n\) is represented exactly by a sigmoid belief network with finite parameters. This answers a question of Sutskever and Hinton. The proof upgrades their probability-sharing approximation to exact representation using Brouwer's fixed-point theorem.

cs.AI↗
arXiv2025

Stacked conformal prediction

We consider a method for conformalizing a stacked ensemble of predictive models, showing that the potentially simple form of the meta-learner at the top of the stack enables a procedure with manageable computational cost that achieves approximate marginal validity without requiring the use of a separate calibration sample. Empirical results indicate that the method compares favorably to a standard inductive alternative.

stat.ML↗
arXiv2026

Higher Structures in Deep Learning

We provide an expository introduction on the importance of higher-arity tensor operations to deep learning. Then, we conduct a novel empirical investigation of higher-arity phenomenon in trained neural networks, introduce a hypergraphical generalization of the multilayer perceptron, and explore connections to evolutionary algorithms. We conclude with a discussion of promising directions for future research.

cs.LG↗