scholarly journals Crossovers induced by discrete-time quantum walks

2011 ◽  
Vol 11 (9&10) ◽  
pp. 741-760
Author(s):  
Kota Chisaki ◽  
Norio Konno ◽  
Etsuo Segawa ◽  
Yutaka Shikano
Keyword(s):  
Weak Convergence ◽  
Random Walks ◽  
Discrete Time ◽  
Convergence Theorem ◽  
Continuous Time ◽  
Quantum Walk ◽  
Convergence Theorems ◽  
Final Time ◽  
Time Quantum ◽  
Weak Convergence Theorem

We consider crossovers with respect to the weak convergence theorems from a discrete-time quantum walk (DTQW). We show that a continuous-time quantum walk (CTQW) and discrete- and continuous-time random walks can be expressed as DTQWs in some limits. At first we generalize our previous study [Phys. Rev. A \textbf{81}, 062129 (2010)] on the DTQW with position measurements. We show that the position measurements per each step with probability $p \sim 1/n^\beta$ can be evaluated, where $n$ is the final time and $0<\beta<1$. We also give a corresponding continuous-time case. As a consequence, crossovers from the diffusive spreading (random walk) to the ballistic spreading (quantum walk) can be seen as the parameter $\beta$ shifts from 0 to 1 in both discrete- and continuous-time cases of the weak convergence theorems. Secondly, we introduce a new class of the DTQW, in which the absolute value of the diagonal parts of the quantum coin is proportional to a power of the inverse of the final time $n$. This is called a final-time-dependent DTQW (FTD-DTQW). The CTQW is obtained in a limit of the FTD-DTQW. We also obtain the weak convergence theorem for the FTD-DTQW which shows a variety of spreading properties. Finally, we consider the FTD-DTQW with periodic position measurements. This weak convergence theorem gives a phase diagram which maps sufficiently long-time behaviors of the discrete- and continuous-time quantum and random walks.

scholarly journals A limit theorem for a splitting distribution of a quantum walk

2018 ◽  
Vol 16 (03) ◽  
pp. 1850023
Author(s):  
Takuya Machida
Keyword(s):  
Limit Theorem ◽  
Probability Distribution ◽  
Random Walks ◽  
Discrete Time ◽  
Limit Distribution ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Unitary Evolution ◽  
Time Quantum ◽  
Long Time

Discrete-time quantum walks are considered a counterpart of random walks and their study has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to two parts. The quantum walker with two coin states spreads at points, represented by integers, and we analyze the chance of finding the walker at each position after it carries out a unitary evolution a lot of times. The result is reported as a long-time limit distribution from which one can see an approximation to the finding probability.

EVOLUTION OF CONTINUOUS-TIME QUANTUM RANDOM WALKS ON CIRCLES

2005 ◽  
Vol 05 (01) ◽  
pp. L73-L83 ◽  
Author(s):  
NORIO INUI ◽  
KOICHIRO KASAHARA ◽  
YOSHINAO KONISHI ◽  
NORIO KONNO
Keyword(s):  
Standard Deviation ◽  
Random Walks ◽  
Discrete Time ◽  
Continuous Time ◽  
Quantum Random Walks ◽  
Time Quantum ◽  
Mixing Property ◽  
Temporal Standard Deviation

This work deals with both instantaneous uniform mixing property and temporal standard deviation for continuous-time quantum random walks on circles in order to study their fluctuations comparing with discrete-time quantum random walks, and continuous- and discrete-time classical random walks.

scholarly journals Unstructured search by random and quantum walk

2022 ◽  
Vol 22 (1&2) ◽  
pp. 53-85
Author(s):  
Thomas G. Wong
Keyword(s):  
Random Walks ◽  
Continuous Time ◽  
Quantum Computer ◽  
Success Probability ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Search Problem ◽  
Large N ◽  
Time Quantum ◽  
Classical Computer

The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search problem, this corresponds to searching the complete graph, or all-to-all network, for a marked vertex by querying an oracle. In this tutorial, we derive how discrete- and continuous-time (classical) random walks and quantum walks solve this problem in a thorough and pedagogical manner, providing an accessible introduction to how random and quantum walks can be used to search spatial regions. Some of the results are already known, but many are new. For large $N$, the random walks converge to the same evolution, both taking $N \ln(1/\epsilon)$ time to reach a success probability of $1-\epsilon$. In contrast, the discrete-time quantum walk asymptotically takes $\pi\sqrt{N}/2\sqrt{2}$ timesteps to reach a success probability of $1/2$, while the continuous-time quantum walk takes $\pi\sqrt{N}/2$ time to reach a success probability of $1$.

scholarly journals General methods and properties to evaluate continuum limits of the 1D discrete time quantum walk

2020 ◽  
Vol 19 (10) ◽  
Author(s):  
Michael Manighalam ◽  
Mark Kon
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Quantum Walk ◽  
Quantum Systems ◽  
Quantum Walks ◽  
Time Limit ◽  
Continuous Limit ◽  
Continuous Space ◽  
Time Quantum ◽  
Space Limit

Abstract Models of quantum walks which admit continuous time and continuous spacetime limits have recently led to quantum simulation schemes for simulating fermions in relativistic and nonrelativistic regimes (Molfetta GD, Arrighi P. A quantum walk with both a continuous-time and a continuous-spacetime limit, 2019). This work continues the study of relationships between discrete time quantum walks (DTQW) and their ostensive continuum counterparts by developing a more general framework than was done in Molfetta and Arrighi (A quantum walk with both a continuous-time and a continuous-spacetime limit, 2019) to evaluate the continuous time limit of these discrete quantum systems. Under this framework, we prove two constructive theorems concerning which internal discrete transitions (“coins”) admit nontrivial continuum limits. We additionally prove that the continuous space limit of the continuous time limit of the DTQW can only yield massless states which obey the Dirac equation. Finally, we demonstrate that for general coins the continuous time limit of the DTQW can be identified with the canonical continuous time quantum walk when the coin is allowed to transition through the continuous limit process.

scholarly journals Limit theorems for the discrete-time quantum walk on a graph with joined half lines

2012 ◽  
Vol 12 (3&4) ◽  
pp. 314-333
Author(s):  
Kota Chisaki ◽  
Norio Konno ◽  
Etsuo Segawa
Keyword(s):  
Asymptotic Behavior ◽  
Discrete Time ◽  
Limit Theorems ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Half Line ◽  
Initial State ◽  
Time Quantum ◽  
Weak Convergence Theorem ◽  
The One

We consider a discrete-time quantum walk W_{t,\kappa} at time t on a graph with joined half lines J_\kappa, which is composed of \kappa half lines with the same origin. Our analysis is based on a reduction of the walk on a half line. The idea plays an important role to analyze the walks on some class of graphs with symmetric initial states. In this paper, we introduce a quantum walk with an enlarged basis and show that W_{t,\kappa} can be reduced to the walk on a half line even if the initial state is asymmetric. For W_{t,\kappa}, we obtain two types of limit theorems. The first one is an asymptotic behavior of W_{t,\kappa} which corresponds to localization. For some conditions, we find that the asymptotic behavior oscillates. The second one is the weak convergence theorem for W_{t,\kappa}. On each half line, W_{t,\kappa} converges to a density function like the case of the one-dimensional lattice with a scaling order of t. The results contain the cases of quantum walks starting from the general initial state on a half line with the general coin and homogeneous trees with the Grover coin.

scholarly journals Quantum algorithms for subset finding

2005 ◽  
Vol 5 (7) ◽  
pp. 593-604
Author(s):  
A.M. Childs ◽  
J.M. Eisenberg
Keyword(s):  
Lower Bounds ◽  
Discrete Time ◽  
Continuous Time ◽  
Quantum Algorithms ◽  
Quantum Walk ◽  
Query Complexity ◽  
Open Problems ◽  
Time Quantum ◽  
Query Algorithm ◽  
Walk Algorithm

Recently, Ambainis gave an $O(N^{2/3})$-query discrete-time quantum walk algorithm for the element distinctness problem, and more generally, an $O(N^{L/(L+1)})$-query algorithm for finding $L$ equal numbers. We review this algorithm and give a simplified and tightened analysis of its query complexity using techniques previously applied to the analysis of continuous-time quantum walk. We also briefly discuss applications of the algorithm and pose two open problems regarding continuous-time quantum walk and lower bounds.

scholarly journals A Discontinuity of the Energy of Quantum Walk in Impurities

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1134
Author(s):  
Kenta Higuchi ◽  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa
Keyword(s):  
Unit Circle ◽  
Stationary State ◽  
Discrete Time ◽  
Quantum Walk ◽  
Time Limit ◽  
The Other ◽  
Unitary Matrix ◽  
Initial State ◽  
Time Quantum ◽  
Long Time

We consider the discrete-time quantum walk whose local dynamics is denoted by a common unitary matrix C at the perturbed region {0,1,⋯,M−1} and free at the other positions. We obtain the stationary state with a bounded initial state. The initial state is set so that the perturbed region receives the inflow ωn at time n(|ω|=1). From this expression, we compute the scattering on the surface of −1 and M and also compute the quantity how quantum walker accumulates in the perturbed region; namely, the energy of the quantum walk, in the long time limit. The frequency of the initial state of the influence to the energy is symmetric on the unit circle in the complex plain. We find a discontinuity of the energy with respect to the frequency of the inflow.

Sign in / Sign up

Export Citation Format

Share Document