A Backend-Agnostic MWIS Kernel for Stochastic Unit Commitment with Neutral-Atom Hardware Validation
quant-ph, cs.ET, math.OC
Submitted: 2026-09-01
Updated: 2026-10-12
Comments: v2: added data availability statement; Supplementary Information now included as ancillary file (SI.pdf)
License: http://creativecommons.org/licenses/by/4.0/
The gist: Quantum hardware is beginning to address structured combinatorial optimisation, but two steps still block practical use: mapping real operational models onto hardware-compatible instances, and
Abstract
Quantum hardware is beginning to address structured combinatorial optimisation, but two steps still block practical use: mapping real operational models onto hardware-compatible instances, and converting noisy hardware output back into feasible decisions. Here we introduce a backend-agnostic computational interface that compiles the discrete decision layer of stochastic unit commitment into a move-based maximum-weight independent set (MWIS) problem, while retaining continuous dispatch and feasibility recovery in the classical computational layer. We validate the approach in a green hydrogen scheduling setting and deploy it on the QuEra Aquila neutral-atom quantum processor. This is the first end-to-end industrial scheduling workflow that connects real operational decisions to programmable neutral-atom hardware through a solver-agnostic MWIS representation. Across a 15-day hardware campaign on 50-node instances, hardware-generated solutions after classical refinement match or exceed the dispatch margins obtained from exact MWIS on every day. When scaling to 144 nodes, encoding quality remains stable, while the probability that the full atom array survives, rather than graph embedding, emerges as the dominant bottleneck to further scaling. Together, these results establish a hardware-compatible computational pathway toward larger problem scales, and lay the groundwork for exploring regimes in which exact classical optimisation may no longer scale efficiently.
Sources
- Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays
- Approximating maximum independent set on Rydberg atom arrays using local detunings
- Aquila: QuEra's 256-qubit neutral-atom quantum computer
- Encoding computationally hard problems in triangular Rydberg atom arrays
- Diagnosing Device Performance in Rydberg-Ladder Gauge Simulators with Cumulative Probabilities and Filtered Mutual Information
- Shots-to-Approximate-Solution Scaling in Neutral-Atom Quantum Optimization
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources