Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.28332 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917368954880000 |
|---|---|
| author | Wang, Yue He, Guangyi Zhang, Liepeng Gonon, Lukas Zhao, Qi |
| author_facet | Wang, Yue He, Guangyi Zhang, Liepeng Gonon, Lukas Zhao, Qi |
| contents | Adversarial training is a standard defense against malicious input perturbations in security-critical machine-learning systems. Its main burden is structural: before every parameter update, the current model must first be attacked to find a new adversarial perturbation, making training increasingly expensive and hard to sustain at large-model scale. Here we give an end-to-end quantum procedure for projected-gradient robust training under local stability and sparsity assumptions. The key step is to reformulate the coupled attacker--learner dynamics as a high-dimensional sparse linear system whose terminal block yields the final network-parameter state. In this formulation, the dominant query cost scales linearly with training time steps, up to logarithmic factors, and polylogarithmically with model size, while the full gate complexity records separate input-preparation and sparse-access overheads. This places core computational tasks for AI security on a concrete quantum footing and identifies a regime in which robust-training overhead can be reduced. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_28332 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Quantum Algorithm for Robust Training Wang, Yue He, Guangyi Zhang, Liepeng Gonon, Lukas Zhao, Qi Quantum Physics Adversarial training is a standard defense against malicious input perturbations in security-critical machine-learning systems. Its main burden is structural: before every parameter update, the current model must first be attacked to find a new adversarial perturbation, making training increasingly expensive and hard to sustain at large-model scale. Here we give an end-to-end quantum procedure for projected-gradient robust training under local stability and sparsity assumptions. The key step is to reformulate the coupled attacker--learner dynamics as a high-dimensional sparse linear system whose terminal block yields the final network-parameter state. In this formulation, the dominant query cost scales linearly with training time steps, up to logarithmic factors, and polylogarithmically with model size, while the full gate complexity records separate input-preparation and sparse-access overheads. This places core computational tasks for AI security on a concrete quantum footing and identifies a regime in which robust-training overhead can be reduced. |
| title | Efficient Quantum Algorithm for Robust Training |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2603.28332 |