Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2508.11848 · Quantum science and technology

Adversarial Robustness in Distributed Quantum Machine Learning

Pouya Kananian, Hans‐Arno Jacobsen

Published Jan 1, 2026• 2 citations
arXivHTMLPDF
DOI
10.1007/978-3-032-11153-1_11

Related papers

Adversarial Robustness in Quantum Machine Learning

Nicola Franco, Aman Saxena, Tom Wollschläger +3 more

Quantum science and technology•Jan 1, 2026•0 citations

Noise, Errors, and Adversarial Robustness in Quantum Machine Learning

Alex Jin, Manas Mukherjee

Quantum science and technology•Jan 1, 2026•0 citations

Verifying Adversarial Robustness in Quantum Machine Learning: from theory to physical validation via a software tool

Ji Guan, Mingsheng Ying

As with classical neural networks, quantum machine learning (QML) models are vulnerable to small input perturbations that can significantly alter output predictions. Certifying the robustness of QML models, particularly on NISQ hardware, is therefore a fundamental step toward trustworthy quantum AI. This chapter reviews our recently developed comprehensive formal framework for verifying adversarial robustness in QML. The core of this framework is a fidelity-based robustness lower bound computable directly from the measurement outcome distribution, which enables both formal verification and empirical estimation on real quantum devices. Additionally, the optimal bound can be computed via semidefinite programming (SDP) with full knowledge of the quantum machine learning models. We incorporate these results into: (1) an efficient formal verification framework; (2) VeriQR, the first dedicated QML robustness verification tool; and (3) the first experimental benchmark of quantum adversarial robustness on a 20-qubit superconducting processor. Together, these systematic advances enable scalable, physically grounded robustness evaluation of QML models.

quant-pharXiv:2605.29877•Quantum science and technology•May 29, 2026•0 citations

Fundamentals of Quantum Machine Learning and Robustness

Lirandë Pira, Patrick Rebentrost

Quantum machine learning (QML) sits at the intersection of quantum computing and classical machine learning, offering the prospect of new computational paradigms and advantages for processing complex data. This chapter introduces the fundamentals of QML for readers from both communities, establishing a shared conceptual foundation. We connect the worst-case, adversarial perspective from theoretical computer science with the physical principles of quantum systems, highlighting how superposition, entanglement, and measurement collapse influence learning and robustness. Special attention is given to adversarial robustness, understood as the ability of QML models to resist inputs designed to cause failure. We motivate the study of QML in adversarial settings, outlining distinctions between classical and quantum data and computations when the adversary is a core element. This chapter serves as a starting point to adversarial and robust quantum machine learning in subsequent chapters.

quant-pharXiv:2602.20499•Feb 25, 2026•0 citations

Towards quantum enhanced adversarial robustness in machine learning

Maxwell T. West, Shu-Lok Tsang, Jia Shun Low +5 more

arXiv:2306.12688•Nature Machine Intelligence•May 25, 2023•79 citations

Adversarial robustness guarantees for quantum classifiers

Neil Dowling, Maxwell T. West, Angus Southwell +4 more

Abstract Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with their input data. The prospect of near-term quantum computers being capable of running quantum machine learning (QML) algorithms has therefore generated intense interest in their adversarial vulnerability. Here we show that quantum properties of QML algorithms can confer fundamental protections against such attacks, in certain scenarios guaranteeing robustness against classically-armed adversaries. We leverage tools from many-body physics to identify the quantum sources of this protection. Our results offer a theoretical underpinning of recent evidence which suggest quantum advantages in the search for adversarial robustness. In particular, we prove that quantum classifiers are: (i) protected against weak perturbations of data drawn from the trained distribution, (ii) protected against local attacks if they are insufficiently scrambling, and (iii) show evidence that they are protected against universal adversarial attacks if they are sufficiently chaotic. Our analytic results are supported by numerical evidence demonstrating the applicability of our theorems and the resulting robustness of a quantum classifier in practice. This line of inquiry constitutes a concrete pathway to advantage in QML, orthogonal to the usually sought improvements in model speed or accuracy.

arXiv:2405.10360•npj Quantum Information•Jan 19, 2026•10 citations
As with classical neural networks, quantum machine learning (QML) models are vulnerable to small input perturbations that can significantly alter output predictions. Certifying the robustness of QML models, particularly on NISQ hardware, is therefore a fundamental step toward trustworthy quantum AI. This chapter reviews our recently developed comprehensive formal framework for verifying adversarial robustness in QML. The core of this framework is a fidelity-based robustness lower bound computable directly from the measurement outcome distribution, which enables both formal verification and empirical estimation on real quantum devices. Additionally, the optimal bound can be computed via semidefinite programming (SDP) with full knowledge of the quantum machine learning models. We incorporate these results into: (1) an efficient formal verification framework; (2) VeriQR, the first dedicated QML robustness verification tool; and (3) the first experimental benchmark of quantum adversarial robustness on a 20-qubit superconducting processor. Together, these systematic advances enable scalable, physically grounded robustness evaluation of QML models.
Quantum machine learning (QML) sits at the intersection of quantum computing and classical machine learning, offering the prospect of new computational paradigms and advantages for processing complex data. This chapter introduces the fundamentals of QML for readers from both communities, establishing a shared conceptual foundation. We connect the worst-case, adversarial perspective from theoretical computer science with the physical principles of quantum systems, highlighting how superposition, entanglement, and measurement collapse influence learning and robustness. Special attention is given to adversarial robustness, understood as the ability of QML models to resist inputs designed to cause failure. We motivate the study of QML in adversarial settings, outlining distinctions between classical and quantum data and computations when the adversary is a core element. This chapter serves as a starting point to adversarial and robust quantum machine learning in subsequent chapters.
Abstract Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with their input data. The prospect of near-term quantum computers being capable of running quantum machine learning (QML) algorithms has therefore generated intense interest in their adversarial vulnerability. Here we show that quantum properties of QML algorithms can confer fundamental protections against such attacks, in certain scenarios guaranteeing robustness against classically-armed adversaries. We leverage tools from many-body physics to identify the quantum sources of this protection. Our results offer a theoretical underpinning of recent evidence which suggest quantum advantages in the search for adversarial robustness. In particular, we prove that quantum classifiers are: (i) protected against weak perturbations of data drawn from the trained distribution, (ii) protected against local attacks if they are insufficiently scrambling, and (iii) show evidence that they are protected against universal adversarial attacks if they are sufficiently chaotic. Our analytic results are supported by numerical evidence demonstrating the applicability of our theorems and the resulting robustness of a quantum classifier in practice. This line of inquiry constitutes a concrete pathway to advantage in QML, orthogonal to the usually sought improvements in model speed or accuracy.