Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
arXiv:2502.03962 · doi:10.1002/qute.202500093
Abstract
The performance of Variational Quantum Algorithms (VQAs) strongly depends on the choice of the parameterized quantum circuit to optimize. One of the biggest challenges in VQAs is designing quantum circuits tailored to the particular problem. This article proposes a gradient-free Monte Carlo Tree Search (MCTS) technique to automate the process of quantum circuit design. Our proposed technique introduces a novel formulation of the action space based on a sampling scheme and a progressive widening technique to explore the space dynamically. When testing our MCTS approach on the domain of random quantum circuits, MCTS approximates unstructured circuits under different values of stabilizer Rényi entropy. It turns out that MCTS manages to approximate the benchmark quantum states independently from their degree of nonstabilizerness. Next, our technique exhibits robustness across various application domains, including quantum chemistry and systems of linear equations. Compared to previous MCTS research, our technique reduces the number of quantum circuit evaluations by a factor of 10 up to 100 while achieving equal or better results. In addition, the resulting quantum circuits exhibit up to three times fewer CNOT gates, which is important for implementation on noisy quantum hardware.
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Noisy intermediate-scale quantum (NISQ) algorithms
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Training variational quantum algorithms is NP-hard
- Application of a resource theory for magic states to fault-tolerant quantum computing
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Stabilizer Rényi entropy
- Is there evidence for exponential quantum advantage in quantum chemistry?
- Option Pricing using Quantum Computers
- Variational Quantum Linear Solver
- Quantum circuit architecture search for variational quantum algorithms
- Noise Resilience of Variational Quantum Compiling
- Differentiable Quantum Architecture Search
- Evaluating the noise resilience of variational quantum algorithms
- Generalization despite overfitting in quantum machine learning models
- Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
- Quantum algorithms: A survey of applications and end-to-end complexities
- A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
- Quantum Architecture Search with Meta-learning
- Variational circuit compiler for quantum error correction
- Hierarchical quantum circuit representations for neural architecture search
- A General Approach to Dropout in Quantum Neural Networks
- Distributed quantum architecture search
- Quantum Circuit Evolution on NISQ Devices
- Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states
- A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack