Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.24686

Stacking the Deck: Tunable Trainability in Stacked LCUs

Nikhil Khatri, Stefan Zohren, Gabriel Matos

quant-phcs.LGSubmitted Jul 27, 2026• Announced Jul 28, 2026• 1 citation
arXivHTMLPDF

Abstract

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures that provably rule out barren plateaus typically render them classically simulable. We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability. Using a diagrammatic analysis, we bound the loss-landscape variance of the Free Fermion S-LCU, whose elements are fermionic Gaussian unitaries. We prove a variance lower bound of $Ω(1/(n k^{3l}))$, with a simulation cost of $O(k^{2l} n^3)$ using the best known classical algorithm, compared to a quantum gate complexity of only $O(lkn^2)$. The number of layers $l$ serves as a single dial that trades computational complexity against the rate of cost concentration. This offers practitioners a systematic method for constructing ansätze with a complexity-trainability trade-off that best suits their application and hardware.

Comments
19 pages

Related papers

Trainability of Parametrised Linear Combinations of Unitaries

Nikhil Khatri, Stefan Zohren, Gabriel Matos

A principal concern in the optimisation of parametrised quantum circuits is the presence of barren plateaus, which present fundamental challenges to the scalability of applications, such as variational algorithms and quantum machine learning models. Recent proposals for these methods have increasingly used the linear combination of unitaries (LCU) procedure as a core component. In this work, we prove that an LCU of trainable parametrised circuits is still trainable. We do so by analytically deriving the expression for the variance of the expectation when applying the LCU to a set of parametrised circuits, taking into account the postselection probability. These results extend to incoherent superpositions. We support our conclusions with numerical results on linear combinations of fermionic Gaussian unitaries (matchgate circuits). Our work shows that sums of trainable parametrised circuits are still trainable, and thus provides a method to construct new families of more expressive trainable circuits. We argue that there is a scope for a quantum speed-up when evaluating these trainable circuits on a quantum device.

arXiv:2506.22310•Jun 27, 2025•3 citations

How to find expressible and trainable parameterized quantum circuits?

Peter Röseler, Dennis Willsch, Kristel Michielsen

Whether parameterized quantum circuits (PQCs) can be systematically constructed to be both trainable and expressive remains an open question. Highly expressive PQCs often exhibit barren plateaus, while several trainable alternatives admit efficient classical simulation. We address this question by deriving a finite-sample, dimension-independent concentration bound for estimating the variance of a PQC cost function, yielding explicit trainability guarantees. Across commonly used ansätze, we observe an anticorrelation between trainability and expressibility, consistent with theoretical insights. Building on this observation, we propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility. We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms. We identify quantum neural network ansätze with improved effective dimension using over $6 \times$ fewer parameters, and for VQE on $\mathrm{H}_2$ we achieve UCCSD-like accuracy at substantially reduced circuit complexity.

quant-pharXiv:2603.14451•Mar 17, 2026•7 citations

Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency

Iordanis Kerenidis

Scalable parameterized quantum circuits for machine learning face three obstacles: barren plateaus, no guarantee the learned function class is classically hard, and prohibitive circuit evaluations per gradient step. We propose the unitary brick-wall: a $k$-particle fermionic architecture for nearest-neighbor hardware, combining Reconfigurable Beam Splitters with interleaved single-qubit phases and a non-Gaussian magic-state encoding, where $k$ trades classical hardness against training cost. Trainable. The brick-wall has dynamical Lie algebra $\mathfrak{u}(n)$ and is surjective onto $U(n)$ via Givens rotations, enabling Haar initialization. Two-body correlator readouts achieve gradient variance $Θ(k^3/n^5)$, polynomial in $n$ throughout $n-2k=Ω(n)$. Expressive. Hardness is controlled by $k$: best-known classical sampling runs in time $2^{Θ(k)}$, worst-case #P-hardness holds from $k=n^ε$, and the average-case machinery of Fermion Sampling applies at $k=Θ(n)$. The sampler is input-dependent, so costs are paid per query: at our operating point $k=100$ one query needs $\sim 10^{15}$ operations, beyond commercial query rates, and at $k=120$ an exascale machine sustains under one query per second. Efficient. A multi-layer parallel parameter-shift rule computes all $O(n^2)$ gradients from $4kn$ circuit evaluations per step, a factor $n/k$ reduction over the standard rule's $4n^2$, growing linearly with $n$ at fixed $k$. The unitary butterfly targets all-to-all hardware, with $2\log n$ layers of parallel gates and $(3/2)n\log n$ parameters, similar hardness guarantees, and $4k\log n$ evaluations per step -- the same factor-$n/k$ reduction. Its trainability holds at two levels: absence of exponential barren plateaus is unconditional, while the sharp $Θ(k^3/n^5)$ rate needs a conjectured scalar comparison with the two-particle Haar second moment.

quant-pharXiv:2607.24014•Jul 28, 2026•7 citations

Efficient Estimation of Trainability for Variational Quantum Circuits

Valentin Heyraud, Zejian Li, Kaelan Donatella +2 more

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.

arXiv:2302.04649•PRX Quantum•Dec 4, 2023•32 citations

Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus

Zoë Holmes, Kunal Sharma, Marco Cerezo +1 more

Parametrized quantum circuits serve as ansatze for solving variational problems and provide a flexible paradigm for the programming of near-term quantum computers.Ideally, such ansatze should be highly expressive, so that a close approximation of the desired solution can be accessed.On the other hand, the ansatz must also have sufficiently large gradients to allow for training.Here, we derive a fundamental relationship between these two essential properties: expressibility and trainability.This is done by extending the well-established barren plateau phenomenon, which holds for ansatze that form exact 2-designs, to arbitrary ansatze.Specifically, we calculate the variance in the cost gradient in terms of the expressibility of the ansatz, as measured by its distance from being a 2-design.Our resulting bounds indicate that highly expressive ansatze exhibit flatter cost landscapes and therefore will be harder to train.Furthermore, we provide numerics illustrating the effect of expressibility on gradient scalings and we discuss the implications for designing strategies to avoid barren plateaus.

arXiv:2101.02138•PRX Quantum•Jan 24, 2022•733 citations

Predictingthe Trainability of Variational Quantum Circuits: A Data-Driven Model for BarrenPlateaus

Md Habibur Rahman

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.

•Aug 19, 2026•0 citations
Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures that provably rule out barren plateaus typically render them classically simulable. We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability. Using a diagrammatic analysis, we bound the loss-landscape variance of the Free Fermion S-LCU, whose elements are fermionic Gaussian unitaries. We prove a variance lower bound of Ω(1/(nk3l))Ω(1/(n k^{3l}))Ω(1/(nk3l)), with a simulation cost of O(k2ln3)O(k^{2l} n^3)O(k2ln3) using the best known classical algorithm, compared to a quantum gate complexity of only O(lkn2)O(lkn^2)O(lkn2). The number of layers lll serves as a single dial that trades computational complexity against the rate of cost concentration. This offers practitioners a systematic method for constructing ansätze with a complexity-trainability trade-off that best suits their application and hardware.
A principal concern in the optimisation of parametrised quantum circuits is the presence of barren plateaus, which present fundamental challenges to the scalability of applications, such as variational algorithms and quantum machine learning models. Recent proposals for these methods have increasingly used the linear combination of unitaries (LCU) procedure as a core component. In this work, we prove that an LCU of trainable parametrised circuits is still trainable. We do so by analytically deriving the expression for the variance of the expectation when applying the LCU to a set of parametrised circuits, taking into account the postselection probability. These results extend to incoherent superpositions. We support our conclusions with numerical results on linear combinations of fermionic Gaussian unitaries (matchgate circuits). Our work shows that sums of trainable parametrised circuits are still trainable, and thus provides a method to construct new families of more expressive trainable circuits. We argue that there is a scope for a quantum speed-up when evaluating these trainable circuits on a quantum device.
Whether parameterized quantum circuits (PQCs) can be systematically constructed to be both trainable and expressive remains an open question. Highly expressive PQCs often exhibit barren plateaus, while several trainable alternatives admit efficient classical simulation. We address this question by deriving a finite-sample, dimension-independent concentration bound for estimating the variance of a PQC cost function, yielding explicit trainability guarantees. Across commonly used ansätze, we observe an anticorrelation between trainability and expressibility, consistent with theoretical insights. Building on this observation, we propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility. We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms. We identify quantum neural network ansätze with improved effective dimension using over 6×6 \times6× fewer parameters, and for VQE on H2\mathrm{H}_2H2​ we achieve UCCSD-like accuracy at substantially reduced circuit complexity.
Scalable parameterized quantum circuits for machine learning face three obstacles: barren plateaus, no guarantee the learned function class is classically hard, and prohibitive circuit evaluations per gradient step. We propose the unitary brick-wall: a kkk-particle fermionic architecture for nearest-neighbor hardware, combining Reconfigurable Beam Splitters with interleaved single-qubit phases and a non-Gaussian magic-state encoding, where kkk trades classical hardness against training cost. Trainable. The brick-wall has dynamical Lie algebra u(n)\mathfrak{u}(n)u(n) and is surjective onto U(n)U(n)U(n) via Givens rotations, enabling Haar initialization. Two-body correlator readouts achieve gradient variance Θ(k3/n5)Θ(k^3/n^5)Θ(k3/n5), polynomial in nnn throughout n−2k=Ω(n)n-2k=Ω(n)n−2k=Ω(n). Expressive. Hardness is controlled by kkk: best-known classical sampling runs in time 2Θ(k)2^{Θ(k)}2Θ(k), worst-case #P-hardness holds from k=nεk=n^εk=nε, and the average-case machinery of Fermion Sampling applies at k=Θ(n)k=Θ(n)k=Θ(n). The sampler is input-dependent, so costs are paid per query: at our operating point k=100k=100k=100 one query needs ∼1015\sim 10^{15}∼1015 operations, beyond commercial query rates, and at k=120k=120k=120 an exascale machine sustains under one query per second. Efficient. A multi-layer parallel parameter-shift rule computes all O(n2)O(n^2)O(n2) gradients from 4kn4kn4kn circuit evaluations per step, a factor n/kn/kn/k reduction over the standard rule's 4n24n^24n2, growing linearly with nnn at fixed kkk. The unitary butterfly targets all-to-all hardware, with 2log⁡n2\log n2logn layers of parallel gates and (3/2)nlog⁡n(3/2)n\log n(3/2)nlogn parameters, similar hardness guarantees, and 4klog⁡n4k\log n4klogn evaluations per step -- the same factor-n/kn/kn/k reduction. Its trainability holds at two levels: absence of exponential barren plateaus is unconditional, while the sharp Θ(k3/n5)Θ(k^3/n^5)Θ(k3/n5) rate needs a conjectured scalar comparison with the two-particle Haar second moment.
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.
Parametrized quantum circuits serve as ansatze for solving variational problems and provide a flexible paradigm for the programming of near-term quantum computers.Ideally, such ansatze should be highly expressive, so that a close approximation of the desired solution can be accessed.On the other hand, the ansatz must also have sufficiently large gradients to allow for training.Here, we derive a fundamental relationship between these two essential properties: expressibility and trainability.This is done by extending the well-established barren plateau phenomenon, which holds for ansatze that form exact 2-designs, to arbitrary ansatze.Specifically, we calculate the variance in the cost gradient in terms of the expressibility of the ansatz, as measured by its distance from being a 2-design.Our resulting bounds indicate that highly expressive ansatze exhibit flatter cost landscapes and therefore will be harder to train.Furthermore, we provide numerics illustrating the effect of expressibility on gradient scalings and we discuss the implications for designing strategies to avoid barren plateaus.
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/∂θ]\mathrm{Var}[\partial C/\partial\theta]Var[∂C/∂θ] from \Samples{} random parameter vectors, using the parameter-shift rule. This variance is the label. A gradient-boosted regressor then predicts log⁡10Var\log_{10}\mathrm{Var}log10​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,12n=11,12n=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.