Related papers: Framework for discrete-time quantum walks and a sy…
In this paper we unveil some features of a discrete-time quantum walk on the line whose coin depends on the temporal variable. After considering the most general form of the unitary coin operator, we focus on the role played by the two…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
We propose a novel implementation of discrete time quantum walks for a neutral atom in an array of optical microtraps or an optical lattice. We analyze a one-dimensional walk in position space, with the coin, the additional qubit degree of…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
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…
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…
Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent…
We investigate the dynamics of discrete-time quantum walk subject to time correlated noise. Noise is described as an unitary coin-type operator before each step, and attention is focused on the noise generated by a Gaussian Ornstein…
The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution Pt(n) at time t is very…
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel…
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 put forward a new, versatile and highly-scalable experimental setup for the realization of discrete two-dimensional quantum random walks with a single-qubit coin and tunable degree of decoherence. The proposed scheme makes use of a small…
Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. For the discrete-time case, we introduce an alternative PageRank measure…
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to…
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we…
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
Incorporating higher-order interactions in information processing enables us to build more accurate models, gain deeper insights into complex systems, and address real-world challenges more effectively. However, existing methods, such as…