Superior resilience to poisoning and amenability to unlearning in quantum machine learning

Yu-Qin Chen, Shi-Xin Zhang
8/4/2025
quant-phcs.LG

No confident code implementation found for this paper.

Abstract

The reliability of artificial intelligence hinges on the integrity of its training data, a foundation often compromised by noise and corruption. Here, through a comparative study of classical and quantum neural networks on both classical and quantum data, we reveal a fundamental difference in their response to data corruption. We find that classical models exhibit brittle memorization, leading to a failure in generalization. In contrast, quantum models demonstrate remarkable resilience, which is underscored by a phase transition-like response to increasing label noise, revealing a critical point beyond which the model's performance changes qualitatively. We further establish and investigate the field of quantum machine unlearning, the process of efficiently forcing a trained model to forget corrupting influences. We show that the brittle nature of the classical model forms rigid, stubborn memories of erroneous data, making efficient unlearning challenging, while the quantum model is significantly more amenable to efficient forgetting with approximate unlearning methods. Our findings establish that quantum machine learning can possess a dual advantage of intrinsic resilience and efficient adaptability, providing a promising paradigm for the trustworthy and robust artificial intelligence of the future.

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!

Cite this paper

@article{chen2025superior,
  title  = {Superior resilience to poisoning and amenability to unlearning in quantum machine learning},
  author = {Yu-Qin Chen and Shi-Xin Zhang},
  year   = {2025},
  eprint = {2508.02422},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.02422v1}
}

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/2508.02422.svg)](https://codeofpaper.com/paper/2508.02422)

Discussion