Improving the network flow problem using quantum search

Maximum flow problem has many applications in the engineering community. In this paper, we propose a quantum algorithm to solve the maximum flow problem in O(n2.5) time, which, to the best of our knowledge, is faster than all other classical and quantum algorithms.