Pith. sign in

REVIEW 12 cited by

Barren Plateaus in Variational Quantum Computing

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 2405.00781 v2 pith:IDJHNKMU submitted 2024-05-01 quant-ph cs.LGstat.ML

classification quant-phcs.LGstat.ML
keywords quantumbarrencomputingphenomenonvariationalwhenalgorithmansatz
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Variational quantum computing offers a flexible computational paradigm with applications in diverse areas. However, a key obstacle to realizing their potential is the Barren Plateau (BP) phenomenon. When a model exhibits a BP, its parameter optimization landscape becomes exponentially flat and featureless as the problem size increases. Importantly, all the moving pieces of an algorithm -- choices of ansatz, initial state, observable, loss function and hardware noise -- can lead to BPs when ill-suited. Due to the significant impact of BPs on trainability, researchers have dedicated considerable effort to develop theoretical and heuristic methods to understand and mitigate their effects. As a result, the study of BPs has become a thriving area of research, influencing and cross-fertilizing other fields such as quantum optimal control, tensor networks, and learning theory. This article provides a comprehensive review of the current understanding of the BP phenomenon.

Discussion (0). Sign in to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 29 citations worldwide. 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. Long Range Frequency Tuning for QML

    cs.LG 2026-02 unverdicted novelty 7.0 of 10

    Ternary grid initialization overcomes spectral gap suppression in trainable-frequency quantum circuits, achieving high accuracy on high-frequency synthetic benchmarks and real datasets where standard unary initializat...

  3. Diagnosing quantum reservoirs at scale based on expressivity and coverage

    quant-ph 2026-07 accept novelty 6.0 of 10

    Scalable ORS expressivity (top-K output probabilities vs Haar) plus effective feature rank jointly diagnose quantum-reservoir quality independent of Hilbert dimension and under hardware noise.

  4. Scaling Quantum Machine Learning without Tricks: Full-Resolution and Diverse Image Generation

    quant-ph 2026-02 conditional novelty 6.0 of 10

    A single end-to-end quantum generator using an image-tailored circuit and learnable multimodal noise achieves state-of-the-art simulated FID scores on full MNIST and Fashion-MNIST without tricks.

  5. Concentration-Free Quantum Kernel Learning in the Rydberg Blockade

    cond-mat.str-el 2025-08 unverdicted novelty 6.0 of 10

    A Rydberg blockade based quantum kernel is claimed to avoid exponential concentration while remaining classically hard to simulate.

  6. Robust quantum reservoir computers for forecasting chaotic dynamics: generalized synchronization and stability

    quant-ph 2025-06 conditional novelty 6.0 of 10

    Recurrence-free quantum reservoir computers have a constant, contractive Jacobian, which guarantees the echo state property and enables accurate inference of Lyapunov spectra and attractor dimensions.

  7. Intelligence-Guided Adaptive Purification for DDoS-Resilient Quantum Networks: A CUDA-Q based Study

    quant-ph 2026-07 conditional novelty 5.0 of 10

    IDS-driven adaptive purification in a simulated 8-node quantum repeater chain restores fidelity-qualified entanglement delivery under SSDP-induced degradation (0.098 to 0.344 above-target; oracle 0.335).

  8. From Qubits to Couplings: A Hybrid Quantum Machine Learning Framework for LHC Physics

    hep-ex 2025-11 reject novelty 5.0 of 10

    A hybrid quantum-classical classifier on simulated HH→bbγγ events claims 95% CL limits of 1.9–2.1×SM, but the gain over XGBoost is 21–29%, not the advertised factor of two.

  9. Multi-QIDA method for VQE state preparation in molecular systems

    quant-ph 2025-08 conditional novelty 5.0 of 10

    Multi-QIDA, a layered ansatz built from quantum mutual information of classical RCISD wavefunctions, outperforms the ladder hardware-efficient ansatz at matched CNOT count on five small molecular systems in noiseless ...

  10. CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms

    quant-ph 2025-07 conditional novelty 5.0 of 10

    The paper introduces CleanQRL, a collection of single-file implementations of quantum reinforcement learning algorithms designed to make QRL research easier to replicate and compare.

  11. Solving the compute crisis with physics-based ASICs

    cs.ET 2025-07 unverdicted novelty 4.0 of 10

    A coalition of academic and industry researchers argues that chips exploiting natural physical dynamics, rather than enforcing digital abstractions, could dramatically cut AI computing costs.

  12. 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