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

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)

A Penalty-Based QUBO Formulation for Quantum Unit Commitment: Mitigating Slack Variable Constraints in QAOA

Aayush Sharma, Rashi Sinha, P. V. Manitha

Published Aug 1, 2026• 0 citations
Publisher
DOI
10.1109/aikiie69997.2026.11708004

Related papers

Penalty Weights in QUBO Formulations: Permutation Problems

Mayowa Ayodele

arXiv:2206.11040•Lecture notes in computer science•Jan 1, 2022•56 citations

Resource-efficient QUBO formulations for the Knapsack and Bin Packing problem

Pim van den Heuvel

Quantum computing approaches, such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA), have emerged as promising candidates for solving combinatorial optimization problems. Since these approaches typically work with Quadratic Unconstrained Binary Optimization (QUBO) problems, constraints, when present, are commonly encoded as penalty terms. Conventional approaches to incorporate inequality constraints into QUBO formulations additionally require the introduction of slack variables, increasing the required number of qubits. The Knapsack and Bin Packing problems are optimization problems with such inequality constraints. We show that the number of slack variables required to formulate the Knapsack problem as a QUBO problem can be reduced using certain properties specific to this problem. Moreover, we present two separate strategies for the Knapsack and Bin Packing problems that avoid using the costly slack variables altogether. Instead, both strategies solve several QUBO problems, with varying penalty constants, such that at least one of them is a good representation of the given optimization problem. Numerical simulations of QAOA, as well as experiments on a D-Wave quantum annealer, show that these slack-less approaches can improve performance compared to the conventional slack variable method (in terms of success probability), even when the latter is allowed to vary penalty constants too.

•Jan 1, 2025•0 citations

A QUBO Formulation for Quantum Computing

Frank Phillipson, Tariq Bontekoe, Irina Chiscop

•Jan 1, 2021•0 citations

A Quantum Computing Approach for the Unit Commitment Problem

Pascal Halffmann, Patrick Holzer, Kai Plociennik +1 more

arXiv:2212.06480•Lecture notes in operations research•Jan 1, 2023•13 citations

QUBO Formulations and Quantum Optimization for the Multi-Dimensional Knapsack Problem With Conflict, Forcing, and Precedence Constraints

Evren Güney, Joachim C.F. Ehrenthal

Constrained knapsack variants are well-suited for QUBO-based quantum optimization, but adding logical relations can inflate the binary model and complicate penalty selection. This work examines the multi-dimensional knapsack problems augmented with conflict, forcing, and precedence (CFP) constraints using Quadratic Unconstrained Binary Optimization (QUBO) models across classical and quantum platforms. The additional logical constraints are incorporated through quadratic penalty terms that modify existing QUBO coefficients without introducing additional binary variables beyond the slack variables used for the capacity constraints. Computational studies are conducted to assess how each of the three constraint types affects solution behavior, including solution quality, computation time, and sensitivity to penalty parameter magnitudes. The approach is demonstrated on representative small-scale instances using QAOA on IBM Quantum gate-based device and quantum annealing on a D-Wave Advantage processor, with results compared with Gurobi as classical solver. The experiments show that the proposed QUBO formulations achieve optimal or near-optimal solutions for small instances, while showing the sensitivity of current quantum hardware to penalty selection, and scaling. Overall, CFP penalties are variable-neutral relative to the slack-based capacity representation, while the capacity terms dominate logical-qubit count and coupling density. Future work may target more compact or hardware-aware capacity modeling.

IEEE Access•Jan 1, 2026•2 citations

Benchmarking Hybrid Quantum-Classical Algorithms for Power Grid Optimization Problems

Igor Gaidai, Rick Mukherjee

Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions with nonconvex continuous AC power-flow constraints. In this work, we investigate whether hybrid quantum-classical variational algorithms can improve the solution of single-period AC-OPF-UC relative to classical approaches. To the best of our knowledge, this is the first study to directly evaluate quantum or hybrid quantum-classical algorithms for the full AC-OPF-UC problem. We consider two candidate algorithms for improving AC-OPF-UC solution quality relative to purely classical methods on ideal quantum hardware. The first applies QAOA directly to a fully discretized formulation of the problem, with equality and inequality constraints incorporated through penalty terms and slack variables. Although conceptually straightforward, this approach requires a prohibitively large number of qubits even for small instances. The second, qubit-efficient approach encodes only the binary generator status variables on a quantum computer, while optimizing the continuous power-flow variables classically for each sampled bitstring. We benchmark this method on randomly generated AC-OPF-UC instances with 5 to 13 generators and compare it against SCIP, SMAC, and uniform random sampling. Our simulations show that the qubit-efficient hybrid method does not outperform uniform sampling. These results suggest that in order to establish potential advantage of the variational hybrid strategy considered here over the best classical algorithms, if any, much larger system sizes (25+ generators) need to be tested, which is beyond our computational capacity. Alternatively, different approaches, such as quantum versions of branch-and-bound methods, may be more promising.

quant-pharXiv:2607.15543•Jul 20, 2026•0 citations
Quantum computing approaches, such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA), have emerged as promising candidates for solving combinatorial optimization problems. Since these approaches typically work with Quadratic Unconstrained Binary Optimization (QUBO) problems, constraints, when present, are commonly encoded as penalty terms. Conventional approaches to incorporate inequality constraints into QUBO formulations additionally require the introduction of slack variables, increasing the required number of qubits. The Knapsack and Bin Packing problems are optimization problems with such inequality constraints. We show that the number of slack variables required to formulate the Knapsack problem as a QUBO problem can be reduced using certain properties specific to this problem. Moreover, we present two separate strategies for the Knapsack and Bin Packing problems that avoid using the costly slack variables altogether. Instead, both strategies solve several QUBO problems, with varying penalty constants, such that at least one of them is a good representation of the given optimization problem. Numerical simulations of QAOA, as well as experiments on a D-Wave quantum annealer, show that these slack-less approaches can improve performance compared to the conventional slack variable method (in terms of success probability), even when the latter is allowed to vary penalty constants too.
Constrained knapsack variants are well-suited for QUBO-based quantum optimization, but adding logical relations can inflate the binary model and complicate penalty selection. This work examines the multi-dimensional knapsack problems augmented with conflict, forcing, and precedence (CFP) constraints using Quadratic Unconstrained Binary Optimization (QUBO) models across classical and quantum platforms. The additional logical constraints are incorporated through quadratic penalty terms that modify existing QUBO coefficients without introducing additional binary variables beyond the slack variables used for the capacity constraints. Computational studies are conducted to assess how each of the three constraint types affects solution behavior, including solution quality, computation time, and sensitivity to penalty parameter magnitudes. The approach is demonstrated on representative small-scale instances using QAOA on IBM Quantum gate-based device and quantum annealing on a D-Wave Advantage processor, with results compared with Gurobi as classical solver. The experiments show that the proposed QUBO formulations achieve optimal or near-optimal solutions for small instances, while showing the sensitivity of current quantum hardware to penalty selection, and scaling. Overall, CFP penalties are variable-neutral relative to the slack-based capacity representation, while the capacity terms dominate logical-qubit count and coupling density. Future work may target more compact or hardware-aware capacity modeling.
Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions with nonconvex continuous AC power-flow constraints. In this work, we investigate whether hybrid quantum-classical variational algorithms can improve the solution of single-period AC-OPF-UC relative to classical approaches. To the best of our knowledge, this is the first study to directly evaluate quantum or hybrid quantum-classical algorithms for the full AC-OPF-UC problem. We consider two candidate algorithms for improving AC-OPF-UC solution quality relative to purely classical methods on ideal quantum hardware. The first applies QAOA directly to a fully discretized formulation of the problem, with equality and inequality constraints incorporated through penalty terms and slack variables. Although conceptually straightforward, this approach requires a prohibitively large number of qubits even for small instances. The second, qubit-efficient approach encodes only the binary generator status variables on a quantum computer, while optimizing the continuous power-flow variables classically for each sampled bitstring. We benchmark this method on randomly generated AC-OPF-UC instances with 5 to 13 generators and compare it against SCIP, SMAC, and uniform random sampling. Our simulations show that the qubit-efficient hybrid method does not outperform uniform sampling. These results suggest that in order to establish potential advantage of the variational hybrid strategy considered here over the best classical algorithms, if any, much larger system sizes (25+ generators) need to be tested, which is beyond our computational capacity. Alternatively, different approaches, such as quantum versions of branch-and-bound methods, may be more promising.