Prefer a chat interface with context about you and your work?
Quantum-walk-based state-transfer algorithms on the complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>M</mml:mi></mml:math> -partite graph
We investigate coined quantum-walk search and state-transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex, the search algorithm finds the marked vertex with unit probability in the limit of a large graph. Next, …