English

Entanglement-induced provable and robust quantum learning advantages

Quantum Physics 2025-08-01 v2 Computational Complexity Machine Learning

Abstract

Quantum computing holds unparalleled potentials to enhance machine learning. However, a demonstration of quantum learning advantage has not been achieved so far. We make a step forward by rigorously establishing a noise-robust, unconditional quantum learning advantage in expressivity, inference speed, and training efficiency, compared to commonly-used classical models. Our proof is information-theoretic and pinpoints the origin of this advantage: entanglement can be used to reduce the communication required by non-local tasks. In particular, we design a task that can be solved with certainty by quantum models with a constant number of parameters using entanglement, whereas commonly-used classical models must scale linearly to achieve a larger-than-exponentially-small accuracy. We show that the quantum model is trainable with constant resources and robust against constant noise. Through numerical and trapped-ion experiments on IonQ Aria, we demonstrate the desired advantage. Our results provide valuable guidance for demonstrating quantum learning advantages with current noisy intermediate-scale devices.

Keywords

Cite

@article{arxiv.2410.03094,
  title  = {Entanglement-induced provable and robust quantum learning advantages},
  author = {Haimeng Zhao and Dong-Ling Deng},
  journal= {arXiv preprint arXiv:2410.03094},
  year   = {2025}
}

Comments

7 pages, 2 figures + 13-page supplementary materials

R2 v1 2026-06-28T19:08:01.177Z