Quick Navigation
Topics
Quantum Optimization
Quantum Machine Learning
Reusability Report: Comparing gradient descent and monte carlo tree search optimization of quantum annealing schedules
arXiv
Authors: Matteo M. Wauters, Evert van Nieuwenburg
Year
2022
Paper ID
58602
Status
Preprint
Abstract Read
~2 min
Abstract Words
34
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2022 reference point for readers tracking recent quantum research.
- We provide a reusability report of the method presented by Chen et al.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.