mlsanityData to 7 Oct 2026

BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms

arXiv 2204.13751 ↗First posted 28 Apr 2022quant-ph cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Barren plateaus are a notorious problem in the optimization of variational quantum algorithms and pose a critical obstacle in the quest for more efficient quantum machine learning algorithms. Many potential reasons for barren plateaus have been identified but few solutions have been proposed to avoid them in practice. Existing solutions are mainly focused on the initialization of unitary gate parameters without taking into account the changes induced by input data. In this paper, we propose an alternative strategy which initializes the parameters of a unitary gate by drawing from a beta distribution. The hyperparameters of the beta distribution are estimated from the data. To further prevent barren plateau during training we add a novel perturbation at every gradient descent step. Taking these ideas together, we empirically show that our proposed framework significantly reduces the possibility of a complex quantum neural network getting stuck in a barren plateau.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 11 of its 26 references that are in the map. First posted on arXiv 28 Apr 2022.

Builds on

11 of 26 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Variational Quantum Algorithmscited by 687
  3. 2018Barren plateaus in quantum neural network training landscapescited by 624
  4. 2017How to Escape Saddle Points Efficientlycited by 284
  5. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  6. 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 144
  7. 2020Entanglement Induced Barren Plateauscited by 101
  8. 2019Learning to learn with quantum neural networks via classical neural networkscited by 55
  9. 2021Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computerscited by 14
  10. 2019Multilevel Combinatorial Optimization Across Quantum Architecturescited by 9
  11. 2020Classical symmetries and the Quantum Approximate Optimization Algorithmcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 5; 2024: 6; 2025: 2; 2026: 1.

15 papers.

Sort: