• DocumentCode
    3014667
  • Title

    Quantum switching and quantum walks

  • Author

    Ting-Hsu Chang ; Tein-Sheng Lin ; Chia-Hung Chien ; Chin-Yung Lu ; Sy-Yen Kuo

  • Author_Institution
    Dept. of the Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
  • fYear
    2013
  • fDate
    5-8 Aug. 2013
  • Firstpage
    456
  • Lastpage
    459
  • Abstract
    Quantum walks can be implemented in the hypercube and general graphs, where hypercube is a regular graph. According to quantum walk algorithm, unitary property of quantum walks can be preserved. In the regular graph, to develop quantum walks algorithm is focused on quantum search algorithm. Quantum switching is the reversible and parallel computation circuits, where parallel computation circuit can achieve the better performance in time complexity and space complexity. Especially, this switching can trace the behavior of quantum walks from input sequence to output sequence, looking as quantum search algorithm. Furthermore, application of unicasting and multicasting can be implemented in this circuit.
  • Keywords
    hypercube networks; quantum computing; hypercube; multicasting; parallel computation circuits; quantum search algorithm; quantum switching; quantum walks algorithm; space complexity; time complexity; unicasting; Hypercubes; Logic gates; Multicast communication; Quantum computing; Routing; Switches; Switching circuits;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Nanotechnology (IEEE-NANO), 2013 13th IEEE Conference on
  • Conference_Location
    Beijing
  • ISSN
    1944-9399
  • Print_ISBN
    978-1-4799-0675-8
  • Type

    conf

  • DOI
    10.1109/NANO.2013.6720819
  • Filename
    6720819