Warm-Start Iterative QITE for Distribution Network Reconfiguration via Branch-Exchange Encoding
Abstract
We present a hybrid quantum-classical algorithm for distribution network reconfiguration, a combinatorial optimization problem on power distribution networks, that combines a radiality preserving branch-exchange encoding with iterative warm-start quantum imaginary-time evolution to minimize active line losses. The encoding uses a fixed-width binary representation of sequential branch-exchange actions, ensuring that every register outcome decodes to a radial configuration. The quantum subroutine is informed by a surrogate model fit to classically-solved alternating current power flow (ACPF) labels. After a set budget of ACPF solves and circuit samples is exhausted, the algorithm returns the lowest-loss configuration seen. We employ our algorithm on ten test cases, including seven commonly-used benchmark cases and three cases we modified from these and similar standard systems. We include two methods to reduce problem size, which enable extensions of the algorithm to larger networks. We successfully reach minimal-loss configurations for six cases and find configurations with losses from 0.2 percent to 2.18 percent above the reported reference minimal loss for the other four.
Related
- Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding
- Quantum Enhanced Deep Reinforcement Learning for Distribution Network Reconfiguration
- Rethinking free-space orbital angular momentum quantum key distribution: encoding selection and branch-cut-length-minimized adaptive optics
- An iterative Bayesian variational quantum eigensolver with the von Mises-Fisher distribution
- Projection-based segregated, iterative, and multi-stage physics-informed neural network for incompressible Navier-stokes equations
BibTeX
@misc{crum2026warmstart,
title = {{Warm-Start Iterative QITE for Distribution Network Reconfiguration via Branch-Exchange Encoding}},
author = {Noah Crum and Pete Pritchard and Tanner Rase and Phillip C. Lotshaw and Shaked Regev and Claudio Girotto and Ananth Kaushik and Paul Smith},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39602},
eprint = {2609.39602},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39602},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Warm-Start Iterative QITE for Distribution Network Reconfiguration via Branch-Exchange Encoding
AU - Noah Crum
AU - Pete Pritchard
AU - Tanner Rase
AU - Phillip C. Lotshaw
AU - Shaked Regev
AU - Claudio Girotto
AU - Ananth Kaushik
AU - Paul Smith
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39602
UR - https://arxiv.org/abs/2609.39602
AB - We present a hybrid quantum-classical algorithm for distribution network reconfiguration, a combinatorial optimization problem on power distribution networks, that combines a radiality preserving branch-exchange encoding with iterative warm-start quantum imaginary-time evolution to minimize active line losses. The encoding uses a fixed-width binary representation of sequential branch-exchange actions, ensuring that every register outcome decodes to a radial configuration. The quantum subroutine is informed by a surrogate model fit to classically-solved alternating current power flow (ACPF) labels. After a set budget of ACPF solves and circuit samples is exhausted, the algorithm returns the lowest-loss configuration seen. We employ our algorithm on ten test cases, including seven commonly-used benchmark cases and three cases we modified from these and similar standard systems. We include two methods to reduce problem size, which enable extensions of the algorithm to larger networks. We successfully reach minimal-loss configurations for six cases and find configurations with losses from 0.2 percent to 2.18 percent above the reported reference minimal loss for the other four.
ER -