Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This paper introduces a NISQ-compatible quantum transformer architecture designed for synthetic natural language processing, replacing classical attention mechanisms with variational quantum circuits to model grammar structures. While the study confirms that current quantum models remain less stable and accurate than classical baselines, it provides a concrete architectural blueprint for future QNLP applications under near-term hardware constraints. The work represents a foundational step in adapting transformer paradigms to quantum registers rather than claiming immediate performance superiority.
Surse care acoperăarXiv, Quantum Zeitgeist
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Variational Quantum Transformer Architecture for Synthetic Language Generation

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2609.18565v1 Announce Type: new Abstract: We propose a compact NISQ-compatible quantum transformer architecture for synthetic QNLP sequence modelling. The model preserves the autoregressive next-token interface of a classical transformer, but replaces attention and feed-forward sublayers with variational quantum encoder blocks, connector circuits, decoder blocks and a direct two-qubit measurement readout. Token contexts are angle-encoded into small quantum registers, processed by parallel variational heads and encoder integration circuits and conditioned through decoder ancillae to produce a distribution over a four-token vocabulary. We evaluate several architecture variants on deterministic and lexicographic grammar-generation tasks against a compact classical transformer baseline. The quantum models are trainable end-to-end and learn nontrivial grammar structure, including perfect deterministic generation in individual runs and high lexicographic validity in the strongest variant. The classical baseline remains more accurate and stable and the quantum models are sensitive to initialization. The contribution is therefore not a claim of quantum advantage, but a concrete architecture and evaluation of transformer-inspired QNLP sequence modelling under near-term quantum constraints.

Abstract:We propose a compact NISQ-compatible quantum transformer architecture for synthetic QNLP sequence modelling. The model preserves the autoregressive next-token interface of a classical transformer, but replaces attention and feed-forward sublayers with variational quantum encoder blocks, connector circuits, decoder blocks and a direct two-qubit measurement readout. Token contexts are angle-encoded into small quantum registers, processed by parallel variational heads and encoder integration circuits and conditioned through decoder ancillae to produce a distribution over a four-token vocabulary. We evaluate several architecture variants on deterministic and lexicographic grammar-generation tasks against a compact classical transformer baseline. The quantum models are trainable end-to-end and learn nontrivial grammar structure, including perfect deterministic generation in individual runs and high lexicographic validity in the strongest variant. The classical baseline remains more accurate and stable and the quantum models are sensitive to initialization. The contribution is therefore not a claim of quantum advantage, but a concrete architecture and evaluation of transformer-inspired QNLP sequence modelling under near-term quantum constraints.

Accepted for publication in the QNLPAI 2026 proceedings (Springer Lecture Notes in Computer Science, LNCS). 10 pages, including references and appendix, 2 figures

Quantum Physics (quant-ph); Computation and Language (cs.CL); Machine Learning (cs.LG)

arXiv:2609.18565 [quant-ph]

(or arXiv:2609.18565v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.18565 arXiv-issued DOI via DataCite (pending registration)

Text integral sub licența deschisă a publicației · 207 cuvinte

Subiecte conexe