Recognizing Good Variational Quantum Circuits with Monte Carlo Tree Search

preprint OA: closed
View at publisher

Abstract

AbstractMany investigators have recently turned to the study of quantum architecture search since it is laborious to manually design a high-performing quantum model and corresponding training strategies. For some tasks, it is more realistic in practice to search for a model architecture. In this paper, we introduce the Monte Carlo Tree Search algorithm which has achieved great success in classical neural architecture search to find good variational quantum circuits for two real-world tasks of ground state energy estimations and multimodal fusion. We adapt the Monte Carlo Tree Search to the quantum scenario by considering more sophisticated classifiers within the tree nodes to partition the search space into several subregions based on the model performance. The experimental results indicate that our proposed method has the ability to recognize good models from the vast search space in both tasks. More importantly, the discovered variational quantum circuits demonstrate their advantages in fusing multimodal features under the comprehensive consideration of parameter number and performance.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00