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

arXiv:2004.02836 · Nature Machine Intelligence

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

Yuqin Chen, Yu Chen, Chee‐Kong Lee, Shengyu Zhang, Chang‐Yu Hsieh

Published Mar 14, 2022• 50 citations
arXivHTMLPDF
DOI
10.1038/s42256-022-00446-y

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

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

Matteo M. Wauters, Evert van Nieuwenburg

Nature Machine Intelligence•Jan 1, 2022•0 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

Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search

Lena Tokuhiro, Amine Bentellis, Jeanette Miriam Lorenz

Quantum machine learning (QML) has attracted considerable research interest, yet whether it offers practical benefits over classical approaches remains an open question. The choice of data encoding significantly influences QML performance, but why certain encodings outperform others remains poorly understood. We employ Monte Carlo Tree Search (MCTS) to discover optimal data encoding circuits for a quantum-classical convolutional neural network (QCCNN) combining a non-variational quantum block for feature extraction with a classical classifier. Evaluating on two medical imaging datasets, the discovered circuits outperform commonly used encoding strategies while showing competitive results compared to purely classical counterparts. We further analyze metrics to identify predictors of encoding performance. Entanglement capability and Fourier decomposition provide minimal insight, whereas the effective rank of the feature maps exhibits meaningful correlation and can serve as a threshold criterion to accelerate the search for high-performing encodings. Our findings provide both a practical method for encoding discovery and new insights into what makes data encodings effective in QML.

quant-pharXiv:2605.18540•May 19, 2026•2 citations

Qubit Routing Using Graph Neural Network Aided Monte Carlo Tree Search

Animesh Sinha, Utkarsh Azad, Harjinder Singh

Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. Therefore, to execute an arbitrary quantum circuit on the hardware, compilers have to first perform the task of qubit routing, i.e., to transform the quantum circuit either by inserting additional SWAP gates or by reversing existing CNOT gates to satisfy the connectivity constraints of the target topology. The depth of the transformed quantum circuits is minimized by utilizing the Monte Carlo tree search (MCTS) to perform qubit routing by making it both construct each action and search over the space of all actions. It is aided in performing these tasks by a Graph neural network that evaluates the value function and action probabilities for each state. Along with this, we propose a new method of adding mutex-lock like variables in our state representation which helps factor in the parallelization of the scheduled operations, thereby pruning the depth of the output circuit. Overall, our procedure (referred to as QRoute) performs qubit routing in a hardware agnostic manner, and it outperforms other available qubit routing implementations on various circuit benchmarks.

arXiv:2104.01992•Proceedings of the AAAI Conference on Artificial Intelligence•Jun 28, 2022•30 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.
Quantum machine learning (QML) has attracted considerable research interest, yet whether it offers practical benefits over classical approaches remains an open question. The choice of data encoding significantly influences QML performance, but why certain encodings outperform others remains poorly understood. We employ Monte Carlo Tree Search (MCTS) to discover optimal data encoding circuits for a quantum-classical convolutional neural network (QCCNN) combining a non-variational quantum block for feature extraction with a classical classifier. Evaluating on two medical imaging datasets, the discovered circuits outperform commonly used encoding strategies while showing competitive results compared to purely classical counterparts. We further analyze metrics to identify predictors of encoding performance. Entanglement capability and Fourier decomposition provide minimal insight, whereas the effective rank of the feature maps exhibits meaningful correlation and can serve as a threshold criterion to accelerate the search for high-performing encodings. Our findings provide both a practical method for encoding discovery and new insights into what makes data encodings effective in QML.
Near-term quantum hardware can support two-qubit operations only on the qubits that can interact with each other. Therefore, to execute an arbitrary quantum circuit on the hardware, compilers have to first perform the task of qubit routing, i.e., to transform the quantum circuit either by inserting additional SWAP gates or by reversing existing CNOT gates to satisfy the connectivity constraints of the target topology. The depth of the transformed quantum circuits is minimized by utilizing the Monte Carlo tree search (MCTS) to perform qubit routing by making it both construct each action and search over the space of all actions. It is aided in performing these tasks by a Graph neural network that evaluates the value function and action probabilities for each state. Along with this, we propose a new method of adding mutex-lock like variables in our state representation which helps factor in the parallelization of the scheduled operations, thereby pruning the depth of the output circuit. Overall, our procedure (referred to as QRoute) performs qubit routing in a hardware agnostic manner, and it outperforms other available qubit routing implementations on various circuit benchmarks.