Accelerating Quantum Optimization with Graph Learning for Optimal PMU Placement

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.

Authors

Institutions

Publication Details

Published
2025-06-18
DOI
https://doi.org/10.1109/itec63604.2025.11097914
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating Quantum Optimization with Graph Learning for Optimal PMU Placement

Thomas Morstyn, Xiangyue Wang, Yan Li, Zhiding Liang et al.
Quantum Computing Algorithms and Architecture
article

Accelerating Quantum Optimization with Graph Learning for Optimal PMU Placement

Thomas Morstyn, Xiangyue Wang, Yan Li, Zhiding Liang, Liang Du, Yuqi Jiang
article en

Abstract

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.

Pennsylvania State University (US), Rensselaer Polytechnic Institute (US), University of Oxford (GB), Science Oxford (GB), Temple University (US)
National Science Foundation, Office of Naval Research
Openalex Percentile: Top 90%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Accelerating Quantum Optimization with Graph Learning for Optimal PMU Placement — Thomas Morstyn, Xiangyue Wang, et al. · (2025) | TGRS Research Map | TGRS