2009
DOI: 10.1080/15326340802640941
|View full text |Cite
|
Sign up to set email alerts
|

Limit Theorems and Absorption Problems for One-Dimensional Correlated Random Walks

Abstract: Abstract. There has recently been considerable interest in quantum walks in connection with quantum computing. The walk can be considered as a quantum version of the so-called correlated random walk. We clarify a strong structural similarity between both walks and study limit theorems and absorption problems for correlated random walks by our PQRS method, which was used in our analysis of quantum walks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
34
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
9

Relationship

4
5

Authors

Journals

citations
Cited by 40 publications
(35 citation statements)
references
References 54 publications
(112 reference statements)
1
34
0
Order By: Relevance
“…This is defined as a quantum-mechanical analogue to the FTD stochastic coin of the correlated RW defined [42]. According to Ref.…”
Section: Final-time Dependent Discrete Time Quantum Walkmentioning
confidence: 99%
“…This is defined as a quantum-mechanical analogue to the FTD stochastic coin of the correlated RW defined [42]. According to Ref.…”
Section: Final-time Dependent Discrete Time Quantum Walkmentioning
confidence: 99%
“…According to Eqs. (12) and (14), we can get the walk matrix U . The size of both of shift matrix S and the walk matrix U are 4N × 4N .…”
Section: Numerical Simulationmentioning
confidence: 99%
“…[1][2][3][4] It is often shown that a useful quantum search algorithm can be designed based on the quantum walk. [5][6][7] Moreover, the result on a quantum walk on Z with an absorbing wall 8 has been applied to solve the transport problems in solid-state physics of strongly correlated electron systems in Ref.…”
Section: Introductionmentioning
confidence: 99%
“…The M -CQW is a quantum generalization of the random walk depending on the previous M -step memory. 4,19 The quantum coin describing the one step dynamics can be obtained by replacing the nonzero entries of an adjacency matrix of the de-Bruijn digraph to some nonzero appropriate values. See Refs.…”
Section: Introductionmentioning
confidence: 99%