Quantum State Diffusion on a Graph

TL;DR

This paper explores quantum state diffusion on arbitrary graphs using a multi-walker quantum cellular automaton model, highlighting entanglement and diffusion without relying on specific graph structures.

Contribution

It introduces a novel framework modeling multi-walker quantum diffusion as a quantum cellular automaton with non-colliding walkers and non-deterministic updates.

Findings

Strong entanglement between vertex states

Diffusion achieved without specific graph structure

Potential for local actions in quantum computation

Abstract

Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all nodes where the walker is not positioned are quiescent. This paper will examine some mathematical structures that underlie state diffusion on arbitrary graphs, that is the circulation of states within a graph. We will seek to frame the multi-walker problem as a finite quantum cellular automaton. Every vertex holds a walker at all times. The walkers will never collide and at each time step their positions update non-deterministically by a quantum swap of walkers at opposite ends of a randomly chosen edge. The update is accomplished by a unitary transformation of the position of a walker to a superposition of all such possible swaps and then performing a quantum measurement on the superposition of possible swaps. This behavior generates strong entanglement between vertex states which provides a path toward developing local actions producing diffusion throughout the graph without depending on the specific structure of the graph through blind computation.