Abstract
We provide a reusability report of the method presented by Chen et al. in "Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks" and add further benchmarks on Max-Cut problems.
Reusability Report: Comparing gradient descent and monte carlo tree search optimization of quantum annealing schedules
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).
- Optimizing Quantum Annealing Schedules with Monte Carlo Tree Search enhanced with neural networks (2020)72% match
- Deep learning optimal quantum annealing schedules for random Ising models (2022)68% match
- Designing Quantum Annealing Schedules using Bayesian Optimization (2023)67% match
- Genetic optimization of quantum annealing (2021)67% match
- Optimizing Schedules for Quantum Annealing (2017)67% match
- Schedule path optimization for quantum annealing and adiabatic quantum computing (2015)67% match
- Trust Region Bayesian Optimization of Annealing Schedules on a Quantum Annealer (2025)66% match
- Transformer-Based Neural Quantum Digital Twins for Many-Body Quantum Simulation and Optimal Annealing Schedule Design (2025)64% match