Metraipolis › archive › dc_76821041d348

Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access — arXiv:2609.11637

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11637
License (as archived)
CC0-1.0
Archived
2026-10-16T05:46:55.185Z
SHA-256 of the archived text
fbcf9dacadc37a6d958a50b142b66f53b88a68a5566032ee60451ef6f02d918b
Stable URL of this page
https://metraipolis.com/documento/dc_76821041d348

How to cite

Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access — arXiv:2609.11637 — arXiv (en), https://arxiv.org/abs/2609.11637 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_76821041d348 (Metraipolis archive dc_76821041d348, sha256 fbcf9dacadc37a6d958a50b142b66f53b88a68a5566032ee60451ef6f02d918b)
BibTeX
@misc{dc76821041d348,
  title = {Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access — arXiv:2609.11637},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11637},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_76821041d348; sha256 fbcf9dacadc37a6d958a50b142b66f53b88a68a5566032ee60451ef6f02d918b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11637. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A quantum classifier assigns labels by evolving an input quantum state and measuring the output, so repeated executions reveal only a distribution over labels. We study certified adversarial robustness for such classifiers under known-readout query access (KRQA), where an evaluator can prepare inputs, knows the quantum measurement, and observes finite-shot outcomes but cannot inspect the internal evolution, parameters, or gradients. We give a measurement-only framework that returns two complementary guarantees for each input: a lower bound ruling out untargeted errors within a radius, and an attack-independent upper bound witnessing an adversarial state within a radius. Both are estimable from the known readout measurement and sampled outcomes, require no tomography or circuit description, and have finite-sample control of probability-estimation error. The upper bound uses gap operators induced by the quantum measurement; the lower bound relaxes state-space search to an efficient optimization over outcome distributions with operator-spectrum constraints, yielding certificates that are never weaker than prior probability-only certificates and can be strictly stronger when the spectral constraints are active. On tractable instances, we compare the lower bound with numerical white-box reference estimates; across multiple classifiers, the upper bound remains informative when standard attacks fail. We further demonstrate real-device feasibility on IBM Quantum hardware: from 40 executions of two 8-qubit quantum neural networks, our method estimates both bounds, with the expected lower-upper ordering on every tested input. Taken together, these results show that robustness claims for quantum classifiers can be audited directly from observable statistics under KRQA.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-11 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.11637 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:30:39.419Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).