SoK: Adversarial Robustness of the Variational Quantum Eigensolver via Red-Teaming

• URL: http://arxiv.org/abs/2607.19318v1
• Date: Tue, 21 Jul 2026 17:38:52 GMT
• Title: SoK: Adversarial Robustness of the Variational Quantum Eigensolver via Red-Teaming
• Abstract summary: Variational Quantum Eigensolver (VQE) is a leading algorithm for estimating molecular ground-state energies on near-term quantum hardware.<n>VQE workloads are increasingly deployed through cloud-based VQE-as-a-service'' pipelines.<n>We present textbfVQE-AdvBench, the first unified red-teaming benchmark for the Variational Quantum Eigensolver.
• Score: 18.600693351838515
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The Variational Quantum Eigensolver (VQE) is a leading algorithm for estimating molecular ground-state energies on near-term quantum hardware, with applications spanning quantum chemistry, materials science, and drug discovery. As VQE workloads are increasingly deployed through cloud-based ``VQE-as-a-service'' pipelines, they become exposed to adversaries such as compromised service components, malicious co-tenants, or insiders in the transpilation stack, any of which can corrupt results before they reach the user. A range of attacks on variational quantum circuits has been proposed, but each has been studied in isolation: some on quantum classifiers with accuracy-based metrics, others on variational quantum algorithms with energy-error metrics. This lack of a common evaluation setup makes their relative severity difficult to compare and leaves the security of VQE poorly characterized. In this work, we present \textbf{VQE-AdvBench}, the first unified red-teaming benchmark for the Variational Quantum Eigensolver, systematizing these attacks under a single evaluation protocol to rigorously assess VQE's adversarial robustness. We organize attacks along a black-, gray-, and white-box access taxonomy, and evaluate seven representative attack scenarios -- the QTrojan circuit backdoor, the QDoor parameter backdoor, parameter-space adaptations of FGSM and PGD, and three QNBAD noise-induced variants -- over a fixed molecule-ansatz-backend-metric configuration, on H$_2$ and H$_3^+$ across five noise-calibrated IBM backends. Our results reveal a clear severity ordering: noise-induced attacks that manipulate the Zero-Noise Extrapolation (ZNE) pipeline are the most damaging (up to 8.84$\times$ error amplification), followed by the QTrojan circuit-level backdoor (7.52$\times$), while the QDoor parameter-level backdoor is the least effective, yielding only marginal amplification (up to 1.37$\times$).

Related papers

• CutBackdoor: A Circuit Cut Triggered Backdoor Attack on Variational Quantum Algorithms [27.109575396296602]
  Variational Quantum Algorithms (VQAs) are a leading paradigm for near-term quantum computing.<n>We present CutBackdoor, the first parameter-supply-chain backdoor that uses cut circuit execution from CutQC as the deployment-time trigger against VQAs.
  arXiv  Detail & Related papers  (2026-07-20T16:20:12Z)
• HarmQ: Harmonic Backdoor Attacks Against Quantum Neural Networks [14.713757354775531]
  Quantum Neural Networks (QNNs) have emerged as a promising paradigm for quantum machine learning in the Noisy Intermediate-Scale Quantum (NISQ) era.<n>HarmQ is a quantum-native backdoor attack that exploits parameterized quantum circuits' inherent Fourier decomposition bias through harmonic trigger patterns.<n>Experiments on MNIST and Fashion-MNIST demonstrate that HarmQ achieves attack success rates exceeding 99% while maintaining over 90% clean accuracy.
  arXiv  Detail & Related papers  (2026-07-13T18:14:23Z)
• GroverFigureOfMerit: An Agnostic Figure of Merit for Quantum Backend Characterization in the NISQ Era [41.99844472131922]
  We propose a Figure of Merit based on Grover's algorithm as an algorithmic stress test evaluating quantum backend performance holistically.<n>The metric combines success probability on target states with penalties for non-uniform amplification and leakage to non-marked states, yielding a unified score across hardware architectures.
  arXiv  Detail & Related papers  (2026-07-09T16:08:48Z)
• Quantization as a Malicious Task: Removing Quantization-Conditioned Backdoors via Task Arithmetic [6.5117838119526565]
  Recent studies have revealed a new security threat known as Quantization-Conditioned Backdoors (QCBs)<n>QVec is a parameter-space perspective for defending against QCBs.<n>We show that QVec consistently suppresses backdoor activation while preserving clean performance.
  arXiv  Detail & Related papers  (2026-06-18T14:05:19Z)
• Noise-Resistant Feature-Aware Attack Detection Using Quantum Machine Learning [43.509065918669314]
  Continuous-variable quantum key distribution (CV-QKD) is a quantum communication technology that offers an unconditional security guarantee.<n>We propose a quantum machine learning (QML)-based attack detection framework (QML-ADF) that safeguards the security of high-rate CV-QKD systems.
  arXiv  Detail & Related papers  (2026-01-11T03:40:45Z)
• One-Shot Structured Pruning of Quantum Neural Networks via $q$-Group Engineering and Quantum Geometric Metrics [7.913101398893967]
  Quantum neural networks (QNNs) suffer from severe gate-level redundancy, which hinders their deployment on noisy intermediate-scale quantum devices.<n>We propose q-iPrune, a one-shot structured pruning framework grounded in the algebraic structure of $q$-deformed groups and task-conditioned groups.<n> Experiments on standard quantum machine learning benchmarks demonstrate that q-iPrune achieves substantial gate reduction while maintaining bounded task performance degradation.
  arXiv  Detail & Related papers  (2025-12-30T06:37:28Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry [0.0]
  Variational quantum eigensolvers (VQEs) are leading candidates to demonstrate near-term quantum advantage. We numerically quantify their level of tolerable depolarizing gate-errors.
  arXiv  Detail & Related papers  (2022-11-08T19:05:38Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.