scholarly journals Limit theorems for the interference terms of discrete-time quantum walks on the line

2013 ◽  
Vol 13 (7&8) ◽  
pp. 661-671
Author(s):  
Takuya Machida

The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal elements of the density matrix. On the other hand, although off-diagonal parts of the density matrices have an important role to quantify quantumness, they have not received attention in quantum walks. We focus on the off-diagonal parts of the density matrices for discrete-time quantum walks on the line and derive limit theorems for them.

2009 ◽  
Vol 15 (3) ◽  
pp. 423-429 ◽  
Author(s):  
Kota CHISAKI ◽  
Masatoshi HAMADA ◽  
Norio KONNO ◽  
Etsuo SEGAWA

2012 ◽  
Vol 12 (3&4) ◽  
pp. 314-333
Author(s):  
Kota Chisaki ◽  
Norio Konno ◽  
Etsuo Segawa

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.


Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1134
Author(s):  
Kenta Higuchi ◽  
Takashi Komatsu ◽  
Norio Konno ◽  
Hisashi Morioka ◽  
Etsuo Segawa

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.


2018 ◽  
Vol 29 (10) ◽  
pp. 1850098 ◽  
Author(s):  
R. F. S. Andrade ◽  
A. M. C. Souza

Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.


2017 ◽  
Vol 96 (1) ◽  
Author(s):  
N. Lo Gullo ◽  
C. V. Ambarish ◽  
Th. Busch ◽  
L. Dell'Anna ◽  
C. M. Chandrashekar

2013 ◽  
Vol 13 (5&6) ◽  
pp. 430-438
Author(s):  
Takuya Machida

Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence have been investigated. The relation between quantum walks and quantum probability theory is still unknown. As random walks are fundamental models in the Kolmogorov probability theory, can the quantum walks play an important role in quantum probability theory? To discuss this problem, we focus on a discrete-time 2-state quantum walk with a non-localized initial state and present a limit theorem. By using our limit theorem, we generate probability laws in the quantum central limit theorems from the quantum walk.


2019 ◽  
Vol 66 ◽  
pp. 197-223
Author(s):  
Michal Jozef Knapik ◽  
Etienne Andre ◽  
Laure Petrucci ◽  
Wojciech Jamroga ◽  
Wojciech Penczek

In this paper we investigate the Timed Alternating-Time Temporal Logic (TATL), a discrete-time extension of ATL. In particular, we propose, systematize, and further study semantic variants of TATL, based on different notions of a strategy. The notions are derived from different assumptions about the agents’ memory and observational capabilities, and range from timed perfect recall to untimed memoryless plans. We also introduce a new semantics based on counting the number of visits to locations during the play. We show that all the semantics, except for the untimed memoryless one, are equivalent when punctuality constraints are not allowed in the formulae. In fact, abilities in all those notions of a strategy collapse to the “counting” semantics with only two actions allowed per location. On the other hand, this simple pattern does not extend to the full TATL. As a consequence, we establish a hierarchy of TATL semantics, based on the expressivity of the underlying strategies, and we show when some of the semantics coincide. In particular, we prove that more compact representations are possible for a reasonable subset of TATL specifications, which should improve the efficiency of model checking and strategy synthesis.


Sign in / Sign up

Export Citation Format

Share Document