Pith. sign in

REVIEW 6 cited by

A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.09342 v3 pith:QXLXSRME submitted 2023-09-17 quant-ph

classification quant-ph
keywords quantumcircuitlossalgebraicbarrencircuitsdeepfunction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DAGAF: A directed acyclic generative adversarial framework for joint structure learning and tabular data synthesis

    cs.LG 2026-04 conditional novelty 7.0 of 10

    A data-agnostic circuit harmonic matrix C factorises Fourier-coefficient statistics and quantum neural tangent kernels for a broad class of re-uploading parametrised quantum circuits.

  2. Exploiting biased noise in variational quantum models

    quant-ph 2025-10 conditional novelty 6.0 of 10

    Twirling amplitude-damping noise into uniform Pauli/depolarising channels reduces expressivity and gradient magnitudes, while preserving the noise bias yields better VQA optimisation in the studied models.

  3. Variational optical phase learning on a continuous-variable quantum compiler

    quant-ph 2025-02 conditional novelty 6.0 of 10

    An experimental continuous-variable quantum compiler learns an optical phase with two-mode squeezed light, and increasing the squeezing sharpens the cost landscape, improving precision and training speed.

  4. Out of Tune: Demystifying Noise-Effects on Quantum Fourier Models

    quant-ph 2025-06 conditional novelty 5.0 of 10

    Noise, especially decoherent gate errors, systematically reduces Fourier coefficient magnitudes, expressibility, and entangling capability of quantum Fourier models, with circuit architecture and encoding modulating t...

  5. Clique detection using symmetry-restricted quantum circuits

    quant-ph 2025-06 reject novelty 4.0 of 10

    Permutation-invariant quantum circuits label cliques in small random graphs more accurately than cyclic-invariant or standard ansatze in simulation.

  6. Deep Learning in Classical and Quantum Physics

    quant-ph 2025-08 unverdicted novelty 2.0 of 10

    A graduate-level lecture-note review of deep learning methods and their applications in classical and quantum physics, with hands-on examples.

Pith tools