Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks
Authors:
- 14 March 2022
- journal article
- research article
- Published by Springer Nature in Nature Machine Intelligence
- Vol. 4 (3) , 269-278
Abstract
No abstract availableKeywords
All Related Versions
This publication has 53 references indexed in Scilit:
- Fidelity-Based Probabilistic Q-Learning for Control of Quantum SystemsIEEE Transactions on Neural Networks and Learning Systems, 2013
- Chopped random-basis quantum optimizationPhysical Review A, 2011
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum ComputationSIAM Review, 2008
- Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search2007
- Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiabilityPhysical Review A, 2005
- Adiabatic quantum computing for random satisfiability problemsPhysical Review A, 2003
- Quantum search by local adiabatic evolutionPhysical Review A, 2002
- Robustness of adiabatic quantum computationPhysical Review A, 2001
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994