REVIEW 18 cited by
Does provable absence of barren plateaus imply classical simulability?
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
A large amount of effort has recently been put into understanding the barren plateau phenomenon. In this perspective article, we face the increasingly loud elephant in the room and ask a question that has been hinted at by many but not explicitly addressed: Can the structure that allows one to avoid barren plateaus also be leveraged to efficiently simulate the loss classically? We collect evidence-on a case-by-case basis-that many commonly used models whose loss landscapes avoid barren plateaus can also admit classical simulation, provided that one can collect some classical data from quantum devices during an initial data acquisition phase. This follows from the observation that barren plateaus result from a curse of dimensionality, and that current approaches for solving them end up encoding the problem into some small, classically simulable, subspaces. Thus, while stressing that quantum computers can be essential for collecting data, our analysis sheds doubt on the information processing capabilities of many parametrized quantum circuits with provably barren plateau-free landscapes. We end by discussing the (many) caveats in our arguments including the limitations of average case arguments, the role of smart initializations, models that fall outside our assumptions, the potential for provably superpolynomial advantages and the possibility that, once larger devices become available, parametrized quantum circuits could heuristically outperform our analytic expectations.
Forward citations
Cited by 18 Pith papers
-
A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
-
Architecture Shape Governs QNN Trainability: Jacobian Null Space Growth and Parameter Efficiency
At fixed encoding budget, serial QNN architectures suffer unbounded structural gradient starvation via rank(J) ≤ 2L+1 while parallel ones keep full Jacobian rank and better parameter efficiency when adding feature-map layers.
-
Local tensor-train surrogates for quantum learning models
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
-
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.
-
Exponential quantum advantage in processing massive classical data
A polylog-sized quantum computer achieves exponential advantage over classical machines in classification and dimension reduction of massive classical data using quantum oracle sketching combined with classical shadows.
-
Loss Behavior in Supervised Learning with Entangled States
Using maximally entangled training data exponentially flattens the loss landscape of highly expressive quantum models, limiting the loss improvement achievable in a fixed-size neighborhood.
-
Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
A layer-by-layer classical variational disentanglement algorithm compiles preparation circuits for matrix product states by minimizing bipartite entanglement to reduce bond dimensions.
-
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.
-
Stacking the Deck: Tunable Trainability in Stacked LCUs
Stacked LCUs of fermionic Gaussian unitaries give variance Ω(1/(n k^{3l})) against classical simulation O(k^{2l} n^3) and quantum gate count O(l k n^2), with layers l as the single dial.
-
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.
-
Pitfalls when tackling the exponential concentration of parameterized quantum models
Exponentially concentrated measurement outcomes are statistically indistinguishable from fixed noise after polynomial shots, so classical post-processing cannot fix them, and common proposed remedies do not escape this.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
-
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.
-
Optimal quantum reservoir learning in proximity to universality
A tunable mixing parameter p in random quantum circuits controls the transition from classically simulable to expressive quantum reservoir dynamics via entanglement and nonstabilizer content.
-
Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors
Classical surrogates using truncated trigonometric expansions emulate noisy quantum processors and cut measurement overhead in VQE pre-training and Floquet phase identification.
-
Perspectives on Utilization of Measurements in Quantum Algorithms
A survey that categorizes quantum measurement uses into static circuits, dynamic circuits, and challenge-solving techniques, and argues measurements deserve more attention in algorithm design.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
Discussion (0). Sign in to comment.