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.

arXiv:2609.39602 [quant-ph]

(or arXiv:2609.39602v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.39602 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.