Related papers: Pseudo Memory Effects, Majorization and Entropy in…
Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computation models, while annealing plays within a specific subset of…
One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum…
Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…
We introduce the concept of a quantum walk with two particles and study it for the case of a discrete time walk on a line. A quantum walk with more than one particle may contain entanglement, thus offering a resource unavailable in the…
We investigated the discrete-time quantum random walks on a line in periodic potential. The probability distribution with periodic potential is more complex compared to the normal quantum walks, and the standard deviation $\sigma$ has…
The mean squared displacement has been widely used as the primary metric for comparing quantum and classical random walks, with quantum walks showing quadratic scaling versus linear scaling for classical walks. However, this comparison may…
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…
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…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
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…
In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…
We investigate quantum superposition effects in two-dimensional quantum walks of identical particles with different statistics under particle exchange, starting from various different initial configurations. To characterize interparticle…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
In this study, we investigate the emergence of the quantum boomerang effect in discrete-time quantum walks (DTQWs) subjected to random phase disorder. Our analysis shows that this effect can arise solely from the intrinsic momentum dynamics…
A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with…
The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann…