Annealing-Based Quantum Computing for Combinatorial Optimal Power Flow

72Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes the use of annealing-based quantum computing for solving combinatorial optimal power flow problems. Quantum annealers provide a physical computing platform which utilises quantum phase transitions to solve specific classes of combinatorial problems. These devices have seen rapid increases in scale and performance, and are now approaching the point where they could be valuable for industrial applications. This paper shows how an optimal power flow problem incorporating linear multiphase network modelling, discrete sources of energy flexibility, renewable generation placement/sizing and network upgrade decisions can be formulated as a quadratic unconstrained binary optimisation problem, which can be solved by quantum annealing. Case studies with these components integrated with the IEEE European Low Voltage Test Feeder are implemented using D-Wave Systems' 5,760 qubit Advantage quantum processing unit and hybrid quantum-classical solver.

Cite

CITATION STYLE

APA

Morstyn, T. (2023). Annealing-Based Quantum Computing for Combinatorial Optimal Power Flow. IEEE Transactions on Smart Grid, 14(2), 1093–1102. https://doi.org/10.1109/TSG.2022.3200590

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free