Optimizing Quantum Walk Search on a Reduced Uniform Complete Multi-Partite Graph
Quantum Physics
2018-02-22 v3
Abstract
In a recent work by Novo et al. (Sci. Rep. 5, 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). The method helps to reduce a graph into a simpler version that allows more transparent analyses of the quantum walk model. In this work, we adopt the aforementioned method to investigate the optimality of a quantum walk search of a marked element on a complete multi-partite graph. We formulate the eigenbasis that would facilitate the transport between the two lowest energy eigenstates and demonstrate how to set the appropriate coupling factor to preserve the optimality.
Keywords
Cite
@article{arxiv.1706.05403,
title = {Optimizing Quantum Walk Search on a Reduced Uniform Complete Multi-Partite Graph},
author = {Chen-Fu Chiang and Chang-Yu Hsieh},
journal= {arXiv preprint arXiv:1706.05403},
year = {2018}
}