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 $\mathrm{Var}[\partial C/\partial\theta]$ from \Samples{} random parameter vectors, using the parameter-shift rule. This variance is the label. A gradient-boosted regressor then predicts $\log_{10}\mathrm{Var}$ 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.
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 R2=\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 R2=\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.
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.
Parameterized quantum circuits used as variational ansatzes are emerging as promising tools to tackle complex problems ranging from quantum chemistry to combinatorial optimization.These variational quantum circuits can suffer from the well-known curse of barren plateaus, which is characterized by an exponential vanishing of the cost-function gradient with the system size, making training unfeasible for practical applications.Since a generic quantum circuit cannot be simulated efficiently, the determination of its trainability is an important problem.Here we find an efficient method to compute the gradient of the cost function and its variance for a wide class of variational quantum circuits.Our scheme relies on our proof of an exact mapping from randomly initialized circuits to a set of Clifford circuits that can be efficiently simulated on a classical computer by virtue of the celebrated Gottesman-Knill theorem.This method is scalable and can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren-plateau problem.As illustrative examples, we show results with up to 100 qubits.
The training of a parameterized model largely depends on the landscape of the underlying loss function. In particular, vanishing gradients are a central bottleneck in the scalability of variational quantum algorithms (VQAs), and are known to arise in various ways. However, a caveat of most existing gradient bound results is the requirement of t-design circuit assumptions that are typically not satisfied in practice. In this work, we loosen these assumptions altogether and derive tight upper and lower bounds on loss and gradient concentration for a large class of parameterized quantum circuits and arbitrary observables, which are significantly stronger than prior work. Moreover, we show that these bounds, as well as the variance of the loss itself, can be estimated efficiently and classically-providing practical tools to study the loss landscapes of VQA models, including verifying whether or not a circuit/observable induces barren plateaus. In particular, our results can readily be leveraged to rule out barren plateaus for a realistic class of ansätze and mixed observables, namely, observables containing a non-vanishing local term. This insight has direct implications for hybrid Quantum Generative Adversarial Networks (qGANs). We prove that designing the discriminator appropriately leads to 1-local weights that stay constant in the number of qubits, regardless of discriminator depth. This implies that qGANs with appropriately chosen generators do not suffer from barren plateaus even at scale-making them a promising candidate for applications in generative quantum machine learning. We demonstrate this result by training a qGAN to learn a 2D mixture of Gaussian distributions with up to 16 qubits, and provide numerical evidence that global contributions to the gradient, while initially exponentially small, may kick in substantially over the course of training.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
Variational quantum circuits train poorly on chaotic forecasting, usually blamed on barren plateaus (exponentially vanishing gradients). Using an exactly simulable four-qubit variational quantum physics-informed circuit fit to Lorenz-63, we show the barren-plateau explanation fails: the failure is an architectural capacity ceiling fixed by the circuit time-encoding, not its trainable depth. Four measurements support this. (i) A McClean-comparable gradient-variance estimator sits at the local-cost Haar/2-design scale 2^(-2n)=3.9e-3 at n=4; on structurally live parameters it decays about ninefold with depth then saturates there, large enough to train, not an exponential collapse. (ii) At a common budget of 200 optimiser iterations (600, in three stages, for layer-wise), gradient descent, layer-wise, and SPSA reach the same order of magnitude of loss, so no optimiser unlocks a better basin. (iii) The output-Jacobian rank saturates at 33 from five layers on, so depth buys no new output directions. (iv) A Fourier analysis explains why: the qubit-1 phase encoding acts on the initial |0> and is inert, so the maximum accessible frequency is 2.5/t_max=0.83 Hz, identical at every depth and about 4.4x below the narrowest Lorenz component bandwidth. The corrected band has dimension 1+2x5=11 per observable, and 3x11=33 equals the measured rank ceiling exactly, unifying the two diagnostics. A trained depth sweep agrees: mean loss improves with depth then flattens once the rank saturates. We correct our earlier preprint diagnosis, which compared unnormalised gradient norms to the McClean threshold, and place the advantage of fixed reservoirs and classical echo-state networks in architecture, not quantum mechanics.
Abstract A new paradigm for data science has emerged, with quantum data, quantum models, and quantum computational devices. This field, called quantum machine learning (QML), aims to achieve a speedup over traditional machine learning for data analysis. However, its success usually hinges on efficiently training the parameters in quantum neural networks, and the field of QML is still lacking theoretical scaling results for their trainability. Some trainability results have been proven for a closely related field called variational quantum algorithms (VQAs). While both fields involve training a parametrized quantum circuit, there are crucial differences that make the results for one setting not readily applicable to the other. In this work, we bridge the two frameworks and show that gradient scaling results for VQAs can also be applied to study the gradient scaling of QML models. Our results indicate that features deemed detrimental for VQA trainability can also lead to issues such as barren plateaus in QML. Consequently, our work has implications for several QML proposals in the literature. In addition, we provide theoretical and numerical evidence that QML models exhibit further trainability issues not present in VQAs, arising from the use of a training dataset. We refer to these as dataset-induced barren plateaus. These results are most relevant when dealing with classical data, as here the choice of embedding scheme (i.e., the map between classical data and quantum states) can greatly affect the gradient scaling.