Related papers: Sojourn times of the Hadamard walk in one dimensio…
This dissertation presents investigations on dynamics of discrete-time quantum walk and some of its applications. Quantum walks has been exploited as an useful tool for quantum algorithms in quantum computing. Beyond quantum computational…
We consider the problem of the distribution of the sojourn time in a compact set $\mathbb{Z}_{p}$ in the case of a $p$-adic random walk. We rely on the results of our previous studies of the distribution of the first return time for a…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is…
We propose a class of continuous-time quantum walk models on graphs induced by a certain class of discrete-time quantum walk models with the parameter $\epsilon\in [0,1]$. Here the graph treated in this paper can be applied both finite and…
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…
The characterization of the Hamiltonian parameters defining a quantum walk is of paramount importance when performing a variety of tasks, from quantum communication to computation. When dealing with physical implementations of quantum…
The dimensionality of the internal coin space of discrete-time quantum walks has a strong impact on the complexity and richness of the dynamics of quantum walkers. While two-dimensional coin operators are sufficient to define a certain…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
In this article, we propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths. Quantum walks are known for their ability to integrate quantum…
The discrete-time quantum walk (QW) is a quantum version of the random walk (RW) and has been widely investigated for the last two decades. Some remarkable properties of QW are well known. For example, QW has a ballistic spreading, i.e., QW…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
We give a method for computing the iterated Laplace transform of the sojourn time in an union of intervals for linear diffusion processes. This random variable comes from a model occurring in biology concerning the clustering of membrane…
We derive the continuous-time limit of discrete quantum walks with topological phases. We show the existence of a continuous-time limit that preserves their topological phases. We consider both simple-step and split-step walks, and derive…
This paper treats absorption problems for the one-dimensional quantum walk determined by a 2 times 2 unitary matrix U on a state space {0,1,...,N} where N is finite or infinite by using a new path integral approach based on an orthonormal…
Quantum random walks use interference to obtain faster state space exploration, which can be used for algorithmic purposes. Photonic technologies provide a natural platform for many recent experimental demonstrations. Here we analyze…
In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions…
We present a semi-Markov model of random walk on complex networks in discrete and continuous-time scenario. In the general setting of the semi-Markov chains, the duration of stay at given node - the sojourn time - is random, and the…
Propagation in quantum walks is revisited by showing that very general 1D discrete-time quantum walks with time- and space-dependent coefficients can be described, at the continuous limit, by Dirac fermions coupled to electromagnetic…
In this article we present an effective Hamiltonian approach for Discrete Time Quantum Random Walk. A form of the Hamiltonian for one dimensional quantum walk has been prescribed, utilizing the fact that Hamiltonians are the generators of…