Nonlinear Theory and Its Applications, IEICE
Online ISSN : 2185-4106
Special Section on Communication Sciences and Multimedia Information Systems
Partition of graphs and quantum walk based search algorithms
Yusuke Ide
Author information
JOURNALS FREE ACCESS

2019 Volume 10 Issue 1 Pages 16-27

Details
Abstract

In this paper, we show reduction methods for search algorithms on graphs using quantum walks. By using a graph partitioning method called equitable partition for the the given graph, we determine “effective subspace” for the search algorithm to reduce the size of the problem. We introduce the equitable partition for quantum walk based search algorithms and show how to determine “effective subspace” and reduced operator.

Information related to the author
© 2019 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top