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:2606.15083

REGRID-QAOA: A Resource-Efficient Hybrid QAOA Framework for Physics-Constrained Power System Islanding

Yuqi Jiang, Yuqi Zhang, Zhiding Liang, Qiang Guan, Yan Li, Ganesh Kumar Venayagamoorthy

quant-pheess.SYSubmitted Jun 13, 2026• Announced Jun 16, 2026• 4 citations• Revised Jun 28, 2026 (v2)
v1 · Jun 13, 2026v2 · Jun 28, 2026
arXivHTMLPDF

Abstract

Quantum computing has rapidly emerged as a powerful paradigm for tackling computationally demanding problems. In particular, quantum optimization shows strong promise for hard combinatorial problems in power systems, where increasing distributed energy penetration heightens the need for intentional islanding to maintain grid reliability and resilience. However, power system islanding is an NP-hard combinatorial optimization problem that becomes computationally prohibitive for classical solvers as network size grows, motivating the use of quantum computing as a promising alternative pipeline. This study develops a resource-efficient hybrid QAOA islanding framework that brings physics-constrained power-system partitioning into the quantum optimization workflow. The framework combines coherency-informed graph reduction, physics-aware constraint modeling, and structured post-processing to efficiently convert shallow-circuit QAOA samples into high-quality feasible islanding decisions without deep circuits or large shot budgets. The proposed framework is validated on the standard IEEE benchmark systems (9-, 14-, 24-, 30-, 39-, and 57-bus), demonstrating that the hybrid workflow achieves Gurobi-optimal solution quality with a clear quantum resource advantage over vanilla QAOA, while the resulting islanding solutions satisfy all physical feasibility requirements after network separation. This study establishes QAOA-based islanding as a viable quantum approach for critical infrastructure, with structured post-processing as the key enabler of quantum resource efficiency.

Related papers

PACE-QAOA: Physics-Constrained Quantum Optimization for Qubit-Efficient Power System Islanding

Yuqi Jiang, Zhiding Liang, Qiang Guan +2 more

Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.

quant-pharXiv:2608.02789•Aug 5, 2026•2 citations

SPLIT-Q: A Scalable Sequential Quantum Computing Framework for Coherent Controlled Islanding

Yuqi Jiang, Zhiding Liang, Qiang Guan +2 more

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.

quant-pharXiv:2608.12711•Aug 14, 2026•0 citations

Q-MAP: Multi-Platform Benchmarking of Distributed Quantum Computing for Coherent Controlled Islanding

Yuqi Jiang, Zhiding Liang, Qiang Guan +2 more

The integration of distributed energy resources into power networks is accelerating. The resulting variability narrows operating margins, so a disturbance can cascade into a wide-area blackout. Controlled islanding arrests that propagation by splitting a compromised grid into self-sustaining islands that keep coherent generators together. Exact classical solutions become intractable as the bus count and island number grow. Gate-based quantum optimization provides a different route through this combinatorial space, although its reach is limited when one circuit carries every bus assignment, since qubit count and depth then follow grid size. In this study, a round-synchronous distributed quantum computing framework is developed for coherent controlled islanding under a fixed per-circuit qubit budget. Every round derives all regional subproblems from one frozen grid-wide snapshot, dispatches them to independent quantum backends at the same time, and merges the returned candidates classically into one globally evaluated update. Circuits executed in parallel therefore keep a constant size as the grid grows, and a round costs the slowest region rather than the sum of all of them. Benchmarking spans IEEE systems from 9 to 300 buses on simulation and on quantum processors of different architectures. The framework attains optimal and operationally feasible partitions on every platform under noise, even where compilation cost differs by nearly an order of magnitude. Bounding width in this way places grids beyond the reach of monolithic circuits within range of present devices and establishes a multi-backend baseline for quantum computing in large-scale power-system optimization.

quant-pharXiv:2609.27829•Aug 20, 2026•0 citations

Constraint-Preserving QAOA for Real-Time Optimal Power Flow in Renewable-Rich Distribution Networks

Yalla Jnan Devi Satya Prasad, Sahil Ram Chatrati, Shaik Fathima Masthan

Modern distribution grids face unprecedented challenges from intermittent renewable integration, extreme weather events, and the need for real-time optimal power flow (OPF) solutions that preserve physical constraints while minimizing operational costs. This paper introduces Constraint-Aware QAOA for Real-Time Quantum Smart Grid Optimization, a novel hybrid quantum-classical framework that directly addresses renewable dispatch, battery scheduling, and demand response in distribution networks. We formulate the stochastic OPF problem with renewable integration as a constrained optimization challenge and propose three innovative solution approaches: (1) Constraint-Preserving QAOA (CP-QAOA) with a novel Power-Flow Preserving Mixer (PF-Mixer) that enforces Kirchhoff-style flow conservation during quantum evolution, (2) Phase-Encoded Power-Flow (PEPF) mapping that reduces qubit requirements by 3× through mixed binary-phase representation, and (3) Hybrid Receding-Horizon Quantum Controller (HRQC) enabling subminute reoptimization via intelligent problem decomposition. For renewable integration modeling, we develop multimodal fusion techniques combining real-time generation forecasts, battery state-of-charge dynamics, and demand response signals with quantum superposition states. Our experimental evaluation on IEEE test systems with realistic renewable penetration scenarios demonstrates significant improvements: the CP-QAOA approach achieves 18.3% reduction in operational costs compared to classical OPF baselines, while quantum methods provide > 95% constraint feasibility compared to < 31% for standard QAOA with penalty encoding. The hybrid framework shows strong promise for scalable deployment in real smart grid infrastructure, with practical implications for quantum-enhanced grid operations under high renewable penetration.

•Oct 6, 2025•0 citations

Quantum Computing-Enabled Contingency Analysis for Power Systems

Yuqi Jiang, Zhiding Liang, Yan Li +2 more

The rapid development of quantum computing has provided a ground-breaking tool for solving problems that are insurmountable on classical computers. In the power system domain, quantum computing is still in the nascent stage, with limited but ongoing studies. The Quantum Approximation Optimization Algorithm (QAOA) has been applied in solving several NPhard problems and can be further studied to address challenging problems in power systems. Key applications include contingency analysis, optimal power flow, and unit commitment, among others. With the significant integration of renewable energy, the intermittent nature of renewable energy introduces substantial volatility to the system. An overhead contingency analysis is required to evaluate the possible system outage scenarios, which will identify critical contingencies to maintain system stability. However, the contingency analysis is a prototypical NP-Hard problem, requiring substantial classical computation resources. In this work, QAOA is developed for the$N-k$contingency analysis on line contingency as well as the general contingency scenarios, with the aim of minimizing the shedding of the power load while ensuring the power flow constraints. A tailored objective function is developed to encode the$N-k$contingency condition as well as the power flow loss constraints into a problem Hamiltonian for QAOA computation. The developed method is verified on IEEE 9- and 14-bus systems compared with classical methods as the baseline. In addition, a QAOA parameter study including the number of QAOA parameters, the number of repetitions of the quantum circuits execution, and the number of iteration steps of the classical optimization algorithm, is conducted to offer insights for the parameter tuning under different problem sizes. This work is anticipated to establish a quantum framework for solving critical and complex power system problems in the Noisy intermediate-scale quantum (NISQ) era.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Physics-Informed Hybrid Quantum-Classical Dispatching for Large-Scale Renewable Power Systems:A Noise-Resilient Framework

Fu Zhang, Yuming Zhao

The integration of high-penetration renewable energy introduces significant stochasticity and non-convexity into power system dispatching, challenging the computational limits of classical optimization. While Variational Quantum Algorithms (VQAs) on Noisy Intermediate-Scale Quantum (NISQ) devices offer a promising path for combinatorial acceleration, existing approaches typically treat the power grid as a "black box", suffering from poor scalability (barren plateaus) and frequent violations of physical constraints. Bridging these gaps, this paper proposes a Physics-Informed Hybrid Quantum-Classical Dispatching (PI-HQCD) framework. We construct a topology-aware Hamiltonian that explicitly embeds linearized power flow equations, storage dynamics, and multi-timescale coupling directly into the quantum substrate, significantly reducing the search space dimensionality. We further derive a noise-adaptive regularization mechanism that theoretically bounds the effective Lipschitz constant of the objective function, guaranteeing convergence stability under realistic quantum measurement noise. Numerical experiments on the IEEE 39-bus benchmark and a 118-bus regional grid demonstrate that PI-HQCD achieves superior economic efficiency and higher renewable utilization compared to stochastic dual dynamic programming (SDDP). Theoretical analysis confirms that this topology-aware design leads to an O(1/N) gradient variance scaling, effectively mitigating barren plateaus and ensuring scalability for larger networks. This work establishes a rigorous paradigm for embedding engineering physics into quantum computing, paving the way for practical quantum advantage in next-generation grid operations.

quant-pharXiv:2601.18482•Jan 27, 2026•2 citations
Quantum computing has rapidly emerged as a powerful paradigm for tackling computationally demanding problems. In particular, quantum optimization shows strong promise for hard combinatorial problems in power systems, where increasing distributed energy penetration heightens the need for intentional islanding to maintain grid reliability and resilience. However, power system islanding is an NP-hard combinatorial optimization problem that becomes computationally prohibitive for classical solvers as network size grows, motivating the use of quantum computing as a promising alternative pipeline. This study develops a resource-efficient hybrid QAOA islanding framework that brings physics-constrained power-system partitioning into the quantum optimization workflow. The framework combines coherency-informed graph reduction, physics-aware constraint modeling, and structured post-processing to efficiently convert shallow-circuit QAOA samples into high-quality feasible islanding decisions without deep circuits or large shot budgets. The proposed framework is validated on the standard IEEE benchmark systems (9-, 14-, 24-, 30-, 39-, and 57-bus), demonstrating that the hybrid workflow achieves Gurobi-optimal solution quality with a clear quantum resource advantage over vanilla QAOA, while the resulting islanding solutions satisfy all physical feasibility requirements after network separation. This study establishes QAOA-based islanding as a viable quantum approach for critical infrastructure, with structured post-processing as the key enabler of quantum resource efficiency.
Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.
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.
The integration of distributed energy resources into power networks is accelerating. The resulting variability narrows operating margins, so a disturbance can cascade into a wide-area blackout. Controlled islanding arrests that propagation by splitting a compromised grid into self-sustaining islands that keep coherent generators together. Exact classical solutions become intractable as the bus count and island number grow. Gate-based quantum optimization provides a different route through this combinatorial space, although its reach is limited when one circuit carries every bus assignment, since qubit count and depth then follow grid size. In this study, a round-synchronous distributed quantum computing framework is developed for coherent controlled islanding under a fixed per-circuit qubit budget. Every round derives all regional subproblems from one frozen grid-wide snapshot, dispatches them to independent quantum backends at the same time, and merges the returned candidates classically into one globally evaluated update. Circuits executed in parallel therefore keep a constant size as the grid grows, and a round costs the slowest region rather than the sum of all of them. Benchmarking spans IEEE systems from 9 to 300 buses on simulation and on quantum processors of different architectures. The framework attains optimal and operationally feasible partitions on every platform under noise, even where compilation cost differs by nearly an order of magnitude. Bounding width in this way places grids beyond the reach of monolithic circuits within range of present devices and establishes a multi-backend baseline for quantum computing in large-scale power-system optimization.
Modern distribution grids face unprecedented challenges from intermittent renewable integration, extreme weather events, and the need for real-time optimal power flow (OPF) solutions that preserve physical constraints while minimizing operational costs. This paper introduces Constraint-Aware QAOA for Real-Time Quantum Smart Grid Optimization, a novel hybrid quantum-classical framework that directly addresses renewable dispatch, battery scheduling, and demand response in distribution networks. We formulate the stochastic OPF problem with renewable integration as a constrained optimization challenge and propose three innovative solution approaches: (1) Constraint-Preserving QAOA (CP-QAOA) with a novel Power-Flow Preserving Mixer (PF-Mixer) that enforces Kirchhoff-style flow conservation during quantum evolution, (2) Phase-Encoded Power-Flow (PEPF) mapping that reduces qubit requirements by 3× through mixed binary-phase representation, and (3) Hybrid Receding-Horizon Quantum Controller (HRQC) enabling subminute reoptimization via intelligent problem decomposition. For renewable integration modeling, we develop multimodal fusion techniques combining real-time generation forecasts, battery state-of-charge dynamics, and demand response signals with quantum superposition states. Our experimental evaluation on IEEE test systems with realistic renewable penetration scenarios demonstrates significant improvements: the CP-QAOA approach achieves 18.3% reduction in operational costs compared to classical OPF baselines, while quantum methods provide > 95% constraint feasibility compared to < 31% for standard QAOA with penalty encoding. The hybrid framework shows strong promise for scalable deployment in real smart grid infrastructure, with practical implications for quantum-enhanced grid operations under high renewable penetration.
The rapid development of quantum computing has provided a ground-breaking tool for solving problems that are insurmountable on classical computers. In the power system domain, quantum computing is still in the nascent stage, with limited but ongoing studies. The Quantum Approximation Optimization Algorithm (QAOA) has been applied in solving several NPhard problems and can be further studied to address challenging problems in power systems. Key applications include contingency analysis, optimal power flow, and unit commitment, among others. With the significant integration of renewable energy, the intermittent nature of renewable energy introduces substantial volatility to the system. An overhead contingency analysis is required to evaluate the possible system outage scenarios, which will identify critical contingencies to maintain system stability. However, the contingency analysis is a prototypical NP-Hard problem, requiring substantial classical computation resources. In this work, QAOA is developed for theN−kN-kN−kcontingency analysis on line contingency as well as the general contingency scenarios, with the aim of minimizing the shedding of the power load while ensuring the power flow constraints. A tailored objective function is developed to encode theN−kN-kN−kcontingency condition as well as the power flow loss constraints into a problem Hamiltonian for QAOA computation. The developed method is verified on IEEE 9- and 14-bus systems compared with classical methods as the baseline. In addition, a QAOA parameter study including the number of QAOA parameters, the number of repetitions of the quantum circuits execution, and the number of iteration steps of the classical optimization algorithm, is conducted to offer insights for the parameter tuning under different problem sizes. This work is anticipated to establish a quantum framework for solving critical and complex power system problems in the Noisy intermediate-scale quantum (NISQ) era.
The integration of high-penetration renewable energy introduces significant stochasticity and non-convexity into power system dispatching, challenging the computational limits of classical optimization. While Variational Quantum Algorithms (VQAs) on Noisy Intermediate-Scale Quantum (NISQ) devices offer a promising path for combinatorial acceleration, existing approaches typically treat the power grid as a "black box", suffering from poor scalability (barren plateaus) and frequent violations of physical constraints. Bridging these gaps, this paper proposes a Physics-Informed Hybrid Quantum-Classical Dispatching (PI-HQCD) framework. We construct a topology-aware Hamiltonian that explicitly embeds linearized power flow equations, storage dynamics, and multi-timescale coupling directly into the quantum substrate, significantly reducing the search space dimensionality. We further derive a noise-adaptive regularization mechanism that theoretically bounds the effective Lipschitz constant of the objective function, guaranteeing convergence stability under realistic quantum measurement noise. Numerical experiments on the IEEE 39-bus benchmark and a 118-bus regional grid demonstrate that PI-HQCD achieves superior economic efficiency and higher renewable utilization compared to stochastic dual dynamic programming (SDDP). Theoretical analysis confirms that this topology-aware design leads to an O(1/N) gradient variance scaling, effectively mitigating barren plateaus and ensuring scalability for larger networks. This work establishes a rigorous paradigm for embedding engineering physics into quantum computing, paving the way for practical quantum advantage in next-generation grid operations.