This survey contributes a refined taxonomy with an attention-semantics dimension distinguishing pairwise from holistic mechanisms, a resource-realism analysis, and a critical synthesis of the empirical literature that finds parity or task-conditional modest gains rather than uniform quantum advantage across the five papers reporting parameter-matched classical baselines.
Abstract
Quantum attention mechanisms integrate parameterised quantum circuits or quantum linear algebra primitives into transformer architectures, drawing on superposition and entanglement in the attention computation. The field has produced more than two dozen proposals between 2022 and 2026, spanning Parameterised Quantum Circuits (PQC) on near-term hardware, Quantum Linear Algebra (QLA) on fault-tolerant hardware, and quantum annealing. This survey contributes a refined taxonomy with an attention-semantics dimension distinguishing pairwise from holistic mechanisms; a resource-realism analysis that states the measurement-overhead cost of pairwise quantum attention in the Noisy Intermediate-Scale Quantum (NISQ) regime as a proposition under explicit assumptions, with the architecture classes falling outside those assumptions identified, organised within a four-axis design framework covering sequence and qubit scaling, circuit depth, encoding overhead, and hardware platform constraints, complementing the dedicated measurement-overhead analysis; and a critical synthesis of the empirical literature that finds parity or task-conditional modest gains rather than uniform quantum advantage across the five papers reporting parameter-matched classical baselines. Six open directions are identified for the next phase of research. The survey clarifies what the current literature does and does not establish about quantum attention’s practical advantage over efficient classical alternatives.
FlowMeas is introduced, which uses a generative flow network to directly sample finite ensembles of shallow Clifford measurement circuits subject to a prescribed shot budget and hardware constraints, and establishes generative learning as a flexible and unified framework for quantum measurement design under practical r...
Jun Dai, O. Nahman-Lévesque, Guillaume Rabusseau et al.· 0 citations
Encoding classical data into quantum systems is a foundational step in the execution of nearly all quantum algorithms, and a critical bottleneck in realizing practical quantum advantage. This review provides a comprehensive account of the concepts, algorithms, and practical considerations associated with quantum data e...
Xiao-Ming Zhang, Arthur G. Rattew, Bu-Jiao Wu et al.· 2 citations
Routing-aware pruning is established as a practical and unified compilation strategy across the quantum computing stack and a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates.
Pau Escofet, C. G. Almudéver, S. Abadal et al.· IEEE Transactions on Circuit...· 0 citations
An architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process (MDP), where compiler-level communication actions dynamically update logical-qubit placement and enable subsequent gate execution.
Chien-Tung Kuo, Felix Burt, Samuel Yen-Chi Chen et al.· 1 citation
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
Recent advances in quantum computing have been driven primarily by improvements in hardware. Here we show that substantial gains can instead arise from how finite computational resources are allocated throughout a quantum computation. We introduce Adaptive Algorithmic Control (A2C), a software paradigm founded on a Sta...
Jian-Long Lu, Hong-Ru Zhang, Thorsten Koch et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.