Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks
Lists
Only you see this
Abstract
Quantum annealers are computational models implemented on quantum hardware that can efficiently solve combinatorial optimization problems. Annealing schedules with enhanced performance can be discovered with a Monte Carlo tree search algorithm and an enhanced version incorporating value and policy neural networks—as inspired by DeepMind’s AlphaZero.
BibTeX
@article{chen2022optimizing,
author = {Yu-Qin Chen and Yu Chen and Chee-Kong Lee and Shengyu Zhang and Chang-Yu Hsieh},
title = {{Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks}},
journal = {Nat. Mach. Intell.},
year = {2022},
doi = {10.1038/s42256-022-00446-y},
}| Monte Carlo Tree Search based Hybrid Optimization of Variational Quantum Circuits | Msml · 2022 |
| A Hybrid Quantum-Classical Approach to Solving Scheduling Problems | Proceedings of the International Symposium on Combinatorial Search · 2021 |
| Recognizing good variational quantum circuits with Monte Carlo Tree Search | 2023 |
| Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices | arXiv · 2018 |
| Monte Carlo Graph Search for Quantum Circuit Optimization | arXiv · 2023 |
| Post-error Correction for Quantum Annealing Processor Using Reinforcement Learning | Iccs · 2022 |