.png){kind=icon}
.png){kind=icon}
Return
Conditional diffusion-based parameter generation for quantum approximate optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1140/epjqt/s40507-025-00397-4.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm that shows promise in efficiently solving the Max-Cut problem, a representative example of combinatorial optimization. However, its effectiveness heavily depends on the parameter optimization pipeline, where the parameter initialization strategy is nontrivial due to the non-convex and complex optimization landscapes characterized by issues with low-quality local minima. Recent inspiration comes from the diffusion of classical neural network parameters, which has demonstrated that neural network training can benefit from generating good initial parameters through diffusion models. However, whether the diffusion model can enhance the parameter optimization and performance of QAOA by generating well-performing initial parameters is still an open topic. Therefore, in this work, we formulate the problem of finding good initial parameters as a generative task and propose the initial parameter generation scheme through dataset-conditioned pre-trained parameter sampling. Concretely, the generative machine learning model, specifically the denoising diffusion probabilistic model (DDPM), is trained to learn the distribution of pre-trained parameters conditioned on the graph dataset. Intuitively, the proposed framework aims to effectively distill knowledge from pre-trained parameters to generate well-performing initial parameters for QAOA. To benchmark our framework, we adopt trotterized quantum annealing (TQA)-based and graph neural network (GNN) prediction-based initialization protocols as baselines. Through numerical experiments on Max-Cut problem instances of various sizes, we show that conditional DDPM can consistently generate high-quality initial parameters, improve convergence to the approximation ratio, and exhibit greater robustness against local minima over baselines. Additionally, the experimental results also indicate that the conditional DDPM trained on small problem instances can be extrapolated to larger ones, thus demonstrating the extrapolation capacity of our framework in terms of the qubit number.
Keywords:
Quantum Approximate Optimization Algorithm
Denoising diffusion probabilistic model
Parameter initialization
Max-Cut
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.6
Papers:
530
Citations:
1.1K
Organization
View more organizations