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.
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 annealing (QA) offers a physics-inspired approach for such subproblems by mapping them onto an Ising Hamiltonian, which is algebraically equivalent to a Quadratic Unconstrained Binary Optimization (QUBO) model executable on quantum annealers or hybrid solvers. However, their practical employment in wireless systems critically depends on the specific problem formulation, on the particular variable encoding, constraint handling, solver selection, hardware embedding, and fair benchmarking. This paper develops wireless-oriented QUBO modeling guidelines for QA-assisted resource allocation. We first present a beginner-friendly toy example in which a terrestrial-aerial resource-allocation problem with a fractional signal-to-interference-plus-noise ratio (SINR) maximization objective is reformulated into a two-bit QUBO via Boolean interpolation, converted into an Ising representation, and decoded back into a wireless scheduling decision. The same scheduling is applicable to UAV, aircraft, satellite, and terrestrial links in SAGIN systems. We then review the QA foundations and solver ecosystems, including binary quadratic, discrete quadratic, constrained quadratic, and hybrid models from the perspective of NG wireless optimization. Furthermore, we discuss both binary and discrete encoding, penalty-based constraint conversion, embedding overhead, solution decoding, and feasibility verification. A QUBO Compatibility Index is introduced as a lightweight diagnostic metric for assessing the associated QUBO formulation readiness, rather than a predictor of runtime or solution quality. Finally, a case study on max-min uplink power control in cell-free massive MIMO illustrates how a fairness-oriented wireless problem can be discretized, constrained, converted into the concept of a QUBO, and evaluated against classical baselines. A host of key challenges and future directions are also discussed.
Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary Optimization (QUBO) problems, presents a potential solution. However, existing quantum algorithms rely on slack variables to handle linear binary inequality constraints, leading to increased qubit consumption and reduced computational efficiency. To solve the problem, this paper introduces the Powell-Hestenes-Rockafellar Augmented Lagrangian Multiplier (PHR-ALM) method to eliminate the need for slack variables, making qubit consumption independent of the increasing number of Benders cuts. To further reduce the qubit overhead, quantum ADMM is applied to break large-scale SUC into smaller blocks for sequential solutions, which does not scale with the number of generators. Finally, the simulation results on both 4-generator and the IEEE bus-118 systems demonstrate the feasibility and scalability of the proposed algorithm, indicating its superior qubit and runtime efficiency over classical and baseline quantum approaches on the D-Wave QPU platform.
This paper investigates several Quadratic Unconstrained Binary optimisation (QUBO) formulations for the parallel machine scheduling problem P m | | C max with the goal of assessing their suitability for quantum annealing and related heuristic optimisation methods. Three QUBO models are constructed, ranging from formulations derived from classical integer and one-hot encodings to a more compact load-balancing based representation. Extensive computational experiments using Simulated Annealing (SA) and Quantum Annealing (QA) reveal substantial differences in scalability and solution quality among the formulations. The alternative load-balanced model consistently yields near-optimal makespans, typically within 1%–3% of the theoretical lower bound, highlighting its stability and effectiveness compared to the more penalty sensitive formulations, whose performance deteriorates for larger instances. Sensitivity analyses further reveal that the appropriate selection of penalty weights and problem-specific parameter tuning significantly influences both solution accuracy and computational effort in QUBO formulations. While current quantum hardware limitations restrict experimentation to small problem sizes, the findings illustrate how compact QUBO designs can better exploit quantum optimisation frameworks. The insights gained in this study provide practical modelling guidelines for future quantum scheduling research and lay the groundwork for extending QUBO-based approaches to more complex scheduling environments. • Three QUBO formulations are compared for identical parallel machine scheduling. • A compact load-balancing QUBO avoids auxiliary variables. • Load balancing yields makespans on average within 1–3%. • Both simulated and quantum annealing produce near-optimal schedules. • Penalty selection and encoding strongly affect scalability and solution quality.
Modern unit commitment (UC) scenarios, particularly those involving uncertainties from demand fluctuations and renewable energy sources, pose significant challenges to traditional optimization methods due to the large search spaces they encompass. This paper proposes a quantum computing-ready optimization pipeline for deterministic and stochastic UC, integrating classical, quantum-inspired, quantum annealing, and hybrid quantum-classical solvers across test systems, including the IEEE 118-bus system. A novel Quadratic Unconstrained Binary Optimization (QUBO) reformulation accommodates generator scaling and 24-hour scheduling horizons with compact Boolean logic penalties for startup, cooldown, and spinning reserve constraints. A divide-and-conquer strategy and Quantum Computing Monte Carlo (QCMC) simulation address scalability across 27,730 uncertainty scenarios, reducing compilation time by up to two orders of magnitude. Experimental results demonstrate the pipeline's ability to achieve efficient, scalable, and accurate UC optimization under uncertainty: the hybrid quantum method approach matches the classical baseline, reduces stochastic UC runtime from 40.76 to 14.79 hours, and characterizes pure quantum annealing as limited to small systems with 0.22% to 2.18% encoding errors and constraint violations. These results provide an analysis of the scalability and computational practicality of hybrid quantum optimization for generator scheduling in UC.
Abstract Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation. Some problems of this class suitable for practical applications such as the traveling salesman problem (TSP), the bin packing problem (BPP), or the knapsack problem (KP) have inequality constraints that require a particular cost function encoding. The common approach is the use of slack variables to represent the inequality constraints in the cost function. However, the use of slack variables considerably increases the number of qubits and operations required to solve these problems using quantum devices. In this work, we present an alternative method that does not require extra slack variables and consists of using an unbalanced penalization function to represent the inequality constraints in the QUBO. This function is characterized by larger penalization when the inequality constraint is not achieved than when it is. We evaluate our approach on the TSP, BPP, and KP, successfully encoding the optimal solution of the original optimization problem near the ground state cost Hamiltonian. Additionally, we employ D -Wave Advantage and D -Wave hybrid solvers to solve the BPP, surpassing the performance of the slack variables approach by achieving solutions for up to 29 items, whereas the slack variables approach only handles up to 11 items. This new approach can be used to solve combinatorial problems with inequality constraints with a reduced number of resources compared to the slack variables approach using quantum annealing or variational quantum algorithms.
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.