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

Quantum Annealing Continuous Optimisation in Renewable Energy

Mansour Taghavi Azar Sharabiani, Vibe B. Jakobsen, Martin D. Jeppesen, Alireza S. Mahani

Published May 24, 2021• 12 citations
arXivHTMLPDF

Abstract

Renewable energy optimisation poses computationally-intensive challenges. Yet, often the continuous nature of the decision space precludes the use of many emerging, non-von-Neumann computing platforms such as quantum annealing, which are limited to discrete problems. We propose Quantum Annealing Continuous Optimisation (QuAnCO), a Trust Region (TR)-based algorithm, where the TR Newton sub-problem is transformed into Quadratic Unconstrained Binary Optimisation (QUBO), thereby allowing the use of Ising solvers such as D-Wave's quantum annealer. This transformation to QUBO is done by 1) using a hyper-rectangular shape for the TR, 2) discrete representation of each continuous dimension using an interval-bounded integer, and 3) binary encoding of the resulting bounded integers. We tackle a real-world challenge of optimising the biomass mix selection for Nature Energy, the largest biogas producer in Europe, thus providing evidence of feasibility and performance advantage in using QuAnCO in green energy production, and beyond.

DOI
10.48550/arxiv.2105.11322

Related papers

Quantum Computing in Green Energy Production

Mansour T. A. Sharabiani, Vibe B. Jakobsen, Martin Jeppesen +1 more

Addressing the world's climate emergency is an uphill battle and requires a multifaceted approach including optimal deployment of green-energy alternatives. This often involve time-consuming optimisation of black-box models in a continuous parameter space. Despite recent advances in quantum computing, real-world applications have thus far been mostly confined to problems such as graph partitioning, traffic routing and task scheduling, where parameter space is discrete and graph connectivity is sparse. Here we propose the quantum nonlinear programming (QNLP) framework for casting an NLP problem - in continuous space - as quadratic unconstrained binary optimisation (QUBO), which can be subsequently solved using special-purpose solvers such as quantum annealers (QA) and coherent Ising machines (CIMs). QNLP consists of four steps: quadratic approximation of cost function, discretisation of parameter space, binarisation of discrete space, and solving the resulting QUBO. Linear and nonlinear constraints are incorporated into the resulting QUBO using slack variables and quadratic penalty terms. We apply our QNLP framework to optimisation of the daily feed rate of various biomass types at Nature Energy, the largest biogas producer in Europe. Optimising biomass selection improves the profitability of biomethane production, thus contributing to sustainable carbon-neutral energy production. For solving the QUBO, we use D-Wave's quantum annealers. We observe good performance on the DW-2000Q QPU, and higher sensitivity of performance to number of samples and annealing time for the Advantage QPU. We hope that our proposed QNLP framework provides a meaningful step towards overcoming the computational challenges posed by high-dimensional continuous-optimisation problems, especially those encountered in our battle against man-made climate change.

•May 24, 2021•3 citations

Annealing-Based Quantum Computing for Combinatorial Optimal Power Flow

Thomas Morstyn

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.

IEEE Transactions on Smart Grid•Aug 22, 2022•89 citations

Decarbonization energy concept selection with optimal design and operation by using quantum computing

Rushit Amishbhai Kansara, María Isabel Roldán Serrano, Martin Bähr

The industrial sector is a major contributor to total energy-related CO2 emissions in Europe, making the transition of existing industrial systems toward renewable energy solutions a key priority. Decarbonization strategies focus on integrating novel energy transition concepts into existing production sites. These concepts encompass various renewable energy sources along with conversion technologies. Additionally, energy storage systems enhance flexibility and security of energy supply when incorporated into such concepts. The key challenge is to select the optimal combination of these energy components with optimal capacity and operation to meet the energy demand while minimizing both CO2 emissions and costs. This entire synthesis optimization problem is typically formulated as a mixed-integer non-linear programming problem with discrete and continuous variables that is computationally intensive to solve. A promising approach to tackle this complexity is to leverage quantum computing to optimize the selection and configuration of energy components as part of the synthesis problem, which consists primarily of binary decision variables. The decisions of the remaining continuous design and operation variables can be solved as a non-linear programming problem on classical computers. This hybrid approach is presented here and the formulation for solving binary decisions problems is discussed in detail. The results of the binary optimization problems are compared between quantum annealing (QA) and classical solvers such as Gurobi and simulated annealing. QA shows faster computation compared to the classical solvers, but the optimality gap of QA increases with increasing problem size. However, QA systems will become more fault-tolerant and powerful and can be used effectively in the future to optimize a vast range of binary decisions problems. By appropriately integrating quantum computing into the decision-making process, industrial stakeholders can explore a broader range of decarbonization scenarios faster, enabling more effective and cost-efficient energy transition strategies.

•May 1, 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 Annealing for Optimizing Unit Scheduling in Renewable Energy Systems: Formulation and Evaluation

Sven Müller, M. Dukalski, Frank Phillipson

This paper investigates the use of Quantum Annealing (QA) devices for optimizing unit scheduling in renewable energy systems, addressing the challenge of energy balancing with intermittent generation. We compare two approaches for encoding inequality constraints in Quadratic Unconstrained Binary Optimization (QUBO) formulations: (a) the conventional slack-variable-based method and (b) a novel soft-encoding technique called unbalanced penalization. This first application of unbalanced penalization in the energy and power systems domain, aims to disseminate knowledge about near-term applications of quantum-computing and how to make best use of it within the community. Through computational experiments, we find thatUnbalanced Penalizationconsistently outperforms the conventional method of using slack variables by reducing the number of variables in the QUBO formulation. Despite this, its inherent nature penalizes feasible solutions unevenly, preventing the ability to handle much larger problem sizes. More broadly, we observe that both methods-like most pure quantum approaches-struggle with scalability on current QA hardware, as solution quality declines with increasing problem size. In light of these limitations, we assess the feasibility of purely quantum solutions and argue that hybrid approaches remain the most practical path forward.

IEEE Transactions on Power Systems•Aug 21, 2025•4 citations

Quadratic Continuous Quantum Optimization

Sascha Mücke, Thore Gerlach, Nico Piatkowski

Quantum annealers can solve QUBO problems efficiently but struggle with continuous optimization tasks like regression due to their discrete nature. We introduce Quadratic Continuous Quantum Optimization (QCQO), an anytime algorithm that approximates solutions to unconstrained quadratic programs via a sequence of QUBO instances. Rather than encoding real variables as binary vectors, QCQO implicitly represents them using continuous QUBO weights and iteratively refines the solution by summing sampled vectors. This allows flexible control over the number of binary variables and adapts well to hardware constraints. We prove convergence properties, introduce a step size adaptation scheme, and validate the method on linear regression. Experiments with simulated and real quantum annealers show that QCQO achieves accurate results with fewer qubits, though convergence slows on noisy hardware. Our approach enables quantum annealing to address a wider class of continuous problems.

quant-pharXiv:2512.24759•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Jan 1, 2026•0 citations
Renewable energy optimisation poses computationally-intensive challenges. Yet, often the continuous nature of the decision space precludes the use of many emerging, non-von-Neumann computing platforms such as quantum annealing, which are limited to discrete problems. We propose Quantum Annealing Continuous Optimisation (QuAnCO), a Trust Region (TR)-based algorithm, where the TR Newton sub-problem is transformed into Quadratic Unconstrained Binary Optimisation (QUBO), thereby allowing the use of Ising solvers such as D-Wave's quantum annealer. This transformation to QUBO is done by 1) using a hyper-rectangular shape for the TR, 2) discrete representation of each continuous dimension using an interval-bounded integer, and 3) binary encoding of the resulting bounded integers. We tackle a real-world challenge of optimising the biomass mix selection for Nature Energy, the largest biogas producer in Europe, thus providing evidence of feasibility and performance advantage in using QuAnCO in green energy production, and beyond.
Addressing the world's climate emergency is an uphill battle and requires a multifaceted approach including optimal deployment of green-energy alternatives. This often involve time-consuming optimisation of black-box models in a continuous parameter space. Despite recent advances in quantum computing, real-world applications have thus far been mostly confined to problems such as graph partitioning, traffic routing and task scheduling, where parameter space is discrete and graph connectivity is sparse. Here we propose the quantum nonlinear programming (QNLP) framework for casting an NLP problem - in continuous space - as quadratic unconstrained binary optimisation (QUBO), which can be subsequently solved using special-purpose solvers such as quantum annealers (QA) and coherent Ising machines (CIMs). QNLP consists of four steps: quadratic approximation of cost function, discretisation of parameter space, binarisation of discrete space, and solving the resulting QUBO. Linear and nonlinear constraints are incorporated into the resulting QUBO using slack variables and quadratic penalty terms. We apply our QNLP framework to optimisation of the daily feed rate of various biomass types at Nature Energy, the largest biogas producer in Europe. Optimising biomass selection improves the profitability of biomethane production, thus contributing to sustainable carbon-neutral energy production. For solving the QUBO, we use D-Wave's quantum annealers. We observe good performance on the DW-2000Q QPU, and higher sensitivity of performance to number of samples and annealing time for the Advantage QPU. We hope that our proposed QNLP framework provides a meaningful step towards overcoming the computational challenges posed by high-dimensional continuous-optimisation problems, especially those encountered in our battle against man-made climate change.
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.
The industrial sector is a major contributor to total energy-related CO2 emissions in Europe, making the transition of existing industrial systems toward renewable energy solutions a key priority. Decarbonization strategies focus on integrating novel energy transition concepts into existing production sites. These concepts encompass various renewable energy sources along with conversion technologies. Additionally, energy storage systems enhance flexibility and security of energy supply when incorporated into such concepts. The key challenge is to select the optimal combination of these energy components with optimal capacity and operation to meet the energy demand while minimizing both CO2 emissions and costs. This entire synthesis optimization problem is typically formulated as a mixed-integer non-linear programming problem with discrete and continuous variables that is computationally intensive to solve. A promising approach to tackle this complexity is to leverage quantum computing to optimize the selection and configuration of energy components as part of the synthesis problem, which consists primarily of binary decision variables. The decisions of the remaining continuous design and operation variables can be solved as a non-linear programming problem on classical computers. This hybrid approach is presented here and the formulation for solving binary decisions problems is discussed in detail. The results of the binary optimization problems are compared between quantum annealing (QA) and classical solvers such as Gurobi and simulated annealing. QA shows faster computation compared to the classical solvers, but the optimality gap of QA increases with increasing problem size. However, QA systems will become more fault-tolerant and powerful and can be used effectively in the future to optimize a vast range of binary decisions problems. By appropriately integrating quantum computing into the decision-making process, industrial stakeholders can explore a broader range of decarbonization scenarios faster, enabling more effective and cost-efficient energy transition strategies.
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.
This paper investigates the use of Quantum Annealing (QA) devices for optimizing unit scheduling in renewable energy systems, addressing the challenge of energy balancing with intermittent generation. We compare two approaches for encoding inequality constraints in Quadratic Unconstrained Binary Optimization (QUBO) formulations: (a) the conventional slack-variable-based method and (b) a novel soft-encoding technique called unbalanced penalization. This first application of unbalanced penalization in the energy and power systems domain, aims to disseminate knowledge about near-term applications of quantum-computing and how to make best use of it within the community. Through computational experiments, we find thatUnbalanced Penalizationconsistently outperforms the conventional method of using slack variables by reducing the number of variables in the QUBO formulation. Despite this, its inherent nature penalizes feasible solutions unevenly, preventing the ability to handle much larger problem sizes. More broadly, we observe that both methods-like most pure quantum approaches-struggle with scalability on current QA hardware, as solution quality declines with increasing problem size. In light of these limitations, we assess the feasibility of purely quantum solutions and argue that hybrid approaches remain the most practical path forward.
Quantum annealers can solve QUBO problems efficiently but struggle with continuous optimization tasks like regression due to their discrete nature. We introduce Quadratic Continuous Quantum Optimization (QCQO), an anytime algorithm that approximates solutions to unconstrained quadratic programs via a sequence of QUBO instances. Rather than encoding real variables as binary vectors, QCQO implicitly represents them using continuous QUBO weights and iteratively refines the solution by summing sampled vectors. This allows flexible control over the number of binary variables and adapts well to hardware constraints. We prove convergence properties, introduce a step size adaptation scheme, and validate the method on linear regression. Experiments with simulated and real quantum annealers show that QCQO achieves accurate results with fewer qubits, though convergence slows on noisy hardware. Our approach enables quantum annealing to address a wider class of continuous problems.