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
- Thomas Morstyn (ORCID: https://orcid.org/0000-0003-2781-9588)
- Xiangyue Wang (ORCID: https://orcid.org/0000-0002-1975-5724)
- Yan Li (ORCID: https://orcid.org/0000-0003-4140-1911)
- Zhiding Liang (ORCID: https://orcid.org/0000-0002-7568-0165)
- Liang Du (ORCID: https://orcid.org/0000-0002-2663-0751)
- Yuqi Jiang (ORCID: https://orcid.org/0009-0007-6732-9862)
Institutions
- Pennsylvania State University (US)
- Rensselaer Polytechnic Institute (US)
- University of Oxford (GB)
- Science Oxford (GB)
- Temple University (US)
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
- National Science Foundation
- Office of Naval Research