REVIEW 11 cited by
A unifying account of warm start guarantees for patches of quantum landscapes
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
A unifying account of warm start guarantees for patches of quantum landscapes
read the original abstract
Barren plateaus are fundamentally a statement about quantum loss landscapes on average but there can, and generally will, exist patches of barren plateau landscapes with substantial gradients. Previous work has studied certain classes of parameterized quantum circuits and found example regions where gradients vanish at worst polynomially in system size. Here we present a general bound that unifies all these previous cases and that can tackle physically-motivated ans\"atze that could not be analyzed previously. Concretely, we analytically prove a lower-bound on the variance of the loss that can be used to show that in a non-exponentially narrow region around a point with curvature the loss variance cannot decay exponentially fast. This result is complemented by numerics and an upper-bound that suggest that any loss function with a barren plateau will have exponentially vanishing gradients in any constant radius subregion. Our work thus suggests that while there are hopes to be able to warm-start variational quantum algorithms, any initialization strategy that cannot get increasingly close to the region of attraction with increasing problem size is likely inadequate.
Forward citations
Cited by 11 Pith papers
-
Exponentially many initializations to avoid barren plateaus
A first-moment operator diagnostic reveals exponentially many inequivalent initialization distributions avoid barren plateaus in variational quantum algorithms, with numerics indicating distinct attained minima.
-
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.
-
Accelerating Inference for Multilayer Neural Networks with Quantum Computers
Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.
-
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.
-
The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization
The paper decomposes dynamical Lie algebras of XY-mixer topologies and demonstrates warm-starting QAOA via pre-training on restricted generators to improve convergence on constrained optimization problems.
-
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.
-
Quantum computation at the edge of chaos
Topological entanglement entropy regularizes variational quantum algorithms to enforce quantum sparsity and operate at the edge of chaos for better trainability.
-
Pulsed learning for quantum data re-uploading models
A pulse-level data re-uploading classifier outperforms its gate-based counterpart in noisy superconducting-qubit simulation.
-
Optimizing resource allocation for accuracy in noisy variational quantum algorithms
A simulation-derived phenomenological model optimizes the trade-off between quantum circuit size and iteration count to minimize total gate operations for a desired accuracy in noisy VQE algorithms.
-
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.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.