Related papers: Directivity of quantum walk via its random walk re…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
Existence of the eigenvalues of the discrete-time quantum walks is deeply related to localization of the walks. We revealed the distributions of the eigenvalues given by the splitted generating function method (the SGF method) of the…
This study is motivated by the previous work [14]. We treat 3 types of the one-dimensional quantum walks (QWs), whose time evolutions are described by diagonal unitary matrix, and diagonal unitary matrices with one defect. In this paper, we…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
A particular example is produced to prove that quantum walks can be used to simulate full-fledged discrete gauge theories. A new family of $2D$ walks is introduced and its continuous limit is shown to coincide with the dynamics of a Dirac…
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.…
In this paper, we consider multi-dimensional birth and death chains and continuous time quantum walks (CTQW) related to them. For CTQW related to our forms of multi-dimensional birth and death chains, we obtain the time scaled independence…
A particular family of Discrete Time Quantum Walks (DTQWs) simulating fermion propagation in $2$D curved space-time is revisited. Usual continuous covariant derivatives and spin-connections are generalized into discrete covariant…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…
In the present paper, we construct QMCs associated with Open Quantum Random Walks such that the transition operator of the chain is defined by OQRW and the restriction of QMC to the commutative subalgebra coincides with the distribution…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity)…
We investigate one-dimensional (1D) discrete time quantum walks (QWs) with spatially or temporally random defects as a consequence of interactions with random environments. We focus on the QWs with chiral symmetry in a topological phase,…
Quantum walks are not only algorithmic tools for quantum computation but also not trivial models which describe various physical processes. The paper compares one-dimensional version of the free particle Dirac equation with discrete time…
We study a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this…
In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached $\tau$ self-loops. We derive an…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
We give the first example of faster transport with a quantum walk on an inherently directed graph, on the directed line with a variable number of self-loops at each vertex. These self-loops can be thought of as adding a number of small…
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…
We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead…