REVIEW 37 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
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.
Forward citations
Cited by 37 Pith papers
-
Trainability Beyond Linearity in Variational Quantum Objectives
The trainability boundary for variational quantum objectives is the affine regime; non-affine amplification-capable losses can mitigate barren plateaus when using coarse-grained statistics at polynomial widths.
-
DAGAF: A directed acyclic generative adversarial framework for joint structure learning and tabular data synthesis
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.
-
Long Range Frequency Tuning for QML
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...
-
Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach
A Pauli-transfer-matrix analysis of QELMs reveals the full set of nonlinear Pauli features generated by encoding and transformed by quantum channels, producing an interpretable classical nonlinear vector autoregressio...
-
Exploring nontrivial topology at quantum criticality in a superconducting processor
Experimental preparation of topologically nontrivial critical states of the cluster Ising model on a 100-qubit superconducting processor, verified by boundary g-function and two-fold entanglement spectrum degeneracy u...
-
QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
QKAN is a quantum algorithmic framework using block-encodings and QSVT to implement wide-and-shallow networks for quantum learning and compositional state preparation.
-
Diagnosing quantum reservoirs at scale based on expressivity and coverage
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.
-
Ravines in quantum cost landscapes: opportunities for improved VQA predictions
NEB-adapted ravine ensembles for QNNs classifying concentratable entanglement outperform naive methods when local-prediction variability is high and reduce costs, with ravines persisting under depth and qubit scaling.
-
On a Central Limit Theorem and Sanov's principle for quantum neural networks
Fluctuations of the empirical measure of parameters in a quantum neural network mixture of experts solve a linear transport equation as the number of experts diverges, with the MoE converging to a limit governed by th...
-
Continuous-variable ADAPT-VQE for bosonic lattice models
CV-ADAPT-VQE with tailored symmetry-preserving pools achieves significantly shallower circuits than Hamiltonian-based VQE for bosonic lattice models in GPU classical simulations.
-
Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
-
Scaling Quantum Machine Learning without Tricks: Full-Resolution and Diverse Image Generation
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.
-
Mitigating the barren plateau problem in linear optics
A dual-valued phase shifter in linear optics creates variational cost landscapes with fewer local minima and outperforms prior linear-optical variational algorithms by mitigating barren plateaus.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
-
Concentration-Free Quantum Kernel Learning in the Rydberg Blockade
A Rydberg blockade based quantum kernel is claimed to avoid exponential concentration while remaining classically hard to simulate.
-
Robust quantum reservoir computers for forecasting chaotic dynamics: generalized synchronization and stability
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.
-
How to use quantum computers for biomolecular free energies
A two-fold quantum embedding strategy combined with machine learning integrates accurate quantum-mechanical energies into free energy calculations for biomolecular complexes and analyzes requirements for quantum compu...
-
Resource-efficient equivariant quantum convolutional neural networks
Equivariant sp-QCNN encodes general symmetries with group theory, splits circuits at pooling layers to preserve symmetry while enabling parallel measurements, and shows improved efficiency and trainability over standa...
-
Quantum Convolutional Neural Networks are Effectively Classically Simulable
QCNNs are classically simulable via Pauli shadows on low-bodyness subspaces of locally-easy datasets, with explicit simulation demonstrated up to 1024 qubits for phases of matter classification.
-
Feasibility of performing quantum chemistry calculations on quantum computers
New criteria reveal VQE needs fault-tolerant quantum computers due to decoherence and QPE has exponentially suppressed success probability from orthogonality catastrophe in classical input states.
-
Intelligence-Guided Adaptive Purification for DDoS-Resilient Quantum Networks: A CUDA-Q based Study
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).
-
Gatekeepers and Hallucinations: A Layered Evaluation Framework for LLM-Driven Quantum Circuit Generation
A layered framework with physical gatekeepers, fidelity analysis against reference VQE circuits, and a consistency metric identifies five LLM failure modes in quantum circuit generation and reveals that some apparent ...
-
Quantum encodings that preserve persistent homology
Investigates which quantum encodings of classical datasets preserve persistent homology so that quantum algorithms can extract topological features directly from the data.
-
Thermodynamic-limit dispersion relations on trapped-ion quantum hardware
NLCE+QA on trapped-ion QPU computes TFIM thermodynamic-limit energies and dispersions using ASP, VQE, and a new CX-test.
-
Mitigating Barren Plateaus in Variational Quantum Circuits through PDE-Constrained Loss Functions
PDE-constrained loss functions in variational quantum circuits deliver polynomial gradient variance scaling and constraint-induced landscape narrowing to mitigate barren plateaus.
-
Long Range Frequency Tuning for QML
Starting trainable frequency prefactors at powers of three (ternary grid) lets angle-encoded quantum circuits fit target frequencies far from default initialization, reaching median R²=0.997 on synthetic shifted-frequ...
-
PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations
PauliEngine delivers a high-performance C++ backend for Pauli string multiplication, commutators, and symbolic tracking that outperforms existing tools in benchmarks.
-
From Qubits to Couplings: A Hybrid Quantum Machine Learning Framework for LHC Physics
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.
-
Multi-QIDA method for VQE state preparation in molecular systems
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 ...
-
CleanQRL: Lightweight Single-file Implementations of Quantum Reinforcement Learning Algorithms
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.
-
Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE
TETRIS-ADAPT-VQE achieves fidelities above 99.3% for SYK (N=20) and 99.9998% for SK (L=18) but requires large resources for SYK models.
-
Random Quantum Circuits as Seeds for Continuous Generative Models
A specific family of random quantum circuits is introduced that resists classical simulation and avoids local variable concentration, proposed as seeds for continuous generative models to support NISQ-compatible quant...
-
Mind the gaps: The fraught road to quantum advantage
The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.
-
Solving the compute crisis with physics-based ASICs
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.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
-
Deep Learning in Classical and Quantum Physics
A graduate-level lecture-note review of deep learning methods and their applications in classical and quantum physics, with hands-on examples.
-
Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
Review of quantum neural networks on gate-based quantum computers for molecular property prediction and generation in drug discovery.
Discussion (0). Sign in to comment.