Improving the Network Flow Problem using Quantum Search
Journal
2007 IEEE Conference on Nanotechnology (IEEE-NANO 2007)
Pages
1126-1129
Date Issued
2007-08
Author(s)
Abstract
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.
Type
conference paper