Abstract:We study numerically the behavior of continuous-time quantum walks over
networks which are topologically equivalent to square lattices. On short time
scales, when placing the initial excitation at a corner of the network, we
observe a fast, directed transport through the network to the opposite corner.
This transport is not ballistic in nature, but rather produced by quantum
mechanical interference. In the long time limit, certain walks show an
asymmetric limiting probability distribution; this feature depends… Show more
“…It is also an interesting problem to relate the present results to solutions of the continuoustime quantum-walk models on two-dimensional lattices [22].…”
Section: Discussionmentioning
confidence: 94%
“…One of the recent topics of quantum walks is systematic study of higher dimensional models [14,18,19,20,21,22]. Among them the Grover-walk model has been extensively studied, since it is related to Grover's search algorithm [23,24,25,26,27].…”
One-parameter family of discrete-time quantum-walk models on the square lattice, which includes the Grover-walk model as a special case, is analytically studied. Convergence in the long-time limit t → ∞ of all joint moments of two components of walker's pseudovelocity, X t /t and Y t /t, is proved and the probability density of limit distribution is derived. Dependence of the two-dimensional limit density function on the parameter of quantum coin and initial four-component qudit of quantum walker is determined. Symmetry of limit distribution on a plane and localization around the origin are completely controlled. Comparison with numerical results of direct computer-simulations is also shown.
“…It is also an interesting problem to relate the present results to solutions of the continuoustime quantum-walk models on two-dimensional lattices [22].…”
Section: Discussionmentioning
confidence: 94%
“…One of the recent topics of quantum walks is systematic study of higher dimensional models [14,18,19,20,21,22]. Among them the Grover-walk model has been extensively studied, since it is related to Grover's search algorithm [23,24,25,26,27].…”
One-parameter family of discrete-time quantum-walk models on the square lattice, which includes the Grover-walk model as a special case, is analytically studied. Convergence in the long-time limit t → ∞ of all joint moments of two components of walker's pseudovelocity, X t /t and Y t /t, is proved and the probability density of limit distribution is derived. Dependence of the two-dimensional limit density function on the parameter of quantum coin and initial four-component qudit of quantum walker is determined. Symmetry of limit distribution on a plane and localization around the origin are completely controlled. Comparison with numerical results of direct computer-simulations is also shown.
“…In the next section, we briefly review the classical and quantum transport on networks presented in Refs. [23,24]. In Section 3 we study the time evolution of the ensemble averaged return probability on ER networks with different parameters.…”
“…Otherwise stated, the Laplacian operator can work both as a classical transfer operator and as a tight-binding Hamiltonian of a quantum transport process [24,25].…”
Section: Continuous-time Quantum Walks On Graphsmentioning
Abstract. We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average displacement of the walker as a function of time. Indeed, a fast growth of the average displacement can be advantageously exploited to build up efficient search algorithms. By means of analytical and numerical investigations, we show that the finiteness and the inhomogeneity of the substrate jointly weaken the quantum walk performance. We further highlight the interplay between the quantum-walk dynamics and the underlying topology by studying the temporal evolution of the transfer probability distribution and the lower bound of long time averages.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.