Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2605.03629v1
• Date: Tue, 05 May 2026 10:58:53 GMT
• Title: Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms
• Abstract summary: We show that adversarial perturbations of shared entanglement induce structured gate-level noise that directly impacts quantum learning.<n>Our analysis reveals that an adversary can manipulate Kraus expressibility to maintain sufficiently large cost gradients while systematically biasing optimization toward incorrect solutions.
• Score: 1.5469452301122173
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed quantum algorithms offer a promising pathway to scale variational quantum algorithms beyond the constraints of noisy intermediate-scale quantum hardware. However, existing approaches implicitly assume a trusted entanglement-sharing layer across quantum processors. We show that this assumption introduces a fundamental vulnerability: adversarial perturbations of shared entanglement induce structured gate-level noise that directly impacts quantum learning. We develop a framework that maps entanglement-level perturbations to gate-level noise via an explicit Kraus representation. To quantify their impact, we introduce Kraus expressibility, a metric that generalizes unitary expressibility to noisy quantum channels. We then establish a trade-off between Kraus expressibility and trainability of noisy quantum circuits through gradient variance analysis. Our analysis reveals that an adversary can manipulate Kraus expressibility to maintain sufficiently large cost gradients (avoiding barren plateaus) while systematically biasing optimization toward incorrect solutions. We validate these findings through numerical simulations, demonstrating adversarial degradation of expressibility and trainability.

Related papers

• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Estimates of loss function concentration in noisy parametrized quantum circuits [0.0]
  Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization.<n>Its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem.<n>We introduce a novel analytical framework that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels.
  arXiv  Detail & Related papers  (2024-10-02T18:00:09Z)
• Exact quantum sensing limits for bosonic dephasing channels [8.124633573706763]
  Dephasing is a prominent noise mechanism that afflicts quantum information carriers. We consider discrimination and estimation of bosonic dephasing channels.
  arXiv  Detail & Related papers  (2024-02-08T16:35:32Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Robust Quantum Gates against Correlated Noise in Integrated Quantum Chips [11.364693110852738]
  We report the experimental realization of robust quantum gates in superconducting quantum circuits. Our work provides a versatile toolbox for achieving noise-resilient complex quantum circuits.
  arXiv  Detail & Related papers  (2024-01-03T16:12:35Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Enhancing Quantum Circuit Noise Robustness from a Geometric Perspective [2.1789818083464203]
  Quantum errors in noisy environments remain a major obstacle to advancing quantum information technology. We show how circuit noise robustness can be enhanced using twirling techniques. This research illuminates pathways to achieving noise-resistant quantum control beyond mere optimization of control pulses.
  arXiv  Detail & Related papers  (2023-05-11T13:34:39Z)
• Leveraging hardware-control imperfections for error mitigation via generalized quantum subspace [0.8399688944263843]
  In the era of quantum computing without full fault-tolerance, it is essential to suppress noise effects via the quantum error mitigation techniques to enhance the computational power of the quantum devices. One of the most effective noise-agnostic error mitigation schemes is the generalized quantum subspace expansion (GSE) method. We propose the fault-subspace method, which constructs an error-mitigated quantum state with copies of quantum states with different noise levels.
  arXiv  Detail & Related papers  (2023-03-14T07:01:30Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• Universal cost bound of quantum error mitigation based on quantum estimation theory [0.0]
  We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. We derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
  arXiv  Detail & Related papers  (2022-08-19T15:04:36Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.