Barren plateaus in variational quantum circuits are commonly attributed to strong mixing dynamics that cause gradient variance to vanish exponentially with system size. Passive photonic circuits, central to linear optical quantum computing, challenge this picture: although their Hilbert space can be exponentially large, their dynamics are constrained to a Lie algebra whose dimension scales as the square of the number of modes. In photonic systems, postselection also plays a central role, with gradient concentration governed not by the Hilbert-space dimension but by how it reshapes the effective observable. Through exact statevector simulations, we compare allow-bunching evolution, collision-free filtering, and dual-rail postselection. In the allow-bunching and collision-free regimes, gradient variance remains consistent with polynomial rather than exponential decay over the tested system sizes. By contrast, dual-rail postselection induces exponential concentration beyond moderate system sizes, robustly across three initialization ensembles. These results indicate that photonic barren plateaus are governed by the interplay between passive linear-optical dynamics, postselection geometry, and task observables, offering practical guidance for designing near-term photonic variational architectures.
Comments
7 pages, 4 figures. Submitted to the review process of the 2026 IEEE International Conference on Quantum Computing and Engineering (QCE26)
Barren plateaus in variational quantum circuits are commonly attributed to strong mixing dynamics that cause gradient variance to vanish exponentially with system size. Passive photonic circuits, central to linear optical quantum computing, challenge this picture: although their Hilbert space can be exponentially large, their dynamics are constrained to a Lie algebra whose dimension scales as the square of the number of modes. In photonic systems, postselection also plays a central role, with gradient concentration governed not by the Hilbert-space dimension but by how it reshapes the effective observable. Through exact statevector simulations, we compare allow-bunching evolution, collision-free filtering, and dual-rail postselection. In the allow-bunching and collision-free regimes, gradient variance remains consistent with polynomial rather than exponential decay over the tested system sizes. By contrast, dual-rail postselection induces exponential concentration beyond moderate system sizes, robustly across three initialization ensembles. These results indicate that photonic barren plateaus are governed by the interplay between passive linear-optical dynamics, postselection geometry, and task observables, offering practical guidance for designing near-term photonic variational architectures.
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.
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.
Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape. Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of sample variance to circuit variance. This ratio determines the number of circuit samples required to resolve local loss differences and gradients to proportional accuracy. We apply this framework to photon-number observables and identify both trainable and non-trainable regimes. Supported by analytic results and a numerically observed polynomial decay of the circuit variance, we find that fixed-order photon-number polynomials require only polynomially many samples as the system size grows, whereas high-order polynomials and observables based on output probabilities generally require exponentially many samples. Within the trainable regime, we further identify classes of observables in which quantum estimation achieves a polynomial speed-up over multiple classical methods. Within this family, neural network observables provide one practical construction that allow measurement outcomes to be efficiently processed into the desired polynomial. These results establish photonic variational quantum computing as a promising platform for near-term applications.
The barren plateau (BP) phenomenon poses a fundamental challenge to the trainability of variational quantum eigensolvers (VQEs) by causing exponentially vanishing gradients as the system size increases. While extensive studies have investigated the geometric origins of BP, its impact on the optimization dynamics and complexity of practical algorithms under finite-shot measurements has received comparatively less attention. In this paper, we develop a theoretical framework that characterizes how the BP affects the optimization dynamics of the Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm and quantifies the resulting iteration complexity and measurement budget. We derive non-asymptotic bias and variance bounds for the SPSA gradient estimator, introduce a signal-to-noise ratio (SNR) defined as the ratio of the gradient energy to the mean squared error of the estimator, and establish convergence guarantees for SPSA under finite-shot measurements. Our results show that, under the proposed parameter schedules, the number of iterations sufficient to guarantee a fixed relative first-order stationarity level scales polynomially with the inverse of the intrinsic gradient energy. Consequently, when this energy decays exponentially under BP, the resulting guaranteed iteration complexity and total measurement budget both grow exponentially with the number of qubits.
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.
Abstract Barren plateaus are the main obstacle to training quantum machine-learning models. On a barren plateau, the cost-function gradient shrinks exponentially as the circuit grows, and training stalls. Today the only reliable test is to measure it. That means sampling many gradients for every candidate circuit, which is expensive. We ask a different question. Can a classical model predict trainability from the circuit architecture alone? The architecture here means qubit count, depth, ansatz type, entanglement pattern, entangler gate, and cost-observable locality. We test this directly. We use an exact statevector simulator to build a dataset of \Nrows{} random variational circuits. For each circuit we estimate the gradient variance Var[∂C/∂θ] from \Samples{} random parameter vectors, using the parameter-shift rule. This variance is the label. A gradient-boosted regressor then predicts log10Var with $R^2 = \RsqHold{}$ on held-out architectures. A classifier separates barren from trainable circuits with an area under the ROC curve of \AucHold{}. We also test transfer to larger circuits. We train only on small circuits and test on the two largest unseen sizes (n=11,12). The model still reaches $R^2 = \RsqExtrap{}$. Permutation importance then recovers established theory. Cost-observable locality and entanglement structure matter most. We make no quantum-advantage claim. This is classical machine learning about quantum circuits. It offers a cheap way to screen ans\"atze, and it shows which design choices cause untrainability.