Optimizing Quantum Walk Search on a Reduced Uniform Complete Multi-Partite Graph
arXiv:1706.05403
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.
References in corpus (11)
- Quantum Computation and Decision Trees
- Universal computation by quantum walk
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Two-particle quantum walks applied to the graph isomorphism problem
- Quantum Navigation and Ranking in Complex Networks
- Quantum walk-based search and centrality
- Black-box Hamiltonian simulation and unitary implementation
- A quantum-walk-inspired adiabatic algorithm for graph isomorphism
- Quantum walk on a chimera graph