Skip to Main Content
This paper proposes a quantum search based algorithm to improve the dynamic maximum network flow problem. First, we convert the time-dependent process into time-independent process. Second, we use the draining algorithm to find out the maximum flow and compare with classical algorithms. Third, the draining algorithm is speed up by utilizing quantum search. Finally, we also provide the analysis of time complexity.