相关论文: Quantum Walks on Sierpinski Gaskets
The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
We address memory effects and diffusive properties of a continuous-time quantum walk on a one-dimensional percolation lattice affected by spatially correlated random telegraph noise. In particular, by introducing spatially correlated…
The Stretched Sierpinski Gasket is a non-self-similar set but it still exhibits very high symmetry. In an earlier work we calculated the leading term for the eigenvalue counting function for operators coming from resistance forms that were…
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's diffusion transformation - has a wide class of exceptional…
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk…
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph with a weighted self-loop at each vertex. It uses a generalized Grover coin and the flip-flop shift, which makes it equivalent to Szegedy's quantum Markov…
It has been discovered that open quantum walks diffusively distribute in space, since they were introduced in 2012. Indeed, some limit distributions have been demonstrated and most of them are described by Gaussian distributions. We operate…
We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…
Single particle tracking of mRNA molecules and lipid granules in living cells shows that the time averaged mean squared displacement $\overline{\delta^2}$ of individual particles remains a random variable while indicating that the particle…
It is shown that the hopping of a single excitation on certain triangular spin lattices with non-uniform couplings and local magnetic fields can be described as the projections of quantum walks on graphs of the ordered Hamming scheme of…
We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
We analyze a set of discrete-time quantum walks for which the displacements on a chain follow binary aperiodic jumps according to three paradigmatic sequences: Fibonacci, Thue-Morse and Rudin-Shapiro. We use a generalized Hadamard coin…
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
We introduce the quantum Levy walk to study transport and decoherence in a quantum random model. We have derived from second order perturbation theory the quantum master equation for a \textit{Levy-like particle}that moves along a lattice…
This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…
I study the properties of the quantum critical point of the transverse-field quantum Ising model on various fractal lattices such as the Sierpi\'nski carpet, Sierpi\'nski gasket, and Sierpi\'nski tetrahedron. Using a continuous-time quantum…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…