Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.40264

Two-Stage Quantum-Classical Distribution Network Reconfiguration via Cycle-Edge Encoding

Nowar Alashkar, Cade Kennedy, Phillip C. Lotshaw, Shaked Regev, Miguel Angel Lopez-Ruiz, Ananth Kaushik, Paul Smith, Claudio Girotto, Martin Roetteler

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations• Revised Oct 12, 2026 (v2)
v1 · Sep 30, 2026v2 · Oct 12, 2026
arXivHTMLPDF

Abstract

Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraints. In this work, we propose a two-stage quantum-classical method for DNR. First, an iterative linear-ramp Quantum Alternating Operator Ansatz (LR-QAOA) searches topologically feasible subspaces constructed using a novel cycle-edge encoding. The encoding guarantees that every represented configuration is a spanning tree while allowing the size and coverage of each subspace to be adjusted to the available qubit budget. Second, the resulting sample distribution is used to guide a mixed-integer second-order-cone programming (MISOCP) solver. The method is evaluated on six distribution networks ranging from 33 to 417 buses through ideal simulation and execution on trapped-ion quantum hardware. For the 417-bus network, quantum hardware sampling identifies a configuration within approximately $1.4\%$ of the literature reference loss. Across all six test systems, the MISOCP solver guided by hardware-derived distributions reaches an incumbent within $1\%$ of the target with a lower median solver time than the corresponding unguided solver. These findings establish a concrete framework for applying current quantum hardware to DNR, with the potential to become increasingly competitive as hardware improves.

AI Summary

The paper studies whether quantum-generated samples can guide classical optimization for distribution network reconfiguration: minimizing electrical losses subject to radiality, connectivity, and operating constraints. It proposes a two-stage workflow combining iterative linear-ramp QAOA with a mixed-integer second-order-cone programming (MISOCP) solver. A cycle-edge encoding partitions cycle edges into disjoint blocks, with exactly one edge opened per block. The paper proves that every permitted assignment yields a spanning tree and that a finite collection of partitions covers all spanning trees; this does not establish efficient coverage. Each iteration constructs a qubit-budgeted subspace around a reference tree, fits a quadratic loss surrogate to classical power-flow evaluations, and samples constraint-preserving QAOA circuits. Selected samples update the reference tree. The final samples provide a MIP start and variable hints to the classical solver. Tests use six networks spanning 33–417 buses, with 29 qubits, two QAOA layers, and 1,000 shots per circuit, using ideal simulation and trapped-ion hardware. For the 417-bus network, the best simulated and hardware-sampled losses are 586.66 and 589.56 kW, respectively, versus a literature reference of 581.57 kW. Hardware-guided MISOCP reduces median solver time to a power-flow-validated solution within $1\%$ of the reference across all six networks; for 417 buses, it decreases from 1,415.47 to 34.71 seconds across 20 solver seeds. Quantum-stage overhead prevents an end-to-end runtime advantage. The paper notes heuristic, nonmonotonic search, noise-induced infeasible samples, restricted subspace coverage, and uncertified reference optima. Larger-instance crossover remains untested.

Little sign of AI-generated textIncrementalMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 8 figures

Related papers

Quantum Resource Estimation for Minimising Energy Grid Losses

Camille de Valk, Milou van Nederveen, Koen Reerink +1 more

Distribution network reconfiguration (DNR) can minimise power losses by identifying the optimal topology of the electricity grid. Determining the minimum loss configuration is NP-hard, and classical optimisation methods struggle to scale to real-world distribution grids. This paper explores the use of gate-based quantum computing to solve DNR for power loss reduction. We formulate DNR as a higher-order unconstrained binary optimisation (HUBO) problem, avoiding the need for auxiliary variables, thereby reducing the required number of qubits. This is applied to a real medium voltage (MV) network operated by Alliander, a Dutch distribution system operator (DSO). For each biconnected component in the network graph, we construct the corresponding HUBO, derive the cost and mixer operators, and determine the number of required logical qubits and rotation gates. These are then mapped to physical qubits and execution time estimates using quantum resource estimation (QRE). The results suggest that the quantum resource requirements depend not only on component size but also on structural characteristics such as connectivity and cyclicity. Overall, the novelty of this work lies in directly framing the optimisation problem as a HUBO, applying it to real-world MV networks, and performing a QRE to assess future feasibility.

quant-pharXiv:2605.03467•IET conference proceedings.•May 6, 2026•1 citation

Quantum Enhanced Deep Reinforcement Learning for Distribution Network Reconfiguration

Daniel Germain, Mason Blanchard, Audrey Versteegen +5 more

Modern smart grids generate increasingly rich operational data and deploy greater numbers of remotely controlled switching assets than ever before, creating new opportunities for data-driven distribution network reconfiguration (DNR). DNR optimizes grid topology to improve efficiency, reduce power losses, and maintain operational constraints, but finding optimal switch configurations remains a computationally demanding combinatorial problem. In this paper, we propose a deep reinforcement learning (DRL) framework for static DNR to systematically investigate how the Q-network architecture affects both solution quality and learning performance. We evaluate multiple architectures within a controlled DRL framework, varying only the Q-network to isolate the contribution of each architectural choice. Our results show that quantum-enhanced Q-networks can achieve higher rewards with fewer parameters than their classical counterpart, suggesting that such architectures are a promising direction for combinatorial power systems optimization.

quant-pharXiv:2609.40327•Oct 1, 2026

Warm-Start Iterative QITE for Distribution Network Reconfiguration via Branch-Exchange Encoding

Noah Crum, Pete Pritchard, Tanner Rase +5 more

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.

quant-pharXiv:2609.39602•Oct 1, 2026•0 citations

Towards Quantum Algorithms for the Optimization of Spanning Trees: The Power Distribution Grids Use Case

Carsten Hartmann, Nil Rodellas-Gràcia, Christian Wallisch +5 more

Optimizing the topology of networks is an important challenge across engineering disciplines. In energy systems, network reconfiguration can substantially reduce losses and costs and thus support the energy transition. Unfortunately, many related optimization problems are NP hard, restricting practical applications. In this article, we address the problem of minimizing losses in radial networks, a problem that routinely arises in distribution grid operation. We show that even the computation of approximate solutions is computationally hard and propose quantum optimization as a promising alternative. We derive two quantum algorithmic primitives based on the Quantum Alternating Operator Ansatz (QAOA) that differ in the sampling of network topologies: a tailored sampling of radial topologies and simple sampling with penalty terms to suppress non-radial topologies. We show how to apply these algorithmic primitives to distribution grid reconfiguration and quantify the necessary quantum resources.

arXiv:2511.00582•Nov 1, 2025•1 citation

Quantum Combinatorial Optimization Algorithms for Network Reconfiguration: QRAO vs. QAOA

Anh Phuong Ngo, Hieu Trung Nguyen

This paper reviews a hybrid quantum-classical distributed algorithm for NP-hard combinatorial optimization problems, which is embedded in IBM Qiskit's Alternating Direction Method of Multipliers (ADMM) optimizer. We demonstrate a proof of concept for solving Mixed-Integer Convex Programs (MICP) in power system applications using a use case on power distribution network reconfiguration in IBM quantum computers. Using the Qiskit ADMM optimizer, the MICP is decomposed into two subproblems: a quadratic unconstrained binary optimization (QUBO) solved by quantum algorithms and a convex one solved by classical solvers. Our essential contribution is integrating the Quantum Random Access Optimization (QRAO) into the quantum-classical distributed framework and the existing Quantum Approximate Optimization Algorithm (QAOA) implemented in the Qiskit ADMM Optimizer. QRAO utilizes Quantum Random Access Codes (QRACs) to minimize qubit requirements and utilizes quantum state rounding for solution extraction. We examine the impact of noise on solutions derived from QRAO and compare them with results from QAOA using a use case on network reconfiguration in response to faults in the power distribution system.

North American Power Symposium (NAPS)•Oct 13, 2024•9 citations

Evaluate Quantum Combinatorial Optimization for Distribution Network Reconfiguration

Anh Phuong Ngo, Christan Thomas, Hieu Trung Nguyen +2 more

This paper aims to implement and evaluate the performance of quantum computing on solving combinatorial optimization problems arising from the operations of the power grid. To this end, we construct a novel mixed integer conic programming formulation for the reconfiguration of radial distribution network in response to faults in distribution lines. Comparing to existing bus injection model in the literature, our formulation based the branch flows model is theoretically equivalent without needing non-explainable variables, thus being more numerically stable. The network reconfiguration model is then used as a benchmark to evaluate the performance of quantum computing algorithms in real quantum computers. It shows that while current quantum computing algorithms with fast execution time in quantum computers can be a promising solution candidate, its heuristic nature stem from its theoretical foundation should be considered carefully when applying into power grid optimization problems.

arXiv:2208.07513•North American Power Symposium (NAPS)•Oct 9, 2022•5 citations
Distribution network reconfiguration (DNR) is a combinatorial optimization problem that seeks a low-loss network topology subject to topological and electrical operating constraints. In this work, we propose a two-stage quantum-classical method for DNR. First, an iterative linear-ramp Quantum Alternating Operator Ansatz (LR-QAOA) searches topologically feasible subspaces constructed using a novel cycle-edge encoding. The encoding guarantees that every represented configuration is a spanning tree while allowing the size and coverage of each subspace to be adjusted to the available qubit budget. Second, the resulting sample distribution is used to guide a mixed-integer second-order-cone programming (MISOCP) solver. The method is evaluated on six distribution networks ranging from 33 to 417 buses through ideal simulation and execution on trapped-ion quantum hardware. For the 417-bus network, quantum hardware sampling identifies a configuration within approximately 1.4%1.4\%1.4% of the literature reference loss. Across all six test systems, the MISOCP solver guided by hardware-derived distributions reaches an incumbent within 1%1\%1% of the target with a lower median solver time than the corresponding unguided solver. These findings establish a concrete framework for applying current quantum hardware to DNR, with the potential to become increasingly competitive as hardware improves.
The paper studies whether quantum-generated samples can guide classical optimization for distribution network reconfiguration: minimizing electrical losses subject to radiality, connectivity, and operating constraints. It proposes a two-stage workflow combining iterative linear-ramp QAOA with a mixed-integer second-order-cone programming (MISOCP) solver.
A cycle-edge encoding partitions cycle edges into disjoint blocks, with exactly one edge opened per block. The paper proves that every permitted assignment yields a spanning tree and that a finite collection of partitions covers all spanning trees; this does not establish efficient coverage. Each iteration constructs a qubit-budgeted subspace around a reference tree, fits a quadratic loss surrogate to classical power-flow evaluations, and samples constraint-preserving QAOA circuits. Selected samples update the reference tree. The final samples provide a MIP start and variable hints to the classical solver.
Tests use six networks spanning 33–417 buses, with 29 qubits, two QAOA layers, and 1,000 shots per circuit, using ideal simulation and trapped-ion hardware. For the 417-bus network, the best simulated and hardware-sampled losses are 586.66 and 589.56 kW, respectively, versus a literature reference of 581.57 kW. Hardware-guided MISOCP reduces median solver time to a power-flow-validated solution within 1%1\%1% of the reference across all six networks; for 417 buses, it decreases from 1,415.47 to 34.71 seconds across 20 solver seeds.
Quantum-stage overhead prevents an end-to-end runtime advantage. The paper notes heuristic, nonmonotonic search, noise-induced infeasible samples, restricted subspace coverage, and uncertified reference optima. Larger-instance crossover remains untested.
Distribution network reconfiguration (DNR) can minimise power losses by identifying the optimal topology of the electricity grid. Determining the minimum loss configuration is NP-hard, and classical optimisation methods struggle to scale to real-world distribution grids. This paper explores the use of gate-based quantum computing to solve DNR for power loss reduction. We formulate DNR as a higher-order unconstrained binary optimisation (HUBO) problem, avoiding the need for auxiliary variables, thereby reducing the required number of qubits. This is applied to a real medium voltage (MV) network operated by Alliander, a Dutch distribution system operator (DSO). For each biconnected component in the network graph, we construct the corresponding HUBO, derive the cost and mixer operators, and determine the number of required logical qubits and rotation gates. These are then mapped to physical qubits and execution time estimates using quantum resource estimation (QRE). The results suggest that the quantum resource requirements depend not only on component size but also on structural characteristics such as connectivity and cyclicity. Overall, the novelty of this work lies in directly framing the optimisation problem as a HUBO, applying it to real-world MV networks, and performing a QRE to assess future feasibility.
Modern smart grids generate increasingly rich operational data and deploy greater numbers of remotely controlled switching assets than ever before, creating new opportunities for data-driven distribution network reconfiguration (DNR). DNR optimizes grid topology to improve efficiency, reduce power losses, and maintain operational constraints, but finding optimal switch configurations remains a computationally demanding combinatorial problem. In this paper, we propose a deep reinforcement learning (DRL) framework for static DNR to systematically investigate how the Q-network architecture affects both solution quality and learning performance. We evaluate multiple architectures within a controlled DRL framework, varying only the Q-network to isolate the contribution of each architectural choice. Our results show that quantum-enhanced Q-networks can achieve higher rewards with fewer parameters than their classical counterpart, suggesting that such architectures are a promising direction for combinatorial power systems optimization.
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.
Optimizing the topology of networks is an important challenge across engineering disciplines. In energy systems, network reconfiguration can substantially reduce losses and costs and thus support the energy transition. Unfortunately, many related optimization problems are NP hard, restricting practical applications. In this article, we address the problem of minimizing losses in radial networks, a problem that routinely arises in distribution grid operation. We show that even the computation of approximate solutions is computationally hard and propose quantum optimization as a promising alternative. We derive two quantum algorithmic primitives based on the Quantum Alternating Operator Ansatz (QAOA) that differ in the sampling of network topologies: a tailored sampling of radial topologies and simple sampling with penalty terms to suppress non-radial topologies. We show how to apply these algorithmic primitives to distribution grid reconfiguration and quantify the necessary quantum resources.
This paper reviews a hybrid quantum-classical distributed algorithm for NP-hard combinatorial optimization problems, which is embedded in IBM Qiskit's Alternating Direction Method of Multipliers (ADMM) optimizer. We demonstrate a proof of concept for solving Mixed-Integer Convex Programs (MICP) in power system applications using a use case on power distribution network reconfiguration in IBM quantum computers. Using the Qiskit ADMM optimizer, the MICP is decomposed into two subproblems: a quadratic unconstrained binary optimization (QUBO) solved by quantum algorithms and a convex one solved by classical solvers. Our essential contribution is integrating the Quantum Random Access Optimization (QRAO) into the quantum-classical distributed framework and the existing Quantum Approximate Optimization Algorithm (QAOA) implemented in the Qiskit ADMM Optimizer. QRAO utilizes Quantum Random Access Codes (QRACs) to minimize qubit requirements and utilizes quantum state rounding for solution extraction. We examine the impact of noise on solutions derived from QRAO and compare them with results from QAOA using a use case on network reconfiguration in response to faults in the power distribution system.
This paper aims to implement and evaluate the performance of quantum computing on solving combinatorial optimization problems arising from the operations of the power grid. To this end, we construct a novel mixed integer conic programming formulation for the reconfiguration of radial distribution network in response to faults in distribution lines. Comparing to existing bus injection model in the literature, our formulation based the branch flows model is theoretically equivalent without needing non-explainable variables, thus being more numerically stable. The network reconfiguration model is then used as a benchmark to evaluate the performance of quantum computing algorithms in real quantum computers. It shows that while current quantum computing algorithms with fast execution time in quantum computers can be a promising solution candidate, its heuristic nature stem from its theoretical foundation should be considered carefully when applying into power grid optimization problems.