-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.

DOI: 10.48550/arxiv.2210.08420

Related papers

A convergence time of Grover walk on regular graph to stationary state with constant inflow to every vertex

Ayaka Ishikawa, Sho Kubota, Etsuo Segawa

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 uniform insertion of the inflow to the graph. We show that larger degree of the regular graph makes the convergence time of this quantum walk model slower under this set-up.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 uniform insertion of the inflow to the graph. We show that larger degree of the regular graph makes the convergence time of this quantum walk model slower under this set-up.

Linear and Multilinear AlgebraOct 13, 20230 citations

A comfortable graph structure for Grover walk

Yusuke Higuchi, Mohamed Sabri, Etsuo Segawa

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.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.

arXiv:2201.01926Journal of Physics A Mathematical and TheoreticalMay 19, 20231 citation

A dynamical system induced by quantum walk

Yusuke Higuchi, Etsuo Segawa

Abstract We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an -infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary state exists, moreover a perfect transmission to the opposite tail always occurs in the long time limit. We also show that the lower bound of the norm of the stationary measure restricted to the internal graph is proportional to the number of edges of this graph. Furthermore when we add more tails (e.g. r -tails) to the internal graph, then we find that from the temporal and spatial global view point, the scattering to each tail in the long time limit coincides with the local one-step scattering manner of the Grover walk at a vertex whose degree is .Abstract We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an -infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary state exists, moreover a perfect transmission to the opposite tail always occurs in the long time limit. We also show that the lower bound of the norm of the stationary measure restricted to the internal graph is proportional to the number of edges of this graph. Furthermore when we add more tails (e.g. r -tails) to the internal graph, then we find that from the temporal and spatial global view point, the scattering to each tail in the long time limit coincides with the local one-step scattering manner of the Grover walk at a vertex whose degree is .

arXiv:1812.04730Journal of Physics A Mathematical and TheoreticalJul 30, 201926 citations

Comfortable place for quantum walkers on finite path

Yoshihiro Anahara, Norio Konno, Hisashi Morioka +1 more

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.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.

arXiv:2203.04108Mar 8, 20220 citations

Entanglement in coined quantum walks on regular graphs

Ivens Carneiro, Meng Loo, Xibai Xu +3 more

Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC , pp 59–68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC , pp 59–68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.

arXiv:quant-ph/0504042New Journal of PhysicsJul 12, 2005147 citations

Quantum walks on graphs

Dorit Aharonov, Andris Ambainis, Julia Kempe +1 more

We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspondent. On the other hand, we give a lower bound on the possible speed up by quantum walks for general graphs, showing that quantum walks can be at most polynomially faster than their classical counterparts.We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspondent. On the other hand, we give a lower bound on the possible speed up by quantum walks for general graphs, showing that quantum walks can be at most polynomially faster than their classical counterparts.

ACM Symposium on Theory of Computing (STOC)Jul 6, 2001638 citations

κ

-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.