The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional integer lattice by the path counting method. We show that the return probability of both quantum and correlated random walks can be expressed in terms of the Legendre polynomial. Moreover, the generating function of the return probability can be written in terms of elliptic integrals of the first and second kinds for the quantum walk
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
We analyze several families of one and two-dimensional nearest neighbor Quantum Random Walks. Using ...
We analyze several families of one and two-dimensional nearest neighbor Quantum Random Walks. Using ...
We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip ma...
We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip ma...
The present paper gives a rigorous way from quantum to classical for quantum walks by introducing an...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
Random walks form an important part of classical probability theory [26, 28] and have remarkable app...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
We define and analyze quantum computational variants of random walks on one-dimensional lattices. I...
Random walks have been applied in a many different fields for a long time. More recently, classical ...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
We analyze several families of one and two-dimensional nearest neighbor Quantum Random Walks. Using ...
We analyze several families of one and two-dimensional nearest neighbor Quantum Random Walks. Using ...
We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip ma...
We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip ma...
The present paper gives a rigorous way from quantum to classical for quantum walks by introducing an...
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Cha...
Random walks form an important part of classical probability theory [26, 28] and have remarkable app...
Of central interest in the study of random walks on finite groups are ergodic random walks. Ergodic ...
We define and analyze quantum computational variants of random walks on one-dimensional lattices. I...
Random walks have been applied in a many different fields for a long time. More recently, classical ...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
With a recent interest in quantum computers, the properties of quantum mechanicalcounterparts to cla...