Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nature Machine Intelligence

Reusability report: Comparing gradient descent and Monte Carlo tree search optimization of quantum annealing schedules

Matteo M. Wauters, Evert van Nieuwenburg

Published Jan 1, 2022• 0 citations
Publisher
DOI
10.5281/zenodo.17683664

Related papers

Reusability report: Comparing gradient descent and Monte Carlo tree search optimization of quantum annealing schedules

Matteo M. Wauters, Evert van Nieuwenburg

arXiv:2210.03411•Nature Machine Intelligence•Oct 6, 2022•5 citations

Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks

Yuqin Chen, Yu Chen, Chee‐Kong Lee +2 more

arXiv:2004.02836•Nature Machine Intelligence•Mar 14, 2022•50 citations

Optimizing Quantum Annealing Schedules with Monte Carlo Tree Search Enhanced by MindSpore

Chao Wang, Fen Xia, Chunlei Hong +1 more

One of the key research focuses in quantum annealing is the design and optimization of annealing schedules to enhance computational efficiency, enabling large-scale applications. QuantumZero (QZero) pioneered the integration of Monte Carlo Tree Search (MCTS) with neural networks to autonomously design annealing schedules within a hybrid quantum-classical framework. This approach is distinguished by its ability to enhance the performance of Monte Carlo Tree Search through the integration of neural networks, enabling the efficient design of annealing paths even with limited annealing time. The paper presents an optimized QZero method based on intuitive reasoning theory and MindSpore, which further enhances QZero's ability to conserve computational resources and resist noise. In terms of learning efficiency, the optimized QZero algorithm improves the convergence speed of the neural network by 93% compared to the original algorithm. Notably, the average number of quantum annealing queries required to achieve 99% fidelity is reduced by 45.09%. Regarding noise resistance, the optimized QZero algorithm requires 34.27% fewer quantum annealing queries to reach 990% fidelity compared to the original algorithm. The optimized QZero algorithm demonstrates strong competitiveness in optimizing quantum annealing schedules.

Intelligent and Converged Networks•Mar 1, 2026•0 citations

Optimization algorithms for Quantum Annealing

E. Arvidsson

•Jan 1, 2020•0 citations

Adaptive Hybrid Quantum Annealing with Dynamic Scheduling and Chain Repair for Combinatorial Optimization Problems

Asmaa Hussein Alwan, Nuha Sami Mohsin, Abdullah Hasan Ali

Ingénierie des systèmes d information•Jul 31, 2026•0 citations

Monte Carlo Tree Search based Hybrid Optimization of Variational Quantum Circuits

Jiahao Yao, Haoya Li, Marin Bukov +2 more

Variational quantum algorithms stand at the forefront of simulations on near-term and future fault-tolerant quantum devices. While most variational quantum algorithms involve only continuous optimization variables, the representational power of the variational ansatz can sometimes be significantly enhanced by adding certain discrete optimization variables, as is exemplified by the generalized quantum approximate optimization algorithm (QAOA). However, the hybrid discrete-continuous optimization problem in the generalized QAOA poses a challenge to the optimization. We propose a new algorithm called MCTS-QAOA, which combines a Monte Carlo tree search method with an improved natural policy gradient solver to optimize the discrete and continuous variables in the quantum circuit, respectively. We find that MCTS-QAOA has excellent noise-resilience properties and outperforms prior algorithms in challenging instances of the generalized QAOA.

arXiv:2203.16707•Mar 30, 2022•13 citations
One of the key research focuses in quantum annealing is the design and optimization of annealing schedules to enhance computational efficiency, enabling large-scale applications. QuantumZero (QZero) pioneered the integration of Monte Carlo Tree Search (MCTS) with neural networks to autonomously design annealing schedules within a hybrid quantum-classical framework. This approach is distinguished by its ability to enhance the performance of Monte Carlo Tree Search through the integration of neural networks, enabling the efficient design of annealing paths even with limited annealing time. The paper presents an optimized QZero method based on intuitive reasoning theory and MindSpore, which further enhances QZero's ability to conserve computational resources and resist noise. In terms of learning efficiency, the optimized QZero algorithm improves the convergence speed of the neural network by 93% compared to the original algorithm. Notably, the average number of quantum annealing queries required to achieve 99% fidelity is reduced by 45.09%. Regarding noise resistance, the optimized QZero algorithm requires 34.27% fewer quantum annealing queries to reach 990% fidelity compared to the original algorithm. The optimized QZero algorithm demonstrates strong competitiveness in optimizing quantum annealing schedules.
Variational quantum algorithms stand at the forefront of simulations on near-term and future fault-tolerant quantum devices. While most variational quantum algorithms involve only continuous optimization variables, the representational power of the variational ansatz can sometimes be significantly enhanced by adding certain discrete optimization variables, as is exemplified by the generalized quantum approximate optimization algorithm (QAOA). However, the hybrid discrete-continuous optimization problem in the generalized QAOA poses a challenge to the optimization. We propose a new algorithm called MCTS-QAOA, which combines a Monte Carlo tree search method with an improved natural policy gradient solver to optimize the discrete and continuous variables in the quantum circuit, respectively. We find that MCTS-QAOA has excellent noise-resilience properties and outperforms prior algorithms in challenging instances of the generalized QAOA.