Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment
Wei Hong, Wangkun Xu, Fei Teng

TL;DR
This paper proposes a qubit-efficient quantum annealing approach for stochastic unit commitment problems, reducing qubit usage and improving scalability using novel optimization techniques and quantum ADMM, demonstrated on real power system data.
Contribution
It introduces a slack-variable-free quantum annealing method for SUC, enhancing qubit efficiency and scalability with quantum ADMM and the PHR-ALM technique.
Findings
Demonstrates feasibility of the proposed quantum approach on power system data.
Shows superior qubit and runtime efficiency over classical methods.
Validates scalability on IEEE 118-bus system.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
