Use cases · Energy · networks
Commit to a grid-expansion plan you can prove is the best
A network-expansion plan proven optimal over every one of more than a million alternatives, plus a direct read of the network’s real-time response.
Impact
A plan proven to be the best available
Baseline: a heuristic plan with no proof of optimality
Condition: optimal over all 1,048,576 build combinations of one expansion case
A direct real-time response read
Baseline: inversion from imaginary-time data, which is ill-posed
Condition: read directly on quantum hardware for the same network
The problem
Reinforcement plans are usually chosen by heuristics that return a good plan but cannot show it is the best one. That leaves the planner unable to defend the choice line by line.
Our approach
For a network-expansion case with twenty candidate builds we searched the whole space of plans and showed the chosen plan is the global optimum. Separately, we read the network’s real-time response directly on quantum hardware, which inversion from classical data does not deliver.
The evidence
- Exhaustive search over 2^20 build plans; one basin, one global optimum (classical computation).
- Real-frequency response read directly on quantum hardware.
- Not claimed: any speed advantage for quantum in finding the plan.
Status: Simulation + Quantum hardware. Optimality proven by classical computation; the response read is measured on quantum hardware.