arXiv Machine Learning

Foundations of Practical Quantum Advantage in Quantum-Informed Machine Learning for Predicting Chaos

arXiv:2606. 13422v2 Announce Type: replace-cross Abstract: We develop theoretical foundations for a practical quantum-advantage mechanism in quantum-informed machine learning for chaotic dynamical systems.

arXiv Machine Learning
Jun 24

Quantum Adaptive Self-Attention for Quantum Transformer Models

arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.

By Chi-Sheng Chen, En-Jui Kuo
arXiv AI
Jun 2

Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework

arXiv:2606. 01291v1 Announce Type: cross Abstract: Training Variational Quantum Circuits (VQCs) under Noisy Intermediate-Scale Quantum (NISQ) constraints introduces severe computational limitations: classical statevector simulation memory scales exponentially ($\mathcal{O}(2^n)$), and global cost functions suffer from barren plateaus where gradient variance decays exponentially ($\mathcal{O}(1/2^n)$).

By Syed Farhan Ahmad, Gregory T. Byrd
arXiv Machine Learning
Aug 7

How Much Reconstruction Does Quantum Machine Learning Need? Late Fusion of Independently Trained Quantum Subcircuits

arXiv:2608. 05595v1 Announce Type: cross Abstract: Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by reconstruction carries a classical sampling overhead exponential in the number of cuts - the dominant runtime cost in prior work.

By Prabhjot Singh, Adel N. Toosi, Rajkumar Buyya
arXiv Machine Learning
Jun 11

Higher-Order Token Interactions via Quantum Attention

arXiv:2606. 11673v1 Announce Type: cross Abstract: Standard dot-product self-attention computes, in a single layer, only pairwise (order-2) interactions between tokens; representing a generic order-$k$ interaction is known to require either super-quadratic resources in one layer or composition across depth.

By Jian Xu, Chao Li, Delu Zeng, John Paisley, Qibin Zhao