On barren plateaus and cost function locality in variational quantum algorithms
From MaRDI portal
Publication:5874151
DOI10.1088/1751-8121/ABFAC7OpenAlexW3165717557MaRDI QIDQ5874151FDOQ5874151
Publication date: 7 February 2023
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.10530
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 (4)
- Impact of barren plateaus countermeasures on the quantum neural network capacity to learn
- Quantum Monte Carlo for economics: stress testing and macroeconomic deep learning
- A copositive framework for analysis of hybrid Ising-classical algorithms
- The variational quantum eigensolver: a review of methods and best practices
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)