Related papers: Matrix valued Szego polynomials and quantum random…
Initially developed in the framework of quantum stochastic calculus, the main equations of quantum stochastic filtering were later on derived as the limits of Markov models of discrete measurements under appropriate scaling. In many…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
Quantum walks are recognizably useful for the development of new quantum algorithms, as well as for the investigation of several physical phenomena in quantum systems. Actual implementations of quantum walks face technological difficulties…
We discuss the model of a one-dimensional, discrete-time walk on a line with spatial heterogeneity in the form of a variable set of ultrametric barriers. Inspired by the homogeneous quantum walk on a line, we develop a formalism by which…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
We study a quantum walk (QW) whose time evolution is induced by a random walk (RW) first introduced by Szegedy (2004). We focus on a relation between recurrent properties of the RW and localization of the corresponding QW. We find the…
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
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…
Quantum walks (QWs) exhibit different properties compared with classical random walks (RWs), most notably by linear spreading and localization. In the meantime, random walks that replicate quantum walks, which we refer to as…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior…
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 paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
It is well-known that classical random walks on regular graphs converge to the uniform distribution. Quantum walks, in their various forms, are quantizations of their corresponding classical random walk processes. Gerhardt and Watrous…
We formulate continuous time quantum walks (CTQW) in a discrete quantum mechanical phase space. We define and calculate the Wigner function (WF) and its marginal distributions for CTQWs on circles of arbitrary length $N$. The WF of the CTQW…
The staggered quantum walk model allows to establish an unprecedented connection between discrete-time quantum walks and graph theory. We call attention to the fact that a large subclass of the coined model is included in Szegedy's model,…
Continuous time random walks have been developed as a straightforward generalisation of classical random walk processes. Some 10 years ago, Fogedby introduced a continuous representation of these processes by means of a set of Langevin…