Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators. The barren plateau problem represents one of the major bottlenecks for parametrized quantum circuits algorithms. Here, the authors study the known sources of BP using the lens of Lie algebraic theory, finding an expression of the variance of the loss function depending on the dynamical Lie algebra of the circuit.
Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators. The barren plateau problem represents one of the major bottlenecks for parametrized quantum circuits algorithms. Here, the authors study the known sources of BP using the lens of Lie algebraic theory, finding an expression of the variance of the loss function depending on the dynamical Lie algebra of the circuit.
Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization. However, its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem. While significant progress has been made and prior work has separately analyzed barren plateaus in unitary and noisy settings, their combined impact remains poorly understood, largely due to limitations in conventional Lie-algebraic approaches. In this work, we introduce an analytical framework based on non-negative matrix theory that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels. This approach enables the derivation of exact expressions in the deep-circuit regime, uncovering the complex interplay between unitary layers and noise. Notably, we identify a noise-induced absorption mechanism—a phenomenon absent in purely unitary dynamics—which provides new insight into how noise shapes circuit behavior. We further present a controlled convergence analysis, establishing general lower bounds on the variance of both deep and shallow circuits. This leads to a principled connection between noise resilience and the expressive capacity of parameterized quantum circuits, particularly under smart initialization strategies. Our theoretical results are supported by numerical simulations and illustrative applications.
Barren plateaus have emerged as a pivotal challenge for variational quantum computing. Our understanding of this phenomenon underwent a transformative shift with the recent introduction of a Lie algebraic theory capable of explaining most sources of barren plateaus. However, this theory requires either initial states or observables that lie in the circuit's Lie algebra. Focusing on parametrized matchgate circuits, in this work we are able to go beyond this assumption and provide an exact formula for the loss function variance that is valid for arbitrary input states and measurements. Our results reveal that new phenomena emerge when the Lie algebra constraint is relaxed. For instance, we find that the variance does not necessarily vanish inversely with the Lie algebra's dimension. Instead, this measure of expressiveness is replaced by a generalized expressiveness quantity: The dimension of the Lie group modules. By characterizing the operators in these modules as products of Majorana operators, we can introduce a precise notion of generalized globality and show that measuring generalized-global operators leads to barren plateaus. Our work also provides operational meaning to the generalized entanglement as we connect it with known fermionic entanglement measures, and show that it satisfies a monogamy relation. Finally, while parameterized matchgate circuits are not efficiently simulable in general, our results suggest that the structure allowing for trainability may also lead to classical simulability.
The scalability of variational quantum algorithms is fundamentally limited by the barren plateau effect, where the cost-function variance vanishes with system size, rendering optimization impractical. Recent Lie-algebraic approaches for deep parameterized have enabled a unified analytical understanding of this challenge but require either the initial state or the measurement observable to belong to the dynamical Lie algebra generated by the circuit. Here, we introduce a representation-theoretic framework under 2-design hypothesis showing that variational quantum landscapes admit a natural decomposition into irreducible representation channels. This yields exact expressions and analytical bounds for the cost-function variance applicable to arbitrary initial states and observables, with previous Lie-algebraic results emerging as a special case. We illustrate the framework by analyzing the energy landscape of the one-dimensional ANNNI model for several circuit architectures, revealing trainability regimes inaccessible to existing methods. Our results establish a general representation-theoretic framework for analyzing variational quantum landscapes, substantially extending the analytical theory of barren plateaus.
Dynamical Lie algebras (DLAs) have emerged as a valuable tool in the study of parameterized quantum circuits, helping to characterize both their expressiveness and trainability. In particular, the absence or presence of barren plateaus (BPs) – flat regions in parameter space that prevent the efficient training of variational quantum algorithms – has recently been shown to be intimately related to quantities derived from the associated DLA.In this work, we investigate DLAs for the quantum approximate optimization algorithm (QAOA), one of the most studied variational quantum algorithms for solving graph MaxCut and other combinatorial optimization problems. While DLAs for QAOA circuits have been studied before, existing results have either been based on numerical evidence, or else correspond to DLA generators specifically chosen to be universal for quantum computation on a subspace of states. We initiate an analytical study of barren plateaus and other statistics of QAOA algorithms, and give bounds on the dimensions of the corresponding DLAs and their centers for general graphs. We then focus on the n -vertex cycle and complete graphs. For the cycle graph we give an explicit basis, identify its decomposition into the direct sum of a 2 -dimensional center and a semisimple component isomorphic to n − 1 copies of s u ( 2 ) . We give an explicit basis for this isomorphism, and a closed-form expression for the variance of the cost function, proving the absence of BPs. For the complete graph we prove that the dimension of the DLA is O ( n 3 ) and give an explicit basis for the DLA.
Parameterized quantum circuits (PQCs) are central to quantum machine learning and near-term quantum simulation, but their scalability is often hindered by barren plateaus (BPs), where gradients decay exponentially with system size. Prior explanations, including expressivity, entanglement, locality, and noise, are often presented in ways that conflate two distinct issues: concentration of the measured observable and loss of parameter sensitivity caused by circuit dynamics.We develop a unified statistical framework that separates these mechanisms. We show that several standard BP explanations, including locality- and entanglement-related effects, can be understood through a single phenomenon that we term observable concentration (OC). Importantly, we prove that avoiding OC is necessary but not sufficient for trainability. Beyond OC, we identify two distinct mid-circuit sources of gradient suppression. First, in circuits with effectively independent forward and backward blocks, parameter perturbations can propagate outside the measurement light cone and become inaccessible to the final observable, yielding information-loss-induced BPs. Second, BPs can also arise in circuits with highly correlated forward and backward blocks, as we demonstrate through an echo-type circuit model that is reminiscent of information scrambling.
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.