TY  - JOUR
AU  - Hartmann, Carsten
AU  - Zhang, Junjie
AU  - Calaza, Carlos D. Gonzalez
AU  - Pesch, Thiemo
AU  - Michielsen, Kristel
AU  - Benigni, Andrea
TI  - Quantum Annealing Based Power Grid Partitioning for Parallel Simulation
JO  - IEEE transactions on power systems
VL  - 40
IS  - 6
SN  - 0885-8950
CY  - New York, NY, USA
PB  - IEEE
M1  - FZJ-2026-00540
SP  - 4958 - 4970
PY  - 2025
AB  - Graph partitioning has many applications in power systems, from decentralized state estimation to parallel simulation. Focusing on parallel simulation, optimal grid partitioning minimizes the idle time caused by different simulation times for the sub-networks and their components and reduces the overhead required to simulate the cuts. Partitioning a graph into two parts such that, for example, the cut is minimal and the sub-graphs have equal size is an NP-hard problem. In this paper, we show how optimal partitioning of a graph can be obtained using quantum annealing (QA). We show how to map the requirements for optimal splitting to a quadratic unconstrained binary optimization (QUBO) formulation and test the proposed formulation using a current D-Wave QPU. We show that the necessity to find an embedding of the QUBO on current D-Wave QPUs limits the problem size to under 200 buses and notably affects the time-to-solution. We finally discuss the implications of quantum hardware non-ideality on near term implementation in the simulation loop.
LB  - PUB:(DE-HGF)16
DO  - DOI:10.1109/TPWRS.2025.3578243
UR  - https://juser.fz-juelich.de/record/1051618
ER  -