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.
HyperQ is introduced, which adds token-conditioned quantum residual branches to a frozen masked-diffusion language model, and support token-conditioned circuit emission as a tractable architectural approach to quantum-augmented language modelling.
Xiaoqiang Wang, Meng-Yang Xiong, Jun Dai et al.· 0 citations
These proof-of-concept results, obtained on small synthetic tasks, suggest that the physics of quantum computation can provide intrinsic interpretability signals with no direct classical counterpart, motivating study of whether this advantage persists at scale.
This research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.
Arvindhan Muthusamy, Azween Abdullah, D. Arockiam· International journal of com...· 0 citations
This paper proposes a hybrid quantum-classical framework utilizing isometric Tree Tensor Networks (TTNs) and a novel Quantum Self-Attention (QSA) subroutine, capable of compressing the latent space of a classical 10-parameter Large Language Model into a 10-parameter quantum neural network via amplitude encoding.
R. Delhibabu· Frontiers of Computer Scienc...· 0 citations
The authors created a hybrid quantum-classical model for efficient sentiment classification based on Frozen Distilled Bidirectional Encoder Representations from Transformers (frozen dBERT), supervised dimensionality reduction, variational quantum learning, and residual integration. The binary Stanford Sentiment Treeban...
Dalydas Karanath, L. Mittal· IJRDO-journal of computer sc...· 0 citations
Numerical results show that the learned architectures recover known benchmark strategies, adapt to dephasing noise, and outperform fixed hardware-efficient ans\"atze while using fewer entangling gates, establishing AutoQSense as a resource-aware approach to adaptive and hardware-compatible quantum sensing.
Jie Liu, Xin Wang· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.