h i g h l i g h t s • Model of quantum walks with memory on a cyclic graph. • Analysis of limiting probability distribution. • Comparison of the models with the memoryless case. a r t i c l e i n f o b s t r a c t We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model
We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive t...
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distri...
In the note we show how the choice of the initial states can influence the evolution of time-average...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is y...
Quantum walks are stochastic processes generated by a quantum evolution mechanism, allowing for spee...
We consider quantum walks on the cycle in the non-stationary case where the ‘coin’ operation is allo...
Quantum walks are analogous to the classical random walks, and have important applications in quantu...
International audienceThe convergence time of a random walk on a graph towards its stationary distri...
Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also f...
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classic...
We examine a discrete-time quantum walk with two-step memory for a particle on a one-\ud dimensional...
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classic...
The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively...
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distri...
We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive t...
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distri...
In the note we show how the choice of the initial states can influence the evolution of time-average...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is y...
Quantum walks are stochastic processes generated by a quantum evolution mechanism, allowing for spee...
We consider quantum walks on the cycle in the non-stationary case where the ‘coin’ operation is allo...
Quantum walks are analogous to the classical random walks, and have important applications in quantu...
International audienceThe convergence time of a random walk on a graph towards its stationary distri...
Quantum walks are powerful tools not only for constructing the quantum speedup algorithms but also f...
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classic...
We examine a discrete-time quantum walk with two-step memory for a particle on a one-\ud dimensional...
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classic...
The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively...
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distri...
We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive t...
A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distri...
In the note we show how the choice of the initial states can influence the evolution of time-average...