Demonstrating quantum scaling advantage in approximate optimization for energy coalition formation with 100+ agents

Journal article

The formation of energy communities is pivotal for advancing decentralized and sustainable energy management. Within this context, Coalition Structure Generation (CSG) emerges as a promising framework. The complexity of CSG grows rapidly with the number of agents, making classical solvers impractical for even moderate sizes. This suggests CSG as an ideal candidate for benchmarking quantum algorithms against classical ones. Facing ongoing challenges in attaining computational quantum advantage for exact optimization, we pivot our focus to benchmarking quantum and classical solvers for approximate optimization. Approximate optimization is particularly critical for industrial use cases requiring real-time optimization, where finding high-quality solutions quickly is often more valuable than achieving exact solutions more slowly. Our findings indicate that quantum annealing (QA) on DWave can achieve solutions of comparable quality to our best classical solver, but with more favorable runtime scaling, showcasing an advantage. This advantage is observed when compared to solvers, such as Tabu search, simulated annealing, and the state-of-the-art solver Gurobi in finding approximate solutions for energy community formation involving over 100 agents. DWave also surpasses 1-round QAOA on IBM hardware. Our findings represent the largest benchmark of quantum approximate optimizations for a real-world dense model beyond the hardware's native topology, where D-Wave demonstrates a scaling advantage.

Authors: Mohseni, N; Morstyn, T; O'Meara, C; Bucher, D; Nüßlein, J

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: IOP Publishing
• Journal: Quantum Science and Technology
• Volume: 11
• Issue: 1
• Article number: 15009
• Publication date: 2025-11-24
• Acceptance date: 2025-11-06
• DOI: 10.1088/2058-9565/ae1c68
• EISSN: 2058-9565
• ISSN: 2058-9565
• Language: English