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× fewer parameters, and for VQE on
H2 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
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
u(n) and is surjective onto
U(n) via Givens rotations, enabling Haar initialization. Two-body correlator readouts achieve gradient variance
Θ(k3/n5), 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
∼1015 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(n2) gradients from
4kn circuit evaluations per step, a factor
n/k reduction over the standard rule's
4n2, growing linearly with
n at fixed
k.
The unitary butterfly targets all-to-all hardware, with
2logn layers of parallel gates and
(3/2)nlogn parameters, similar hardness guarantees, and
4klogn 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
Θ(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/∂θ] 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.