ArticleNature communications2021
Cost function dependent barren plateaus in shallow parametrized quantum circuits.
Article in Nature communications, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 58 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
58 citing papers in PubMed.
- Evidence of scaling advantage on an NP-complete problem with enhanced quantum solvers.Nature computational science · 2026Article
- Probing entanglement scaling across a quantum phase transition on a quantum computer.Nature communications · 2026Article
- SPA-QNAS: Improving Search Efficiency and Stability in Evolutionary Quantum Neural Architecture Search.Entropy (Basel, Switzerland) · 2026Article
- Tensor network-based gene regulatory network inference for single-cell transcriptomic data.iScience · 2026Article
- Quantum Computing in a Diagnostic-First Quantum Residual Boosting Framework for Clinical Survival Analysis in Oncology and Cardiology.Journal of clinical medicine · 2026Article
- Benchmarking Barren Plateau Mitigation Strategies in Quantum Neural Networks on Standard and Medical Image Datasets.Journal of imaging · 2026Article
- Strategic Data Re-Uploads: A Pathway to Improved Quantum Classification Data Re-Uploading Strategies for Improved Quantum Classifier Performance.Entropy (Basel, Switzerland) · 2026Article
- Quantum computing applications in drug discovery.Briefings in bioinformatics · 2026Review
- Quantum ensembling methods for healthcare and life science.Briefings in bioinformatics · 2026Article
- Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits.National science review · 2026Article
- Quantum linear solvers for scientific computing: a comparison of VQLS, HHL and quantum annealing on time-fractional diffusion problems.Scientific reports · 2026Article
- Impact of measurement noise on escaping saddles in variational quantum algorithms.Scientific reports · 2026Article
- Quantum kernel methods for marketing analytics with convergence theory and separation bounds.Scientific reports · 2026Article
- A large scale statistical analysis of quantum and classical neural networks in the medical domain.Scientific reports · 2026Article
- Noise-induced shallow circuits and the absence of barren plateaus.Nature physics · 2026Article
- PsiAudit: An open-source toolkit for auditing symmetry-organised complexity in equivariant quantum neural networks.PloS one · 2026Article
- Beyond real: alternative unitary cluster Jastrow models for molecular electronic structure calculations on near-term quantum computers.Chemical science · 2025Article
- Generating three-dimensional genome structures with a variational quantum algorithm.Briefings in bioinformatics · 2025Article
- Surrogate optimization of variational quantum circuits.Proceedings of the National Academy of Sciences of the United States of America · 2025Article
- A repetitive amplitude encoding method for enhancing the mapping ability of quantum neural networks.Scientific reports · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized quantum circuit V(θ) to minimize a cost function C. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming V(θ) is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining C in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when V(θ) is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining C with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of V(θ) is [Formula: see text]. Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.