We investigate the barren plateau (BP) phenomenon in variational quantum algorithms using a statistical approach. Using Gaussian function models, we identify three distinct types of BPs. The first type, which we called localized-dip BPs, occurs in landscapes that are mostly flat but contain a dip point where the gradient is large in a small region around the minimum. The second type, called localized-gorge BPs, which are somewhat similar to the localized-dip BPs but contain a gorge line. The third type, called everywhere-flat BPs, appears when the entire landscape is uniformly flat with almost vanishing gradients, making optimization significantly more difficult. After illustrating these behaviors in the Gaussian function models, we extend the analysis to the variational quantum eigensolver (VQE). We consider two types of ansätze: the hardware-efficient ansatz and the random Pauli ansatz. For both ansätze, we only observe the everywhere-flat BPs. Using our statistical approach, we searched for localized-dip and localized-gorge BPs but found no evidence of such features in the examples studied, suggesting that everywhere-flat BPs dominate in these ansätze. Our method effectively probes landscape features by capturing the gradient scaling across parameter space, making it a useful tool for diagnosing BPs in variational algorithms. To mitigate BPs in the VQE, we employ a genetic algorithm (GA) to optimize the random gates generated in the ansätze, thereby reshaping the cost function landscape to enhance the optimization efficiency. A comparison with an unoptimized ansatz shows how the ansatz design can improve the scalability and reliability of variational quantum algorithms.
We investigate the barren plateau (BP) phenomenon in variational quantum algorithms using a statistical approach. Using Gaussian function models, we identify three distinct types of BPs. The first type, which we called localized-dip BPs, occurs in landscapes that are mostly flat but contain a dip point where the gradient is large in a small region around the minimum. The second type, called localized-gorge BPs, which are somewhat similar to the localized-dip BPs but contain a gorge line. The third type, called everywhere-flat BPs, appears when the entire landscape is uniformly flat with almost vanishing gradients, making optimization significantly more difficult. After illustrating these behaviors in the Gaussian function models, we extend the analysis to the variational quantum eigensolver (VQE). We consider two types of ansätze: the hardware-efficient ansatz and the random Pauli ansatz. For both ansätze, we only observe the everywhere-flat BPs. Using our statistical approach, we searched for localized-dip and localized-gorge BPs but found no evidence of such features in the examples studied, suggesting that everywhere-flat BPs dominate in these ansätze. Our method effectively probes landscape features by capturing the gradient scaling across parameter space, making it a useful tool for diagnosing BPs in variational algorithms. To mitigate BPs in the VQE, we employ a genetic algorithm (GA) to optimize the random gates generated in the ansätze, thereby reshaping the cost function landscape to enhance the optimization efficiency. A comparison with an unoptimized ansatz shows how the ansatz design can improve the scalability and reliability of variational quantum algorithms.
Quantifying the flatness of the objective-function landscape associated with unstructured parameterized quantum circuits is important for understanding the performance of variational algorithms utilizing a "hardware-efficient ansatz", particularly for ensuring that a prohibitively flat landscape -- a so-called "barren plateau" -- is avoided. For a model of such ansätze, we relate the typical landscape flatness to a certain family of random walks, enabling us to derive a Monte Carlo algorithm for efficiently, classically estimating the landscape flatness for any architecture. The statistical picture additionally allows us to prove new analytic bounds on the barren plateau phenomenon, and more generally provides novel insights into the phenomenon's dependence on the ansatz depth, architecture, qudit dimension, and Hamiltonian combinatorial and spatial locality. Our analysis utilizes techniques originally developed by Dalzell et al. to study anti-concentration in random circuits.
Abstract Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). We analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.
Barren plateaus-regions of exponentially small gradients-are a major obstacle for training variational quantum algorithms on non-trivial problem sizes. Existing results analyze specific causes in isolation, such as random deep circuits or global cost functions, but lack a unified picture that integrates circuit design, data encoding, cost structure, and noise. In this work, we develop a comprehensive theory of barren plateaus for parametrized quantum circuits. We prove that three mechanisms jointly control gradient scaling: (1) ansatz-induced concentration, where highly expressive or sufficiently deep circuits approximate unitary 2-designs causing gradient variance to scale as O(2 −n); (2) data-encoding-induced concentration, where certain feature maps wash out class-conditional structure; and (3) probleminduced concentration, where cost functions effectively average over exponentially many degrees of freedom. For each mechanism, we derive explicit scaling laws for the gradient variance as a function of qubit count n, depth L, and encoding complexity. We show that appropriately constrained expressibility, locality, and symmetry breaking can prevent gradients from vanishing exponentially and obtain conditions under which gradients remain at worst polynomially small. This yields architectural and initialization design principles for plateau-resistant circuits, including shallow, problem-informed ansätze, layer-wise training, and structured data encodings. Numerical experiments on up to 100 qubits for VQE, QAOA, and quantum classifiers confirm our theoretical predictions and demonstrate 10-100× improvements in effective gradient magnitudes over standard architectures. Our framework subsumes existing barren plateau results and provides a practical toolkit for diagnosing and mitigating trainability issues in variational quantum algorithms.
Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices. These approaches typically involve the training of parameterized quantum circuits through a classical optimization loop. However, they often encounter challenges attributed to the exponentially diminishing gradient components, known as the barren plateau (BP) problem. This work introduces a novel optimization approach designed to alleviate the adverse effects of BPs during circuit training. In contrast to conventional gradient descent methods with a small learning parameter, our approach relies on making a finite hops along the search direction determined on a randomly chosen subsets of the free parameters. The optimization search direction, together with the range of the search, is determined by the distant features of the cost-function landscape. This enables the optimization path to navigate around barren plateaus without the need for external control mechanisms. We have successfully applied our optimization strategy to quantum circuits comprising 21 qubits and 15000 entangling gates, demonstrating robust resistance against BPs. Additionally, we have extended our optimization strategy by incorporating an evolutionary selection framework, enhancing its ability to avoid local minima in the landscape. The modified algorithm has been successfully utilized in quantum gate synthesis applications, showcasing a significantly improved efficiency in generating highly compressed quantum circuits compared to traditional gradient-based optimization approaches.
Variational quantum circuits have recently gained much interest due to their relevance in real-world applications, such as combinatorial optimizations, quantum simulations, and modeling a probability distribution. Despite their huge potential, the practical usefulness of those circuits beyond tens of qubits is largely questioned. One of the major problems is the so-called barren plateaus phenomenon. Quantum circuits with a random structure often have a flat cost-function landscape and thus cannot be trained efficiently. In this paper, we propose two novel parameter conditions in which the hardware-efficient ansatz (HEA) is free from barren plateaus for arbitrary circuit depths. In the first condition, the HEA approximates to a time-evolution operator generated by a local Hamiltonian. Utilizing a recent result by [Park and Killoran, Quantum 8, 1239 (2024)], we prove a constant lower bound of gradient magnitudes in any depth both for local and global observables. On the other hand, the HEA is within the many-body localized (MBL) phase in the second parameter condition. We argue that the HEA in this phase has a large gradient component for a local observable using a phenomenological model for the MBL system. By initializing the parameters of the HEA using these conditions, we show that our findings offer better overall performance in solving many-body Hamiltonians. Our results indicate that barren plateaus are not an issue when initial parameters are smartly chosen, and other factors, such as local minima or the expressivity of the circuit, are more crucial.
Recent advances in the variational quantum eigensolver (VQE) have strengthened its promise for molecular electronic-structure calculations on near-term noisy intermediate-scale quantum (NISQ) devices. However, barren plateaus (BPs) remain a major obstacle to scaling VQE, as vanishing gradients can severely obstruct optimization at large scale. While most BP studies focus on randomly initialized circuits and global gradient behavior, practical quantum chemistry VQE typically uses chemically motivated initializations and local optimization around HF- or MP2-derived states. Although chemically informed initializations are widely expected to improve VQE trainability, how they mitigate local barren plateaus remains unclear. We therefore study the occurrence of local barren plateaus in molecular UCCSD-VQE, considering both chemically motivated initialization points and iterates along the corresponding optimization trajectories. In the benchmarks considered here, chemically initialized starting points and variational trajectories show polynomial decay of local gradient variance with system size instead of the exponential BP-like decay observed for random controls, indicating that chemical initialization mitigates barren plateaus in the local optimization regions and highlights the trainability advantage of chemically motivated VQE strategies.