ﻻ يوجد ملخص باللغة العربية
We consider the Szegedy walk on graphs adding infinite length tails to a finite internal graph. We assume that on these tails, the dynamics is given by the free quantum walk. We set the $ell^infty$-category initial state so that the internal graph receives time independent input from the tails, say $boldsymbol{alpha}_{in}$, at every time step. We show that the response of the Szegedy walk to the input, which is the output, say $boldsymbol{beta}_{out}$, from the internal graph to the tails in the long time limit, is drastically changed depending on the reversibility of the underlying random walk. If the underlying random walk is reversible, we have $boldsymbol{beta}_{out}=mathrm{Sz}(boldsymbol{m}_{delta E})boldsymbol{alpha}_{in}$, where the unitary matrix $mathrm{Sz}(boldsymbol{m}_{delta E})$ is the reflection matrix to the unit vector $boldsymbol{m}_{delta E}$ which is determined by the boundary of the internal graph $delta E$. Then the global dynamics so that the internal graph is regarded as one vertex recovers the local dynamics of the Szegedy walk in the long time limit. Moreover if the underlying random walk of the Szegedy walk is reversible, then we obtain that the stationary state is expressed by a linear combination of the reversible measure and the electric current on the electric circuit determined by the internal graph and the random walks reversible measure. On the other hand, if the underlying random walk is not reversible, then the unitary matrix is just a phase flip; that is, $boldsymbol{beta}_{out}=-boldsymbol{alpha}_{in}$, and the stationary state is similar to the current flow but satisfies a different type of the Kirchhoff laws.
Topological phases exhibit a plethora of striking phenomena including disorder-robust localization and propagation of waves of various nature. Of special interest are the transitions between the different topological phases which are typically contro
We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $ell^infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a stationary st
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to
The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years, the growing
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as $widetilde{O}(m^{1/3