Impact of global and local interaction on quantum spatial search on chimera graph

TL;DR

This paper examines how local and global interactions affect the efficiency of quantum spatial search on chimera graphs, showing that more local interactions lead to optimal search performance.

Contribution

It provides numerical evidence that increasing local interactions improves quantum spatial search efficiency on chimera graphs.

Findings

Large number of local interactions yields optimal search.

Limited local interactions hinder search efficiency.

Poorly connected vertices are harder to find.

Abstract

In the paper, we investigated the influence of local and global interaction on the efficiency of continuous-time quantum spatial search. To do so, we analyzed numerically chimera graph, which is defined as 2D grid with each node replaced by complete bipartite graph. Our investigation provides a numerical evidence that with a large number of local interactions the quantum spatial search is optimal, contrary to the case with limited number of such interactions. The result suggests that relatively large number of local interactions with the marked vertex is necessary for optimal search, which in turn would imply that poorly connected vertices are hard to be found.