• DocumentCode
    2607613
  • 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
  • fYear
    2007
  • fDate
    2-5 Aug. 2007
  • Firstpage
    1126
  • Lastpage
    1129
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/NANO.2007.4601381
  • Filename
    4601381
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2607613