How Accenture & Elia Group Tackle the Redispatch Challenge
summary
Proof of concept maps the redispatch/congestion problem into a mixed-integer linear program (baseline solved with Gurobi) and into quantum/quantum‑inspired formulations run on annealers (D‑Wave) and small gate‑based devices. Results show constraint satisfaction collapses as instance size grows—only tiny cases (one–two plants, ~3 timesteps) solve reliably—so quantum backends do not yet beat classical solvers, but the exercise yields a 60–70% runtime reduction on the classical workflow and drives a roadmap and dedicated team for next‑gen computing.
AI-written summary · about
chapters (13)
- 0:00Redispatch challenge introduction
- 1:25Quantum computing in energy
- 3:31Role of transmission operator
- 6:03Grid optimization explained
- 8:51Classical solutions limitations
- 10:40Quantum computing potential
- 13:53Quantum as strategic investment
- 14:15Proof of concept setup
- 17:04Testing quantum vs classical
- 18:50Real-world results and challenges
- 20:13Quantum insights for classical systems
- 20:55Quantum innovation team
- 21:58Q&A
related talks
21mSoftware for Quantum Computing- Easing Solutions for Complex
41mQuantum Computing in Practice: Where We Are, What Works, and What’s Next
47mUnboxing Quantum Computing
16mTowards Quantum Advantage in the Energy Sector
38mFacing the Future: A Discussion and Reality Check on Quantum Computing Applications
41mGreen Qubits: Quantum Innovation for Sustainability
19mAn Industry Perspective on the Path Forward in Quantum Optimization
27mA Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware