Improving the network flow problem using quantum search

Chia Mu Yu*, I. Ming Tsai, Yao Hsin Chou, Sy Yen Kuo

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publication2007 7th IEEE International Conference on Nanotechnology - IEEE-NANO 2007, Proceedings
Pages1126-1129
Number of pages4
DOIs
StatePublished - 2007
Event2007 7th IEEE International Conference on Nanotechnology - IEEE-NANO 2007 - Hong Kong, China
Duration: 2 Aug 20075 Aug 2007

Publication series

Name2007 7th IEEE International Conference on Nanotechnology - IEEE-NANO 2007, Proceedings

Conference

Conference2007 7th IEEE International Conference on Nanotechnology - IEEE-NANO 2007
CountryChina
CityHong Kong
Period2/08/075/08/07

Fingerprint Dive into the research topics of 'Improving the network flow problem using quantum search'. Together they form a unique fingerprint.

Cite this