Learning adiabatic quantum algorithms over optimization problems
- 3 January 2021
- journal article
- research article
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 3 (1) , 1-19
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- On learning Hamiltonian systems from dataChaos: An Interdisciplinary Journal of Nonlinear Science, 2019
- Machine learning & artificial intelligence in the quantum domain: a review of recent progressReports on Progress in Physics, 2018
- Adiabatic quantum computationReviews of Modern Physics, 2018
- Anderson localization makes adiabatic quantum optimization failProceedings of the National Academy of Sciences, 2010
- Adiabatic Quantum Computation is Equivalent to Standard Quantum ComputationSIAM Journal on Computing, 2007
- Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 2006
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Some Convergence Results for Probabilistic Tabu SearchINFORMS Journal on Computing, 1992
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing MethodsOperations Research, 1987
- Simulated annealing methods with general acceptance probabilitiesJournal of Applied Probability, 1987