Investigating methods to solve large windfarm optimization problems with a minimum number of qubits using circuit-based quantum computers
James Hancock, Matthew Craven, Craig McNeile
TL;DR
The paper tackles windfarm layout optimization by casting WFLO as a QUBO and developing two quantum encodings, Pauli correlation encoding (PCE) and single-qubit operator encoding (SQOE), to dramatically reduce qubit requirements. It demonstrates through toy and real-world windfarm models (including Alltwalis, on grids up to 9×9) that SQOE generally yields higher-quality solutions and more favorable time scaling than PCE, while requiring shallower circuits. Across power-output tests and scaling analyses, the quantum approaches show competitive performance relative to a classical solver (Gurobi) and exhibit promising scaling, though full hardware demonstrations with quantum error mitigation remain for future work. The results suggest a viable path for applying circuit-based quantum optimization to WFLO and, more broadly, to other NP-hard combinatorial problems in energy systems and beyond.
Abstract
This study investigates quantum computing approaches for solving the windfarm layout optimization (WFLO) problems formulated as a quadratic unconstrained binary optimization (QUBO) problem. We investigate two encoding methods that require fewer than one qubit per grid point: the previously developed Pauli correlation encoding (PCE) and a novel single-qubit operator encoding (SQOE). These methods are tested on three windfarm configurations - two from prior WFLO scaling studies and a new real-world model based on an existing windfarm in Wales. The improved encoding methods allow us to solve WFLO problems on $9\times 9$ grids using up to 20 qubits on a quantum computer simulator. The results show that both encoding methods perform competitively and demonstrate favorable scaling characteristics across the tested systems.
