Quick Navigation
Topics
Trapped Ion Quantum Computing
Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding
arXiv
Authors: Kien X. Nguyen, Ilya Safro, Xiaoyuan Liu
Year
2026
Paper ID
63854
Status
Preprint
Abstract Read
~2 min
Abstract Words
195
Citations
N/A
Abstract
Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitment problem with time-dependent constraints, where decisions must be made about which generators to turn on/off and how much power they should produce over a planning horizon. We use a hybrid quantum-classical optimization procedure to determine the on/off schedules of the generating units and the corresponding power dispatch that satisfies operational constraints such as load balance, generator limits, ramping, and reserve requirements. We frame the optimization loop as a leader-follower structure, where the quantum optimizer leads to give the on/off decisions, and the classical optimizer follows to produce the power level schedule. Leveraging Pauli-Correlation Encoding, our method scales to horizon-wide unit commitment schedules by encoding the binary variables with far fewer qubits. By combining these components, the method can handle multi-period settings while using far fewer qubits than straightforward quantum encodings that allocate one qubit per decision variable as in prior approaches. We evaluate the approach on both small- and large-scale instances, up to 312 binary variables, and show that it reliably produces feasible schedules with competitive operating costs.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Unit commitment is an important optimization problem in power system operations, classified as NP-hard.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.