Comfortable place for quantum walkers on finite path
Yoshihiro Anahara, Norio Konno, Hisashi Morioka, Etsuo Segawa

TL;DR
This paper studies the stationary state of a quantum walk on a finite path with sinks and sources at the boundaries, analyzing the distribution of comfortability across vertices and its scaled limit as the path length increases.
Contribution
It introduces a new measure called comfortability for quantum walkers and proves a weak convergence theorem for its scaled distribution on finite paths.
Findings
Distribution of comfortability converges in the scaled limit.
Stationary state characterized by quantum walk dynamics.
Provides mathematical framework for quantum walk comfortability.
Abstract
We consider the stationary state of a quantum walk on the finite path, where the sink and source are set at the left and right boundaries. The quantum coin is uniformly placed at every vertex of the path graph. At every time step, a new quantum walker penetrates into the internal from the left boundary and also some existing quantum walkers in the internal goes out to the sinks located in the left and right boundaries. The square modulus of the stationary state at each vertex is regarded as the comfortability for a quantum walker to this vertex in this paper. We show the weak convergence theorem for the scaled limit distribution of the comfortability in the limit of the length of the path.
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 · Optimization and Search Problems · Complexity and Algorithms in Graphs
