Multimarked Spatial Search by Continuous-Time Quantum Walk
share
The quantum-walk-based spatial search problem aims to find a marked vertex using a quantum walk on a graph with marked vertices. We describe a framework for determining the computational complexity of spatial search by continuous-time quantum walk on arbitrary graphs by providing a recipe for finding the optimal running time and the success probability of the algorithm. The quantum walk is driven by a Hamiltonian that is obtained from the adjacency matrix of the graph modified by the presence of the marked vertices. The success of our framework depends on the knowledge of the eigenvalues and eigenvectors of the adjacency matrix. The spectrum of the modified Hamiltonian is then obtained from the roots of the determinant of a real symmetric matrix, whose dimension depends on the number of marked vertices. We show all steps of the framework by solving the spatial searching problem on the Johnson graphs with fixed diameter and with two marked vertices. Our calculations show that the optimal running time is O(√(N)) with asymptotic probability 1+o(1), where N is the number of vertices.
READ FULL TEXT
