Title :
Improving the network flow problem using quantum search
Author :
Yu, Chia-Mu ; Tsai, I-Ming ; Chou, Yao-Hsin ; Kuo, Sy-Yen
Author_Institution :
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei
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(n 2.5) time, which, to the best of our knowledge, is faster than all other classical and quantum algorithms.
Keywords :
computational complexity; quantum computing; O(n2.5) time; maximum flow problem; network flow problem; quantum algorithm; quantum search; Airplanes; Books; Computational modeling; Databases; Graph theory; Iterative algorithms; Nanotechnology; Quantum computing; Tensile stress; Transportation;
Conference_Titel :
Nanotechnology, 2007. IEEE-NANO 2007. 7th IEEE Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-0607-4
Electronic_ISBN :
978-1-4244-0608-1
DOI :
10.1109/NANO.2007.4601381
