Adversarial Robustness of Partitioned Quantum Classifiers

Pouya Kananian, Hans-Arno Jacobsen
1/28/2025
cs.ETcs.AIcs.CR

No confident code implementation found for this paper.

Abstract

Adversarial robustness in quantum classifiers is a critical area of study, providing insights into their performance compared to classical models and uncovering potential advantages inherent to quantum machine learning. In the NISQ era of quantum computing, circuit cutting is a notable technique for simulating circuits that exceed the qubit limitations of current devices, enabling the distribution of a quantum circuit's execution across multiple quantum processing units through classical communication. We examine how partitioning quantum classifiers through circuit cutting increase their susceptibility to adversarial attacks, establishing a link between attacking the state preparation channels in wire cutting and implementing adversarial gates within intermediate layers of a quantum classifier. We then proceed to study the latter problem from both a theoretical and experimental perspective.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kananian2025adversarial,
  title  = {Adversarial Robustness of Partitioned Quantum Classifiers},
  author = {Pouya Kananian and Hans-Arno Jacobsen},
  year   = {2025},
  eprint = {2502.20403},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.20403v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.20403.svg)](https://codeofpaper.com/paper/2502.20403)

Discussion