A convergence time of Grover walk on regular graph to stationary state
Ayaka Ishikawa, Sho Kubota, Etsuo Segawa

TL;DR
This paper analyzes the convergence speed of a quantum walk model on regular graphs with external interaction, showing that higher degree graphs slow down the convergence to the stationary state.
Contribution
It provides an estimate of the convergence time for a quantum walk with external interaction on regular graphs, highlighting the impact of graph degree.
Findings
Higher degree regular graphs slow convergence
Convergence time depends on graph degree
Quantum walk reaches stationary state asymptotically
Abstract
We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step. This dynamics of the quantum walk converges to a stationary state. In this paper, we estimate the speed of the convergence to the stationary state on the -regular graph with the uniformly inserting of the inflow to the graph. We show that larger degree of the regular graph makes the convergence speed of this quantum walk model slower.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Internet Traffic Analysis and Secure E-voting
