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

Advanced Quantum Technologies

Leveraging Quantum Annealing for Layout Optimization

Luca Nigro, Simone Sala, Alfonso Amendola, Enrico Prati

Published Sep 29, 2025• 1 citation
Publisher

Abstract

Abstract Layout optimization problems involve finding the optimal arrangement of elements in order to maximize efficiency. For instance, the wind farm layout optimization (WFLO) problem consists of the best turbine placement to maximize energy production while minimizing wake losses. As its nonlinear and combinatorial nature makes it challenging for traditional optimization methods, alternative approaches such as quantum annealing and quantum‐classical hybrid methods offer a promising alternative for tackling such complex problems. Here, WFLO is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem using the Jensen wake model. A quantum annealer is compared, the Gurobi solver, and the Quantum Approximate Optimization Algorithm (QAOA). The quantum annealer provides solutions one order of magnitude faster than Gurobi with at most 3% lower power output, making it suitable for rapid suboptimal approximations. These findings highlight the trade‐off between the quality of the solution and the computational time and demonstrate how quantum methods, especially when combined with classical solvers, can contribute to efficient renewable energy optimization.

DOI
10.1002/qute.202500358

Related papers

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

James Hancock, Matthew J. Craven, Craig Mcneile A +1 more

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 ... | Find, read and cite all the research you need on Tech Science Press

arXiv:2312.13123•Journal of quantum computing•Jan 1, 2025•1 citation

Benchmarking quantum-annealing-based approaches for factory layout planning

Xiangqian Wu, Philipp Schworm, Marcel Wagner +1 more

The earlystage of factory layout planning has a direct effect on the operating costs, efficiency, and productivity of manufacturing systems. Conventional automated planning approaches often face a trade-off between solution quality and computational effort. Recent studies have investigated the potential of quantum annealing (QA) for solving factory layout planning problems. However, existing studies have mainly focused on individual QA-based formulations, whereas current hybrid QA solvers support multiple model types that combine QA and classical methods. To explore the potential of QA for factory layout planning, this paper benchmarks four QA based approaches implemented with the corresponding solvers, including an iterative binary quadratic model (IBQM), a hybrid discrete quadratic model (HDQM), a hybrid constrained quadratic model (HCQM), and a hybrid nonlinear model (HNLM). To improve scalability, an iterative decomposition strategy is developed for IBQM, while a candidate selection procedure is introduced for HDQM. The approaches are benchmarked against genetic algorithm, particle swarm optimization, and a hybrid tabu search and simulated annealing approach on 14 layout instances with different layout sizes, geometric complexity, spatial restrictions, and transport route configurations. The comparative analysis considers solution quality, computation time, and scalability. The results show that QA-based approaches achieve competitive solution quality and substantial computational advantages, reducing computation time by up to 94.51% relative to the classical reference methods. Among them, IBQM obtains the best solution quality in 78.6% of the instances, with a maximum improvement of 17.41% associated with an 81.34% reduction in computation time. These findings provide a basis for their further application in industrial layout planning.

quant-pharXiv:2610.35478•Oct 27, 2026•0 citations

Possible application of quantum computing in the field of ocean engineering: optimization of an offshore wind farm layout with the Ising model

Hiroshi Kagemoto

Abstract As a possible application of quantum computing in the field of ocean engineering, an attempt is made to identify the optimum layout of an offshore wind farm with the quasi-quantum annealing method while assuming a wake model that conforms to the standard Jensen–Katic wake model but can be implemented in the Ising model. The optimum layouts obtained in the present study are compared with those identified with other conventional methods such as the genetic algorithm. It is confirmed that the quasi-quantum annealing method works as well as other methods in identifying the optimum layouts, while the optimum layout of an offshore wind farm composed of even more than 100 wind turbines can be identified with reasonable CPU time.

Journal of Ocean Engineering and Marine Energy•Aug 31, 2024•3 citations

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

•Sep 3, 2026•0 citations

Leveraging Non-Exact QUBO Formulation With Quantum Annealing to Optimize 5G Base Station Power Selection

Chihiro Dogo, Kazuhiro Saito, Masashi Tawada +1 more

As global energy demand continues to rise, efficient energy management is essential to support the growing integration of renewable energy in the energy mix while controlling operational costs. This paper introduces a method that leverages non-exact Quadratic Unconstrained Binary Optimization (QUBO) formulation combined with tailored post-processing to boost the optimization of the energy management problem of 5G base stations. Unlike traditional rule-based approaches, which rely heavily on domain expertise and manual design, we propose a systematic QUBO-based framework suitable for Quantum Annealing (QA). The proposed formulation significantly reduces the number of decision variables (from 1995 in an exact QUBO to approximately 144) making it compatible with current QA hardware while producing high-quality solutions. Furthermore, the post-processing steps further improve solution quality, increasing the global optimal solution achievement rate by 10–15% depending on the solver. Experimental results demonstrate that the proposed method is deployable on current hardware and achieves performance comparable to conventional rule-based systems. Such observations highlight the potential of such designs in solving real-world optimization challenges.

IEEE Access•Jan 1, 2026•0 citations

Quantum Optimization in Multi-Objective Design of Renewable Energy Conversion Systems

Abdullah Genc

The design and operation of renewable energy conversion systems—such as wind turbines, solar photovoltaic arrays, and hybrid storage networks—require balancing multiple, often conflicting objectives, including energy efficiency, cost minimization, environmental impact, and system reliability. Traditional optimization techniques, while effective for isolated parameters, struggle with the combinatorial complexity and nonlinear interdependencies inherent to integrated energy systems. This study explores the application of quantum optimization algorithms in multi-objective renewable energy design, emphasizing how quantum annealing, Quantum Approximate Optimization Algorithm (QAOA), and Variational Quantum Eigensolver (VQE) frameworks can accelerate solution discovery and improve design precision. By leveraging the principles of superposition and entanglement, quantum systems can process vast design spaces in parallel, enabling the rapid evaluation of trade-offs among competing objectives. A hybrid quantum–classical workflow is proposed to integrate quantum solvers into existing computational pipelines for system simulation, control optimization, and energy forecasting. Preliminary modeling results and conceptual simulations indicate that quantum-enhanced optimization not only reduces computation time but also achieves higher Pareto-optimal efficiency compared to conventional multi-objective genetic algorithms and particle swarm optimizers. This interdisciplinary approach demonstrates the transformative potential of quantum computation in sustainable energy system design, supporting the global transition toward carbon neutrality and energy equity. By embedding quantum optimization into renewable infrastructure development, the study provides a foundation for next-generation decision-making frameworks that harmonize performance, sustainability, and scalability.

Human computer interaction.•Nov 12, 2025•0 citations
Abstract Layout optimization problems involve finding the optimal arrangement of elements in order to maximize efficiency. For instance, the wind farm layout optimization (WFLO) problem consists of the best turbine placement to maximize energy production while minimizing wake losses. As its nonlinear and combinatorial nature makes it challenging for traditional optimization methods, alternative approaches such as quantum annealing and quantum‐classical hybrid methods offer a promising alternative for tackling such complex problems. Here, WFLO is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem using the Jensen wake model. A quantum annealer is compared, the Gurobi solver, and the Quantum Approximate Optimization Algorithm (QAOA). The quantum annealer provides solutions one order of magnitude faster than Gurobi with at most 3% lower power output, making it suitable for rapid suboptimal approximations. These findings highlight the trade‐off between the quality of the solution and the computational time and demonstrate how quantum methods, especially when combined with classical solvers, can contribute to efficient renewable energy optimization.
The earlystage of factory layout planning has a direct effect on the operating costs, efficiency, and productivity of manufacturing systems. Conventional automated planning approaches often face a trade-off between solution quality and computational effort. Recent studies have investigated the potential of quantum annealing (QA) for solving factory layout planning problems. However, existing studies have mainly focused on individual QA-based formulations, whereas current hybrid QA solvers support multiple model types that combine QA and classical methods. To explore the potential of QA for factory layout planning, this paper benchmarks four QA based approaches implemented with the corresponding solvers, including an iterative binary quadratic model (IBQM), a hybrid discrete quadratic model (HDQM), a hybrid constrained quadratic model (HCQM), and a hybrid nonlinear model (HNLM). To improve scalability, an iterative decomposition strategy is developed for IBQM, while a candidate selection procedure is introduced for HDQM. The approaches are benchmarked against genetic algorithm, particle swarm optimization, and a hybrid tabu search and simulated annealing approach on 14 layout instances with different layout sizes, geometric complexity, spatial restrictions, and transport route configurations. The comparative analysis considers solution quality, computation time, and scalability. The results show that QA-based approaches achieve competitive solution quality and substantial computational advantages, reducing computation time by up to 94.51% relative to the classical reference methods. Among them, IBQM obtains the best solution quality in 78.6% of the instances, with a maximum improvement of 17.41% associated with an 81.34% reduction in computation time. These findings provide a basis for their further application in industrial layout planning.
Abstract As a possible application of quantum computing in the field of ocean engineering, an attempt is made to identify the optimum layout of an offshore wind farm with the quasi-quantum annealing method while assuming a wake model that conforms to the standard Jensen–Katic wake model but can be implemented in the Ising model. The optimum layouts obtained in the present study are compared with those identified with other conventional methods such as the genetic algorithm. It is confirmed that the quasi-quantum annealing method works as well as other methods in identifying the optimum layouts, while the optimum layout of an offshore wind farm composed of even more than 100 wind turbines can be identified with reasonable CPU time.
This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.
As global energy demand continues to rise, efficient energy management is essential to support the growing integration of renewable energy in the energy mix while controlling operational costs. This paper introduces a method that leverages non-exact Quadratic Unconstrained Binary Optimization (QUBO) formulation combined with tailored post-processing to boost the optimization of the energy management problem of 5G base stations. Unlike traditional rule-based approaches, which rely heavily on domain expertise and manual design, we propose a systematic QUBO-based framework suitable for Quantum Annealing (QA). The proposed formulation significantly reduces the number of decision variables (from 1995 in an exact QUBO to approximately 144) making it compatible with current QA hardware while producing high-quality solutions. Furthermore, the post-processing steps further improve solution quality, increasing the global optimal solution achievement rate by 10–15% depending on the solver. Experimental results demonstrate that the proposed method is deployable on current hardware and achieves performance comparable to conventional rule-based systems. Such observations highlight the potential of such designs in solving real-world optimization challenges.
The design and operation of renewable energy conversion systems—such as wind turbines, solar photovoltaic arrays, and hybrid storage networks—require balancing multiple, often conflicting objectives, including energy efficiency, cost minimization, environmental impact, and system reliability. Traditional optimization techniques, while effective for isolated parameters, struggle with the combinatorial complexity and nonlinear interdependencies inherent to integrated energy systems. This study explores the application of quantum optimization algorithms in multi-objective renewable energy design, emphasizing how quantum annealing, Quantum Approximate Optimization Algorithm (QAOA), and Variational Quantum Eigensolver (VQE) frameworks can accelerate solution discovery and improve design precision. By leveraging the principles of superposition and entanglement, quantum systems can process vast design spaces in parallel, enabling the rapid evaluation of trade-offs among competing objectives. A hybrid quantum–classical workflow is proposed to integrate quantum solvers into existing computational pipelines for system simulation, control optimization, and energy forecasting. Preliminary modeling results and conceptual simulations indicate that quantum-enhanced optimization not only reduces computation time but also achieves higher Pareto-optimal efficiency compared to conventional multi-objective genetic algorithms and particle swarm optimizers. This interdisciplinary approach demonstrates the transformative potential of quantum computation in sustainable energy system design, supporting the global transition toward carbon neutrality and energy equity. By embedding quantum optimization into renewable infrastructure development, the study provides a foundation for next-generation decision-making frameworks that harmonize performance, sustainability, and scalability.