Quantum switching and quantum walks

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

doi:10.1109/NANO.2013.6720819

Quantum switching and quantum walks

Ting Hsu Chang
, Tein Sheng Lin
, Chia Hung Chien
, Chin Yung Lu
, Sy Yen Kuo^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013
Pages	456-459
Number of pages	4
DOIs	https://doi.org/10.1109/NANO.2013.6720819
State	Published - 2013
Externally published	Yes
Event	2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013 - Beijing, China Duration: 05 08 2013 → 08 08 2013

Publication series

Name	Proceedings of the IEEE Conference on Nanotechnology
ISSN (Print)	1944-9399
ISSN (Electronic)	1944-9380

Conference

Conference	2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013
Country/Territory	China
City	Beijing
Period	05/08/13 → 08/08/13

Access to Document

10.1109/NANO.2013.6720819

Cite this

@inproceedings{345750c5959841d2aea316510880b63d,

title = "Quantum switching and quantum walks",

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.",

author = "Chang, \{Ting Hsu\} and Lin, \{Tein Sheng\} and Chien, \{Chia Hung\} and Lu, \{Chin Yung\} and Kuo, \{Sy Yen\}",

year = "2013",

doi = "10.1109/NANO.2013.6720819",

language = "英语",

isbn = "9781479906758",

series = "Proceedings of the IEEE Conference on Nanotechnology",

pages = "456--459",

booktitle = "2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013",

note = "2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013 ; Conference date: 05-08-2013 Through 08-08-2013",

}

Chang, TH, Lin, TS, Chien, CH, Lu, CY & Kuo, SY 2013, Quantum switching and quantum walks. in 2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013., 6720819, Proceedings of the IEEE Conference on Nanotechnology, pp. 456-459, 2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013, Beijing, China, 05/08/13. https://doi.org/10.1109/NANO.2013.6720819

TY - GEN

T1 - Quantum switching and quantum walks

AU - Chang, Ting Hsu

AU - Lin, Tein Sheng

AU - Chien, Chia Hung

AU - Lu, Chin Yung

AU - Kuo, Sy Yen

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84894125300

U2 - 10.1109/NANO.2013.6720819

DO - 10.1109/NANO.2013.6720819

M3 - 会议稿件

AN - SCOPUS:84894125300

SN - 9781479906758

T3 - Proceedings of the IEEE Conference on Nanotechnology

SP - 456

EP - 459

BT - 2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013

T2 - 2013 13th IEEE International Conference on Nanotechnology, IEEE-NANO 2013

Y2 - 5 August 2013 through 8 August 2013

ER -

Quantum switching and quantum walks

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this