Quantum Switching and Quantum Walks
Journal
2013 IEEE Conference on Nanotechnology (IEEE-NANO 2013)
Pages
456-459
Date Issued
2013-08
Author(s)
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. © 2013 IEEE.
Type
conference paper