40 citations · 53 across the 4 of their papers we have counts for
Showing 2022 · quant-phShow all
2 papers · 2 filters
quant-ph2022★ 40 cited
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
Rhonda Au-Yeung, Nicholas Chancellor, Pascal Halffmann
In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor's algorithm through experiments to the era of noisy intermedi…
quant-ph2022★ 12 cited
A Quantum Computing Approach for the Unit Commitment Problem
Pascal Halffmann, Patrick Holzer, Kai Plociennik +1
Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus,…