Hybrid benchmarking of quantum BFS inside Dinic's algorithm on classical max-flow instances shows that practical speedups would require physically impossible quantum gate speeds.
Min-cut/max-flow problem instances for benchmarking, 3 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Use case study: benchmarking quantum breadth-first search for maximum flow problems
Hybrid benchmarking of quantum BFS inside Dinic's algorithm on classical max-flow instances shows that practical speedups would require physically impossible quantum gate speeds.