On barren plateaus and cost function locality in variational quantum algorithms
From MaRDI portal
Publication:5874151
Recommendations
- Variational quantum algorithms for trace norms and their applications
- Quantum separation of local search and fixed point computation
- Quantum Separation of Local Search and Fixed Point Computation
- On the universality of the quantum approximate optimization algorithm
- Tight bounds for randomized and quantum local search
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- The theory of variational hybrid quantum-classical algorithms
- An introduction to variational quantum algorithms for combinatorial optimization problems
- Variational Quantum Eigensolver and Its Applications
- Bounding Run-Times of Local Adiabatic Algorithms
Cites work
Cited in
(7)- The variational quantum eigensolver: a review of methods and best practices
- Quantum Monte Carlo for economics: stress testing and macroeconomic deep learning
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Optimizing quantum optimization algorithms via faster quantum gradient computation
- Quantum chaos and circuit parameter optimization
- Barren plateaus from learning scramblers with local cost functions
- Impact of barren plateaus countermeasures on the quantum neural network capacity to learn
This page was built for publication: On barren plateaus and cost function locality in variational quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874151)