A comfortable graph structure for Grover walk
From MaRDI portal
Publication:6159716
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)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 2222671 (Why is no real title available?)
- A dynamical system induced by quantum walk
- An introduction to the theory of graph spectra
- Discrete-time quantum walks and graph structures
- Electric circuit induced by quantum walk
- Modifying quantum walks: a scattering theory approach
- Physical implementation of quantum walks
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum Walks
- Quantum walks and search algorithms
- Quantum walks induced by Dirichlet random walks on infinite trees
- Signless Laplacians of finite graphs
- Spectral and asymptotic properties of Grover walks on crystal lattices
Cited in
(6)- A convergence time of Grover walk on regular graph to stationary state with constant inflow to every vertex
- Survival probability of the Grover walk on the ladder graph
- How does Grover walk recognize the shape of crystal lattice?
- Circuit equation of Grover walk
- Comfortable place for quantum Walker on finite path
- scientific article; zbMATH DE number 6939345 (Why is no real title available?)
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)