We study a discrete-time quantum walk in presence of a detector at
xD initially. The detector here is repeatedly removed after a span of
tR, the removal time, and reinserted at random locations. Two relocation rules are considered here: In Model~1, the detector is reinserted at any site beyond
xD, while in Model~2, reinsertion is done within a restricted window around the position of the detector at that time. Both variants behave like Semi Infinite Walk (SIW) for large
tR, where the detector behaves effectively as a fixed boundary. However, in the rapid-relocation regime, i.e., when
tR is small, the behaviours are different. Model~1 permits greater spreading due to unrestricted reinsertion, which is different from Model~2. The time evolution of occupation probability ratio of our walker to that of an infinite walker at
xD, i.e.,
f(xD,t)/f∞(xD,t), initially show the feature of a SIW upto
t=tR, then show some oscillatory behaviour and finally reach a saturation value for both the models. The ratio enhancing under certain conditions of
xD and
tR, is a purely quantum mechanical effect. The saturation ratio shows a crossover behavior below and above a removal time
tR∗. At sites
x=xD the occupation probablity ratios at a certain time reveals that for small
tR, the behaviours of the two models are drastically different from each other, as well as from Semi Infinite Walk (SIW), Quenched Quantum Walk (QQW) and Moving Detector Quantum Walk (MDQW). The correlation ratios of the two models with that of Infinite Walk (IW) show interesting time dependence for sites to the left or right of the initial detector position
xD.
A study of persistence dynamics is made for the first time in a quantum system by considering the dynamics of a quantum random walk. For a discrete walk on a line starting at
x=0 at time
t=0, the persistence probability
P(x,t) that a site at
x has not been visited till time
t has been calculated.
P(x,t) behaves as
(t/∣x∣−1)−α with
α∼0.3 while the global fraction
P(t)=∑xP(x,t)/2t of sites remaining unvisited at time
t attains a constant value.
F(x,t), the probability that the site at
x is visited for the first time at
t behaves as
(t/∣x∣−1)−β/∣x∣ where
β=1+α for
t/∣x∣>>1,and
F(t)=∑xF(x,t)/2t∼1/t. A few other properties related to the persistence and first passage times are studied and some fundamental differences between the classical and the quantum cases are observed.
We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRWs). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the phenomenon, called ``localization,'' whereby the probability distribution of the walker's position is seen to exhibit a persistent major ``spike'' (or ``peak'') at the initial position and two other minor spikes which drift to infinity in either direction. Another interesting finding in connection with QRWs of this sort pertains to the limiting behavior of the position probability distribution. It is seen that the probability of finding the walker at any given location eventually becomes stationary and nonvanishing. We explain these observations in terms of the degeneration of some eigenvalue of the time evolution operator
U(k). An explicit general formula is derived for the limiting probability, from which we deduce the limiting value of the height of the observed spike at the origin. We show that the limiting probability decreases quadratically for large values of the position
x. We locate the two minor spikes and demonstrate that their positions are determined by the phases of nondegenerated eigenvalues of
U(k). Finally, for fixed time
t sufficiently large, we examine the dependence on
t of the probability of finding a particle at a given location
x.
We investigate one-dimensional discrete-time quantum walk on the line where the links between neighboring sites are randomly broken. Two link-broken ways, static percolation and dynamical percolation, are considered. The former means that the broken links are fixed in position space at each time step, while the latter is that broken links are varied with time step. Our attention focuses on the effects of these disorders on two physical quantities, the probability distribution and the entanglement between the coin degree of freedom and position degree of freedom. Choosing Hadamard coin operator and assuming the walker to start from the position eigenstate|0〉and attach itself to a coherent coin state 1/√2 (|↑〉+ i|↓〉), we give the statistical average results after making numerical calculations many times. The choices of coin operator and initial state, resulting in a symmetric probability distribution about origin in the ideal case, is helpful in comparing with different cases in different disorder strengths. It is shown that the probability distribution of static percolation quantum walk can change from a coherent behavior at short time to Anderson localization at longer time, while the dynamical percolation quantum walk can change to a classical diffusive behavior. With the decrease of the percolation probability, these transitions become faster. The entanglement for ideal case without disorder reaches a constant value after a short time evolution. The static percolation makes the entanglement less than that of ideal case and fluctuate irregularly around a certain value. The situation is very different for the dynamical percolation:the entanglement increases smoothly with the time step and can exceed the constant value in the ideal case at some time. Both of entanglements for two types of percolations decrease with reducing percolation probability. As a striking characteristic, the entanglement in dynamical case can tend to maximum regardless of percolation probability in long time limit, while the static case cannot. In the model for our study, the randomized unitary operations, induced by the static and dynamical percolations, can lead to some noticeable effects on the transport and entanglement of discrete time quantum walk. The results about the interplay between disorder and entanglement not only assist quantum information processing, but also give more options to further explore and understand disorder physical processes in nature.
The evolution of a walker in standard "Discrete-time Quantum Walk (DTQW)" is determined by coin and shift unitary operators. The conditional shift operator shifts the position of the walker to right or left by unit step size while the direction of motion is specified by the coin operator. This scenario can be generalized by choosing the step size randomly at each step in some specific interval. For example, the value of the roll of a dice can be used to specify the step size after throwing the coin. Let us call such a quantum walk "Discrete-time Random Step Quantum Walk (DTRSQW)". A completely random probability distribution is obtained whenever the walker follows the DTRSQW. We have also analyzed two more types of quantum walks, the "Discrete-time Un-biased Quantum Walk (DTUBQW)" and the "Discrete-time Biased Quantum Walk (DTBQW)". In the first type, the step size is kept different than unit size but the same for left and right shifts, whereas in the second type left and right shifts can also be different. The probability distribution in DTUBQW is found to follow a certain rule. The standard deviation (
σ) of DTRSQW is higher than DTQW and hence DTRSQW spreads faster. The
σ of DTUBQW shows sawtooth behavior with faster spread than DTQW for some specific values of rotation angles and steps.
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker moves originates from the unitary interaction of the walker coin with the qubit degrees of freedom in the quantum network. The walk dynamics leads to a growth of entanglement between the walker and the network on one hand and, on the other, between the network qubits among themselves. The initial entanglement among the network qubits plays a crucial role in determining the asymptotic values of these entanglement measures and the quantum walk statistics. Specifically, the entanglement entropy of the walker-network state and the negativity of the quantum network-qubit state saturate to values increasing with the initial network entanglement. The asymptotic time-averaged walker-position probability distribution shows increasing localization around the initial walker position with higher initial network entanglement. A potential application of these results as a characterization tool for quantum network properties is suggested.