paper-with-me

Papers

QAMA: Quantum annealing multi-head attention operator with classical deep learning framework

2025-04-15 · Peng Du, Shuolei Wang, Shicheng Li, Jinjing Shi

As large language models scale up, the conventional attention mechanism faces critical challenges of exponential growth in memory consumption and energy costs. Quantum annealing computing, with its inherent advantages in computational efficiency and low energy consumption, offers an innovative direction for constructing novel deep learning architectures. This study proposes the first Quantum Annealing-based Multi-head Attention (QAMA) mechanism, achieving seamless compatibility with classical attention architectures through quadratic unconstrained binary optimization (QUBO) modeling of forward propagation and energy-based backpropagation. The method innovatively leverages the quantum bit interaction characteristics of Ising models to optimize the conventional $O(n^2)$ spatiotemporal complexity into linear resource consumption. Integrated with the optical computing advantages of coherent Ising machines (CIM), the system maintains millisecond-level real-time responsiveness while significantly reducing energy consumption. Our key contributions include: Theoretical proofs establish QAMA mathematical equivalence to classical attention mechanisms; Dual optimization of multi-head specificity and long-range information capture via QUBO constraints; Explicit gradient proofs for the Ising energy equation are utilized to implement gradient conduction as the only path in the computational graph as a layer; Proposed soft selection mechanism overcoming traditional binary attention limitations to approximate continuous weights. Experiments on QBoson CPQC quantum computer show QAMA achieves comparable accuracy to classical operators while reducing inference time to millisecond level and improving solution quality. This work pioneers architectural-level integration of quantum computing and deep learning, applicable to any attention-based model, driving paradigm innovation in AI foundational computing.

📄 PDF Abstract BibTeX arXiv:2504.11083

Code (0)

등록된 구현이 없습니다.

Tasks

Computational EfficiencySpecificity

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Multi-Head Attention 설명 없음

Similar Papers 제목 키워드 기반

A Single-Step Multiclass SVM based on Quantum Annealing for Remote Sensing Data Classification

2023-03-21 · Amer Delilbasic, Bertrand Le Saux, Morris Riedel, Kristel Michielsen 외

In recent years, the development of quantum annealers has enabled experimental demonstrations and has increased research interest in applications of quantum annealing, such as in quantum machine learning and in particula…

Quantum Machine Learning

Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization

2025-01-03 · Renichiro Haba, Masayuki Ohzeki, Kazuyuki Tanaka

Quantum annealing has garnered significant attention as meta-heuristics inspired by quantum physics for combinatorial optimization problems. Among its many applications, nonnegative/binary matrix factorization stands out…

Combinatorial Optimization

Investigation into the Potential of Parallel Quantum Annealing for Simultaneous Optimization of Multiple Problems: A Comprehensive Study

2024-03-09 · Arit Kumar Bishwas, Anuraj Som, Saurabh Choudhary

Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multip…

Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing

2014-06-17 · Ryan Babbush, Vasil Denchev, Nan Ding, Sergei Isakov 외

Quantum annealing is a heuristic quantum algorithm which exploits quantum resources to minimize an objective function embedded as the energy levels of a programmable physical system. To take advantage of a potential quan…

Reverse Annealing for Nonnegative/Binary Matrix Factorization

2020-07-10 · John Golden, Daniel O'Malley

It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers…