The proposed framework provides a feasible and scalable pathway for quantum optimization in large-scale power systems and substantially reduces quantum-resource demand and circuit complexity relative to monolithic QAOA, allowing large islanding problems to be addressed within current hardware limits.
Abstract
Growing integration of distributed energy resources increases power-system variability and uncertainty. During disturbances, these effects can intensify generation-load imbalances and cascading failures. Controlled islanding limits their propagation by partitioning a compromised grid into connected, electrically sustainable islands. However, classical methods face rapidly growing computational costs as network size and island count increase. Quantum optimization offers an alternative for exploring this combinatorial partition space. Yet monolithic quantum formulations encode all assignment decisions in one circuit, causing qubit demand and circuit complexity to scale with network size. In this study, a qubit-bounded sequential distributed quantum approximate optimization algorithm (QAOA) framework is proposed to tackle coherent controlled islanding under limited quantum resources. It formulates the optimization as boundary-conditioned regional quadratic unconstrained binary optimization (QUBO) subproblems that are solved sequentially within a fixed qubit budget. Thus, circuit width remains independent of network size, with aggregate quantum workload scaling linearly on bounded-degree networks. Evaluation covers eleven IEEE systems from 9 to 300 buses using IBM quantum computing resources, with Gurobi and monolithic QAOA as references. Across all systems, the framework recovers feasible Gurobi-optimal partitions under noise, confirming the resilience of its solution quality. The results further show that the proposed method substantially reduces quantum-resource demand and circuit complexity relative to monolithic QAOA, allowing large islanding problems to be addressed within current hardware limits. The proposed framework provides a feasible and scalable pathway for quantum optimization in large-scale power systems.
A qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement is presented, offering a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.
DPRQ is proposed, a qubit routing algorithm for minimizing inter-node communication in distributed quantum circuits divided into collective communication blocks that employs a dynamic programming-based technique focused on global circuit-level optimization, while capturing inter-block dependencies.
Dhaval Vaidya, Ruozhou Yu· Proceedings of the 3rd ACM S...· 0 citations
It is demonstrated that traditional communication metrics are insufficient predictors of execution quality due to the strong interaction among path fidelity, hardware characteristics, and circuit structure, and a topology-aware fidelity proxy (TAFP) evaluation approach that approximates distributed execution fidelity i...
Yeong Lim Tan, Sen Zhang, Haneen Alfauri et al.· Proceedings of the 3rd ACM S...· 0 citations
These quantitative findings demonstrate that tightly coupled hybrid co-processing, physically adjacent to the control electronics, is critical for extending the computational bound of Noisy Intermediate-Scale Quantum (NISQ) devices.
Akshay Joseph, R. Delhibabu· Frontiers of Computer Scienc...· 0 citations
This study systematically assesses diverse partitioning algorithms across standardized workloads and quantum network topologies to quantify the performance impact of network constraints and demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.
Javier Vela-Tambo, Davud Azizov, Tian Guo· 0 citations
An architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process (MDP), where compiler-level communication actions dynamically update logical-qubit placement and enable subsequent gate execution.
Chien-Tung Kuo, Felix Burt, Samuel Yen-Chi Chen et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.