mlsanityData to 14 Oct 2026

Mitigating Noise-Induced Gradient Vanishing in Variational Quantum Algorithm Training

arXiv 2111.13209 ↗First posted 25 Nov 2021quant-ph cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Variational quantum algorithms are expected to demonstrate the advantage of quantum computing on near-term noisy quantum computers. However, training such variational quantum algorithms suffers from gradient vanishing as the size of the algorithm increases. Previous work cannot handle the gradient vanishing induced by the inevitable noise effects on realistic quantum hardware. In this paper, we propose a novel training scheme to mitigate such noise-induced gradient vanishing. We first introduce a new cost function of which the gradients are significantly augmented by employing traceless observables in truncated subspace. We then prove that the same minimum can be reached by optimizing the original cost function with the gradients from the new cost function. Experiments show that our new training scheme is highly effective for major variational quantum algorithms of various tasks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 34 references that are in the map. First posted on arXiv 25 Nov 2021.

Builds on

8 of 34 references.

References · 8

  1. 2020Variational Quantum Algorithmscited by 692
  2. 2018Barren plateaus in quantum neural network training landscapescited by 630
  3. 2020Noise-Induced Barren Plateaus in Variational Quantum Algorithmscited by 193
  4. 2020Absence of Barren Plateaus in Quantum Convolutional Neural Networkscited by 125
  5. 2020Layerwise learning for quantum neural networkscited by 88
  6. 2019Learning to learn with quantum neural networks via classical neural networkscited by 56
  7. 2020Trainability of Dissipative Perceptron-Based Quantum Neural Networkscited by 56
  8. 2020Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuitscited by 26

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.