Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer

• URL: http://arxiv.org/abs/2312.13123v3
• Date: Tue, 19 Aug 2025 18:30:59 GMT
• Title: Investigating Techniques to Optimise the Layout of Turbines in a Windfarm using a Quantum Computer
• Authors: James Hancock, Matthew J. Craven, Craig McNeile, Davide Vadacchino,
• Abstract summary: Wind energy plays a critical role in the transition toward sustainable power systems.<n>The optimal placement of turbines remains a challenging problem due to complex wake interactions.<n>We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver (VQE) implemented on Qiskit's quantum computer simulator.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper investigates Windfarm Layout Optimization (WFLO), where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization (QUBO) problem. Wind energy plays a critical role in the transition toward sustainable power systems, but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions. With recent advances in quantum computing, there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks. We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver (VQE) implemented on Qiskit's quantum computer simulator, employing a quantum noise-free, gate-based circuit model. Three classical optimizers are discussed, with a detailed analysis of the two most effective approaches: Constrained Optimization BY Linear Approximation (COBYLA) and Bayesian Optimization (BO). We compare these simulated quantum results with two established classical optimization methods: Simulated Annealing (SA) and the Gurobi solver. The study focuses on 4$\times$4 grid configurations (requiring 16 qubits), providing insights into near-term quantum algorithm applicability for renewable energy optimization.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Grid Cost Allocation in Peer-to-Peer Electricity Markets: Benchmarking Classical and Quantum Optimization Approaches [3.757262277494307]
  This paper presents a novel optimization approach for allocating grid operation costs in Peer-to-Peer (P2P) electricity markets using Quantum Computing (QC)<n>We develop a Quadratic Unconstrained Binary Optimization (QUBO) model that matches logical power flows between producer-consumer pairs with the physical power flow to distribute grid usage costs fairly.<n>The model is evaluated on IEEE test cases with up to 57 nodes, comparing Quantum Annealing (QA), hybrid quantum-classical algorithms, and classical optimization approaches.
  arXiv  Detail & Related papers  (2025-01-09T14:03:56Z)
• Gaussian boson sampling for binary optimization [0.0]
  We propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address binary optimization problems. Numerical experiments on 3-SAT and Graphing problems show significant performance gains over random guessing.
  arXiv  Detail & Related papers  (2024-12-19T12:12:22Z)
• Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking [1.6385815610837167]
  We investigate making posiform planted QUBOs computationally harder by fusing many smaller random discrete coefficient spin-glass Ising models. We benchmark the capabilities of three D-Wave superconducting qubit quantum annealing processors. We find that the D-Wave QPU ground-state sampling success rate does not change with respect to the size of the random QUBOs we employ.
  arXiv  Detail & Related papers  (2024-11-06T02:46:33Z)
• Feedback-Based Quantum Algorithm for Constrained Optimization Problems [0.6554326244334868]
  We introduce a new operator that encodes the problem's solution as its ground state. We show that our proposed algorithm saves computational resources by reducing the depth of the quantum circuit.
  arXiv  Detail & Related papers  (2024-06-12T12:58:43Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Guess What Quantum Computing Can Do for Test Case Optimization [43.89456212504871]
  In the near term, quantum approximate optimization algorithms (QAOAs) hold great potential to solve optimization problems. We present the first effort to formulate a software test case optimization problem as a QAOA problem and solve it on quantum computer simulators. To solve bigger test optimization problems that require many qubits, which are unavailable these days, we integrate a problem decomposition strategy with the QAOA.
  arXiv  Detail & Related papers  (2023-12-24T21:25:31Z)
• Gaussian Boson Sampling for binary optimization [0.0]
  We employ a Variational Quantum Eigensolver approach using the Conditional Value-at-risk cost function. We provide proof of principle by carrying out numerical simulations on randomly generated instances.
  arXiv  Detail & Related papers  (2023-12-12T13:00:55Z)
• Assessing Quantum Computing Performance for Energy Optimization in a Prosumer Community [1.072460284847973]
  "Prosumer problem" is the problem of scheduling the household loads on the basis of the user needs, the electricity prices, and the availability of local renewable energy. Quantum computers can offer a significant breakthrough in treating this problem thanks to the intrinsic parallel nature of quantum operations. We report on an extensive set of experiments, on simulators and real quantum hardware, for different problem sizes.
  arXiv  Detail & Related papers  (2023-11-17T15:48:51Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Phase-Binarized Spintronic Oscillators for Combinatorial Optimization, and Comparison with Alternative Classical and Quantum Methods [0.04660328753262073]
  Phase-binarized oscillators (PBO) have been proposed for Ising computing, and various device technologies have been used to experimentally implement such PBOs. We show that an array of four dipole-coupled uniform-mode spin Hall nano oscillators (SHNOs) can be used to implement such PBOs and solve the NP-Hard problem MaxCut on 4-node weighted graphs.
  arXiv  Detail & Related papers  (2023-06-26T09:04:03Z)
• Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes [0.0]
  Variational quantum algorithms (VQAs) represent a promising approach to utilizing current quantum computing infrastructures. We propose the quantum Broyden adaptive natural gradient (qBang) approach, a novel that aims to distill the best aspects of existing approaches.
  arXiv  Detail & Related papers  (2023-04-27T00:06:48Z)
• Quantum approximate optimization via learning-based adaptive optimization [5.399532145408153]
  Quantum approximate optimization algorithm (QAOA) is designed to solve objective optimization problems. Our results demonstrate that the algorithm greatly outperforms conventional approximations in terms of speed, accuracy, efficiency and stability. This work helps to unlock the full power of QAOA and paves the way toward achieving quantum advantage in practical classical tasks.
  arXiv  Detail & Related papers  (2023-03-27T02:14:56Z)
• Fermionic Quantum Approximate Optimization Algorithm [11.00442581946026]
  We propose fermionic quantum approximate optimization algorithm (FQAOA) for solving optimization problems with constraints. FQAOA tackle the constrains issue by using fermion particle number preservation to intrinsically impose them throughout QAOA. We provide a systematic guideline for designing the driver Hamiltonian for a given problem Hamiltonian with constraints.
  arXiv  Detail & Related papers  (2023-01-25T18:36:58Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Filtering variational quantum algorithms for combinatorial optimization [0.0]
  We introduce the Variational Quantum Eigensolver (F-VQE) which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. We also explore the use of causal cones to reduce the number of qubits required on a quantum computer.
  arXiv  Detail & Related papers  (2021-06-18T11:07:33Z)
• Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems [101.18253437732933]
  We develop a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate unconstrained binary optimization problems. We showcase the framework's performance on two inverse design problems by optimizing thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering.
  arXiv  Detail & Related papers  (2021-05-06T02:22:23Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.