With the significant expansion of renewable energy integration, the scale of the power grid also increases rapidly. To effectively monitor the operational state of large-scale power grids, optimizing the placement of Phasor Measurement Units (PMUs) is a critical research focus. Optimizing PMU Placement (OPP) is a typical combinatorial optimization problem with NP-hard complexity, which brings substantial challenges to classical computers. The sheer scale of modern grids forces classical solvers into prohibitive runtimes and sub-optimal local minima, degrading both execution speed and solution quality. Recent advances in quantum computing have opened new opportunities for tackling combinatorial optimization problems, particularly through the Quantum Approximate Optimization Algorithm (QAOA). However, QAOA operates as a hybrid quantum–classical framework, where determining the optimal parameters depends on a classical optimization process that remains computationally challenging and inherently NP-hard. On the other hand, in the Noisy Intermediate-Scale Quantum (NISQ) era, obtaining optimal optimization results typically requires a large number of quantum measurement shots. In this work, we propose a graph-learning-based strategy to provide QAOA with guided parameter initialization, enabling effective operation under limited quantum resources, particularly when the number of available measurement shots is restricted. Both the OPP problem and the channel-limitation task are investigated, where the proposed graph-learning-based parameter predictor enhances QAOA performance on both tasks, improving both the approximation ratio and computational efficiency. Furthermore, due to the complexity of the channel-limitation task and the scarcity of its pretraining data, a transfer learning strategy is employed to leverage knowledge from the original OPP task, where QAOA parameter datasets are more readily available to train the graph learning framework for the QAOA parameter predictor. The transfer learning approach also outperforms both random initialization and graph learning trained solely on the channel-limitation dataset in terms of the approximation ratio and the time efficiency. In general, this work is aimed at providing a new benchmark for solving complicated real-world power system optimization problems in the current NISQ era.
With the significant expansion of renewable energy integration, the scale of the power grid also increases rapidly. To effectively monitor the operational state of large-scale power grids, optimizing the placement of Phasor Measurement Units (PMUs) is a critical research focus. Optimizing PMU Placement (OPP) is a typical combinatorial optimization problem with NP-hard complexity, which brings substantial challenges to classical computers. The sheer scale of modern grids forces classical solvers into prohibitive runtimes and sub-optimal local minima, degrading both execution speed and solution quality. Recent advances in quantum computing have opened new opportunities for tackling combinatorial optimization problems, particularly through the Quantum Approximate Optimization Algorithm (QAOA). However, QAOA operates as a hybrid quantum–classical framework, where determining the optimal parameters depends on a classical optimization process that remains computationally challenging and inherently NP-hard. On the other hand, in the Noisy Intermediate-Scale Quantum (NISQ) era, obtaining optimal optimization results typically requires a large number of quantum measurement shots. In this work, we propose a graph-learning-based strategy to provide QAOA with guided parameter initialization, enabling effective operation under limited quantum resources, particularly when the number of available measurement shots is restricted. Both the OPP problem and the channel-limitation task are investigated, where the proposed graph-learning-based parameter predictor enhances QAOA performance on both tasks, improving both the approximation ratio and computational efficiency. Furthermore, due to the complexity of the channel-limitation task and the scarcity of its pretraining data, a transfer learning strategy is employed to leverage knowledge from the original OPP task, where QAOA parameter datasets are more readily available to train the graph learning framework for the QAOA parameter predictor. The transfer learning approach also outperforms both random initialization and graph learning trained solely on the channel-limitation dataset in terms of the approximation ratio and the time efficiency. In general, this work is aimed at providing a new benchmark for solving complicated real-world power system optimization problems in the current NISQ era.
The Phasor Measurement Unit (PMU) plays a crucial role in the real-time monitoring of power systems. Investigating the optimal PMU placement can not only provide full system observability but also reduce unnecessary installation costs. However, as a typical combinatorial optimization problem, determining the optimal PMU installation strategy is NP-hard and would cost significant computational resources for classical computers. In this work, a graph learning based acceleration strategy for the Quantum Approximation Optimization Algorithm (QAOA) is developed to effectively identify the optimal PMU placement. The proposed graph learning method will distill knowledge from the power grid to better initialize the QAOA parameter, boosting the overall implementation speed of QAOA. Empirical results indicate that our graph learning strategy can provide a 5% to 8% speedup to the QAOA execution. This work aims to provide a cornerstone in accelerated quantum computing to solve real-world power system applications.
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems that are classically intractable. Careful parameter initialization in QAOA can reduce the number of quantum circuit evaluations required, making it more feasible to run on noisy intermediate-scale quantum (NISQ) devices. In this work, We focus on MaX-Cut, a classic NP-hard optimization problem, and propose a conditional variational autoencoder (CVAE) scheme for generating initial QAOA parameters for the Max-Cut problems based on input graph structures. The CVAE, trained on optimal parameters from 270 ten-node graphs, produces multiple parameter candidates conditioned on 27-dimensional feature vectors that incorporate spectral properties as well as learned embeddings. We evaluate and compare two strategies: direct initialization using the highestconfidence prediction, and dynamic injection which monitors optimization progress and intervenes when needed. On 89 test graphs, the dynamic injection strategy increased successful convergence cases from 41 to 49, reduced mean iteration count by 4.94.
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.
In recent years, quantum computing has emerged as a transformative force in the field of combinatorial optimization, offering novel approaches to tackling complex problems that have long challenged classical computational methods. Among these, the Quantum Approximate Optimization Algorithm (QAOA) stands out for its potential to efficiently solve the Max-Cut problem, a quintessential example of combinatorial optimization. However, practical application faces challenges due to current limitations on quantum computational resource. Our work optimizes QAOA initialization, using Graph Neural Networks (GNN) as a warm-start technique. This sacrifices affordable computational resource on classical computer to reduce quantum computational resource overhead, enhancing QAOA's effectiveness. Experiments with various GNN architectures demonstrate the adaptability and stability of our framework, highlighting the synergy between quantum algorithms and machine learning. Our findings show GNN's potential in improving QAOA performance, opening new avenues for hybrid quantum-classical approaches in quantum computing and contributing to practical applications.
Graph-based combinatorial optimization problems are computationally challenging for classical optimization techniques due to their NP-hard nature. This paper proposes a novel Quantum-Assisted Hybrid Optimization Algorithm (QAHOA) that integrates the Quantum Approximate Optimization Algorithm (QAOA), spectral graph theory, and classical optimization strategies for graph-based combinatorial optimization. The developed framework uses spectral initialization via the graph Laplacian Fiedler vector to provide structurally informed starting variational parameters, aiming to stabilize the parameter search space and improve convergence trajectories under noisy conditions. The mathematical framework, alongside a convergence analysis to first-order stationary points, is provided to establish theoretical baseline properties. Evaluated on synthetic Erdős–Rényi random graph instances, the current study serves as a preliminary, small-to-medium-scale proof-of-concept. Controlled evaluations demonstrate that the proposed QAHOA achieves marginal yet stable and statistically significant improvements in mean cut values and approximation ratios over classical Greedy heuristics, Simulated Annealing, the standard QAOA, and Warm-Start QAOA. Formal paired hypothesis testing mathematically verifies the stability of the framework, while preliminary 4-qubit hardware executions demonstrate baseline architectural compatibility under physical NISQ noise channels.
Quantum computing has rapidly emerged as a powerful paradigm for tackling computationally demanding problems. In particular, quantum optimization shows strong promise for hard combinatorial problems in power systems, where increasing distributed energy penetration heightens the need for intentional islanding to maintain grid reliability and resilience. However, power system islanding is an NP-hard combinatorial optimization problem that becomes computationally prohibitive for classical solvers as network size grows, motivating the use of quantum computing as a promising alternative pipeline. This study develops a resource-efficient hybrid QAOA islanding framework that brings physics-constrained power-system partitioning into the quantum optimization workflow. The framework combines coherency-informed graph reduction, physics-aware constraint modeling, and structured post-processing to efficiently convert shallow-circuit QAOA samples into high-quality feasible islanding decisions without deep circuits or large shot budgets. The proposed framework is validated on the standard IEEE benchmark systems (9-, 14-, 24-, 30-, 39-, and 57-bus), demonstrating that the hybrid workflow achieves Gurobi-optimal solution quality with a clear quantum resource advantage over vanilla QAOA, while the resulting islanding solutions satisfy all physical feasibility requirements after network separation. This study establishes QAOA-based islanding as a viable quantum approach for critical infrastructure, with structured post-processing as the key enabler of quantum resource efficiency.