A comfortable graph structure for Grover walk

DOI10.1088/1751-8121/ACD735zbMATH Open1525.81022arXiv2201.01926OpenAlexW4377088410MaRDI QIDQ6159716FDOQ6159716

Authors: Yusuke Higuchi, Mohamed Sabri, Etsuo Segawa 

Publication date: 20 June 2023

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths and receives the alternative inflows along these paths at each time step. After the long time scale, we know that the behavior of such a Grover walk should be stable, that is, this model has a stationary state. In this paper our objectives are to give some characterization upon the scattering of the stationary state on the surface of the internal graph and upon the energy of this state in the interior. For the scattering, we concretely give a scattering matrix, whose form is changed depending on whether the internal graph is bipartite or not. On the other hand, we introduce a comfortability function of a graph for the quantum walk, which shows how many quantum walkers can stay in the interior, and we succeed in showing the comfortability of the walker in terms of combinatorial properties of the internal graph.

Full work available at URL: https://arxiv.org/abs/2201.01926

zbMATH Keywords

quantum walkcomfortability(pseudo-)Kirchhoff's laws(signless-)Laplacian

Mathematics Subject Classification ID

Technical applications of optics and electromagnetic theory (78A55) Random walks on graphs (05C81) Semilinear elliptic equations with Laplacian, bi-Laplacian or poly-Laplacian (35J91) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) (S)-matrix theory, etc. in quantum theory (81U20)

Cites Work

• Signless Laplacians of finite graphs
• An introduction to the theory of graph spectra
• Physical implementation of quantum walks
• Discrete-time quantum walks and graph structures
• Title not available (Why is that?)
• Spectral and asymptotic properties of Grover walks on crystal lattices
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Walks
• Modifying quantum walks: a scattering theory approach
• Title not available (Why is that?)
• Quantum walks induced by Dirichlet random walks on infinite trees
• Quantum walks and search algorithms
• A dynamical system induced by quantum walk
• Electric circuit induced by quantum walk

Cited In (5)

• Comfortable place for quantum Walker on finite path
• How does Grover walk recognize the shape of crystal lattice?
• Circuit equation of Grover walk
• Title not available (Why is that?)
• A convergence time of Grover walk on regular graph to stationary state with constant inflow to every vertex

This page was built for publication: A comfortable graph structure for Grover walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159716)