Next Article in Journal
Microgravity Spherical Droplet Evaporation and Entropy Effects
Previous Article in Journal
Nonequilibrium Thermodynamics of the Majority Vote Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

First Detection and Tunneling Time of a Quantum Walk

1
School of Physics, Shandong University, Jinan 250100, China
2
Department of Physics, Bar Ilan University, Ramat-Gan 52900, Israel
*
Author to whom correspondence should be addressed.
Entropy 2023, 25(8), 1231; https://doi.org/10.3390/e25081231
Submission received: 5 July 2023 / Revised: 10 August 2023 / Accepted: 16 August 2023 / Published: 18 August 2023
(This article belongs to the Section Quantum Information)

Abstract

:
We consider the first detection problem for a one-dimensional quantum walk with repeated local measurements. Employing the stroboscopic projective measurement protocol and the renewal equation, we study the effect of tunneling on the detection time. Specifically, we study the continuous-time quantum walk on an infinite tight-binding lattice for two typical situations with physical reality. The first is the case of a quantum walk in the absence of tunneling with a Gaussian initial state. The second is the case where a barrier is added to the system. It is shown that the transition of the decay behavior of the first detection probability can be observed by modifying the initial condition, and in the presence of a tunneling barrier, the particle can be detected earlier than the impurity-free lattice. This suggests that the evolution of the walker is expedited when it tunnels through the barrier under repeated measurement. The first detection tunneling time is introduced to investigate the tunneling time of the quantum walk. In addition, we analyze the critical transitive point by deriving an asymptotic formula.

1. Introduction

Nowadays, quantum walk (QW), a counterpart of the classical random walk, plays a key role in many quantum problems [1,2,3,4,5,6,7,8,9,10]. The quantum walk, introduced by Aharonov et al. [11], can be realized in two distinct ways: the continuous-time quantum walk (CTQW) [12,13,14] and the discrete-time quantum walk (DTQW) [4,15,16,17]. In the continuous case, the evolution of a particle is described by the Schrödinger equation and the Hamiltonian of a system is related to the transition matrix of graphs which represents the transition rates of the corresponding continuous-time random walk. In the discrete-time scenario, a unitary quantum coin operator is used to determine the direction of the particle’s movement (e.g., left or right in a one-dimension lattice system), in addition to a shift operator which describes the movement of the quantum walker. Studies of quantum walks have demonstrated that these two approaches display the same qualitative behaviors [4,14,18]. The quantum algorithm based on a CTQW is exponentially faster than the classical algorithm of a classical random walk for the “glued trees” graph [14]. The quantum search algorithm based on the DTQW has a quadratic speed-up O ( N ) on a database of N items [4]. Recently, different experimental implementations of quantum walks have been performed by photons in waveguide, nuclear magnetic resonance, and trapped atom systems [19,20,21].
In consideration of the acceleration property of the quantum walk in quantum algorithms, quantum walks have drawn considerable attention, and much progress has been achieved on first detection problems [22,23,24,25,26,27,28,29,30,31,32,33]. Krovi et al. defined the hitting time by analogy to a classical random walk for a quantum walk on a hypercube [23,25]. Several studies [27,29,34] have derived a quantum renewal equation for the first detection time which is similar to the classical renewal equation and discussed dark states, uncertainty principles, and transition times on various graphs. For example, in a closed ring system with a repeated measurement interval τ the mean first detection return time is n τ , with n provided by the number of distinct energy levels of the system. Thiel et al. studied the return and arrival problems of the first detection probability on the infinite line, where the behavior is highly sensitive to the distance between the detection site and the initial localized particle. Beyond all expectations, the total detection probability becomes independent of the distance when it is large [27,32]. Considerable work on first detection probability in quantum walks has investigated a single particle in systems with an absence of defects. Unlike DTQW, which can perform a biased walk, a CTQW evolves as a ballistic spread to both sides. Hence, we would like to adopt a Gaussian wave packet to dominate the direction and the velocity of the initial condition. Moreover, the systems realizing the quantum walk may comprise defects or disorder in realistic experimental realization. Thus, quantum walks in impure systems should be addressed as well.
In this paper, we consider a quantum walk on a one-dimension lattice under tight binding approximation. We investigate the effect of the initial Gaussian wavepacket with some initial mean momentum, rather than the delta-function localized at a given site, as considered previously [32]. We find that the long time behavior of the first detection probability with a broad initial state decays monotonically, contrary to the case of the quantum point source, where it decays with superimposed oscillations. We derive an asymptotic formula to describe the relation between the width of the initial wave packet and the oscillation of the first detection probability. The initial superposition lessens the influence of the sampling time on the total detection probability. When the wave packet is wide, the exceptional sampling time remains, and the total detection probability is a smooth function relative to the sampling time rather than oscillating. This provides more options in terms of the sampling time used to detect the particle.
We then study the system in the presence of a tunneling center on one lattice point, that is, we consider the effects of a localized impurity on the first detection probability. As Figure 1 shows, the impurity is modeled with a delta-like potential barrier, with a height ϵ (units energy). We consider an incoming initial Gaussian wave packet with a mean momentum traveling from left to right, setting the detector on the right of the barrier. By employing the stroboscopic detection protocol [27], we study the first detection probability and the total probability with different initial waves. In addition, we introduce the tunneling time in the first detection time scenario to present the tunneling time and multiple-defects tunneling. We find that the speed inside the barrier is faster than the speed outside the barrier, that is, the evolution can be accelerated by the barriers but the detection probability becomes lower. For the first detection case, the measurements play a crucial role because of the backfire and modify the unitary evolution before the final successful detection.
The rest of this paper is structured as follows. In Section 2, we introduce the basic theoretical framework of the CTQW and the measurement protocol. The first detection probability of the Gaussian wave quantum walk is derived. The quantum walk in the system with a barrier is provided in this section as well. Section 3 shows the numerical results of the first detection problems in the presence and absence of tunneling. In Section 4, we present the asymptotic result of the first detection probability. Section 5 closes the paper with our concluding remarks.

2. Theoretical Framework

2.1. Stroboscopic Protocol

We first recall the basics of the stroboscopic detection protocol. The CTQW, a quantum analogy of the classical continuous-time random walk, replaces the classical vector of probabilities with a vector of probability amplitudes (a state vector) and the transition matrix with a unitary matrix. We consider a quantum walk on a one-dimension tight-binding model with hopping to the nearest neighbor sites only. Its propagation can be described by the Schrödinger equation, and the unitary U ( t ) is provided by the following equation (we set ħ = 1 ):
U ( t ) = e i H t .
The Hamiltonian H is defined as [1,8]
H j j = γ , if j = j ± 1 , 0 , otherwise ,
where the integer indices j and j denote the lattice coordinates and γ is the hopping rate. The state of the system in the absence of repeated measurements at time t is
ψ ( t ) = U ( t ) ψ i n ,
with the initial state ψ i n .
We define the projection operator, corresponding to a measurement to detect the particle, as follows:
D ^ = ψ d e t ψ d e t .
The probability of detecting the particle is
p 1 = ψ d e t | ψ 2 = ψ | ψ d e t ψ d e t | ψ = ψ | D ^ | ψ ;
correspondingly, the probability of non-detecting the particle is p = 1 p 1 . Based on the projection measurement postulates of quantum mechanics [35], the state of the system after a failed detection is immediately the normalized projection, namely,
| ψ = ( 1 D ^ ) | ψ 1 p 1 .
The primes in p and | ψ represent other variables rather than the derivative. As shown in Figure 1, we consider the stroboscopic measurement protocol [24,27,29]; a sequence of measurements is described by employing the same projector with the time interval τ between measurements. The probability of detection after the preceding ( n 1 ) measurements has failed is
p n = | ψ d e t | [ U ( τ ) ( 1 D ^ ) ] n 1 U ( τ ) | ψ i n | 2 m = 1 n 1 ( 1 p m ) .
Hence, the probability of first detection after n attempts is [24,27]
F n = ( 1 p 1 ) ( 1 p 2 ) ( 1 p 3 ) ( 1 p n 1 ) p n = | ψ d e t | [ U ( τ ) ( 1 D ^ ) ] n 1 U ( τ ) | ψ i n | 2 .
It is convenient to define the amplitude of the first detection as [24,27,32]
φ n = ψ d e t | [ U ( τ ) ( 1 D ^ ) ] n 1 U ( τ ) | ψ i n ,
and we can show that φ n satisfies the following quantum renewal equation [27]:
φ n = ψ d e t | U ( n τ ) | ψ i n m = 1 n 1 φ m ψ d e t | U [ ( n m ) τ ] | ψ d e t .
In Equation (10), the first term describes the direct transition from the initial location to the detector, and the second term the paths that arrive at the detector at the m th measurement and then return in the remaining “time” ( n m ) . Equation (10) can be solved with a generating function technique and convolution theorem [36].
Correspondingly, the total probability that the particle can be detected is
P t o t = n F n = φ n 2 .
To solve the quantum renewal equation Equation (10), as a useful technique for dealing with discrete random events in time, we introduce the generating function here, which may be considered as the discrete analogue of the Laplace transform [8,29,37,38]:
φ ^ ( z ) = n = 1 z n φ n ,
where z is an auxiliary variable. Using the convoluting quantum renewal equation of Equation (10), we can obtain [27,29]
φ ^ ( z ) = ψ d e t | U ^ ( z ) | ψ i n 1 + ψ d e t | U ^ ( z ) | ψ d e t ,
where
U ^ ( z ) = n = 1 z n U n ( τ ) = n = 1 z n e i H n τ .
After φ ^ ( z ) has been obtained, we can find φ n by the inverse transformation
φ n = 1 n ! d n d z n φ ^ ( z ) | z = 0 ,
or by
φ n = 1 2 π i C φ ^ ( z ) z n 1 d z ,
where C is a counterclockwise contour around the origin and is within the radius of convergence of the generating function φ ^ ( z ) .

2.2. Gaussian Wave Packet Quantum Walk

For the tight-binding model, after considering Equation (2), we have the following Hamiltonian [27,39]:
H = γ j ( | j j + 1 | + | j + 1 j | ) ,
where | j represents the state localized at site j. In addition, | j is part of a complete orthonormalized basis set, namely, j | j = δ j j and j | j j | = 1 . The set of sites { j } forms an infinite lattice. We assume the hopping rate γ = 1 in the remainder of this work for the sake of simplicity. The eigenvalues of the tight-binding model Hamiltonian of Equation (17) are [27,32,39]
E k = 2 cos k
with eigenstates
| E k = 1 2 π j e i k j | j ,
where the wave vector is π k π in the first Brillouin zone.
To demonstrate the quantum walk of a Gaussian wave packet, we suppose the normalized initial wave function can be expressed as
| ψ i n = j c j | j ,
where, after supposing the mean position of the wave packet to be j c and its carrying lattice momentum to be k 0 , the weights can be written as [40]
c j = 1 A e i k 0 j e ( j j c ) 2 4 σ 2
with the normalized constant A = j e j 2 2 σ 2 , and σ as the width of the Gaussian wave packet.
By employing the fact of the matrix elements of the propagator [27,32]
j | U ( n τ ) | j = 1 2 π π π e i k ( j j ) e i n τ E k / ħ d k = i j j J j j ( 2 n τ ) ,
we obtain the generating function of the first detection amplitude for a Gaussian wave quantum walk
φ ^ ( z ) = n = 1 z n j = i j d j c j J j d j ( 2 n τ ) 1 + n = 1 z n J 0 ( 2 n τ ) ,
where i = 1 as usual and J μ ( x ) is the Bessel function of the first kind of order μ . The generating function of the first detection amplitude of the Gaussian wave quantum walk is the sum of the packet’s components with different weights, which are determined by the initial Gaussian wave packet. This is clearly the superposition principle at work. The order of the Bessel function in the numerator is only related to the distance between the detection site and the initial position of every component. Using Equations (11) and (15), we can obtain the first detection probability of the Gaussian wave packet quantum walk.

2.3. Quantum Walk with Tunneling

In this subsection, we consider the tight-binding model in which one of the diagonal matrix elements is equal to ϵ ; as a consequence, the Hamiltonian can be defined as [39,41]
H = H 0 + H 1 = j ( | j j + 1 | + | j + 1 j | ) + ϵ | 0 0 | ,
where the barrier is located at site j = 0 . In this paper, we assume that the magnitude of the peculiar ingredient ϵ is positive, meaning that the quantum walker may reflect or transmit when it impinges the barrier. In order to calculate the first detection probability, it is necessary to obtain the propagator. Using the theory of the Green function [41], which is shown in Appendix A.1 for a tight-binding Hamiltonian with a single impurity, we can obtain the matrix elements of the propagator as follows:
j | U ( n τ ) | j = i j j J j j ( 2 n τ ) + e i n τ ϵ 2 + 4 2 | j | | j | | ϵ | ( ϵ ϵ 2 + 4 ) | j | + | j | ϵ 2 + 4 + 1 π 0 π d k e i 2 n τ cos k i ϵ e i k | j | 2 sin k i ϵ cos k j + i ϵ e i k | j | 2 sin k + i ϵ cos k j + ϵ 2 e i k ( | j | | j | ) 4 sin 2 k + ϵ 2 .
Equation (25) is composed of the bound state ingredient and the scattered state ingredient. Employing the definition of the generation function Equation (13) and the inverse transformation Equation (15), we can obtain the first detection probability F n . We calculated the integral in Equation (25) and the series of the inverse transformation using Mathematica.

3. Numerical Results

In this section, we show the numerical results of the models discussed in Section 2. We consider the quantum walk with a Gaussian wave packet which is centered at site j c as an initial condition. The detection state is | ψ d e t = | j d . In addition, we investigate the tunneling time based on the first detection probability with an impurity.

3.1. Gaussian Wave Packet Quantum Walk with ϵ = 0

We consider the first detection probability distribution and the total detection probability in this subsection. Figure 2 demonstrates the first detection probability with different widths σ of the Gaussian initial wave packet; the circles, squares, and crosses correspond to the results of σ = 1 / 3 , 1 , 3 , respectively. When the width of the Gaussian wave packet σ is small, the behavior of the probability F n is similar to the case of a single source exhibiting a power-law decay superimposed with oscillations [27,32]. By increasing the width of the initial wave packet, we thereby reduce its spread in terms of its momentum, and the decay of the first detection probability changes from oscillatory to monotonic. In contrast to the classical continuous-time random walk, although both decay monotonically, the rates of power-law decay differ, with values of 3 (quantum) and 3 / 2 (classical), respectively [32]. In order to depict the velocity of the walker, we employ the incident time t i n = n i n τ when the maximal peak of the first detected probabilities appears. When the initial condition is a localized state, we find that the incident time is n i n = | j d j c | / v g τ , where v g denotes the maximum group velocity and v g = max | E k | = 2 [27,32]. As shown in Figure 2, a similar behavior is found for σ = 1 / 3 (circles). For the wide wave packet, the transport time t i n is proportional to the initial fluctuation of the momentum, i.e., the width of the wave packet in wave vector space can be obtained by the Fourier transformation or Heisenberg’s uncertainty principle, and is no longer the ballistic spread exhibited by an initial localized state.
In Figure 3, we display the total detection probability for different widths of wave packets. The total probability is less than unity in this infinite lattice system because there is a portion of the wave function propagating in the direction opposite to that of the detection site. This is very different from the classical case, in which the motion is diffusive and recurrent, and the walker will eventually be found. The probability in the vicinity of the origin of the sampling time remains nearly zero, the evolution of walker being impeded by the high frequency repeated measurements, that is, the Zeno effect [27,42,43]. The exceptional sampling time τ satisfies the relation [27]
Δ E τ = 2 π m ,
where Δ E = 4 is the width of the energy band in Equation (18), m is an integer, and the derivative of the probability is not continuous. There is a jump in the vicinity of the exceptional sampling time. Compared to the single localized initial condition in [32] or the σ = 1 / 3 scenario in Figure 3, the total probability increases monotonically between the adjacent critical sampling times. As the width widens, the highest peak of the total detection probability is not always at τ = π / 2 , and the optimal sampling time is not unique.

3.2. Quantum Walk with an Impurity

In this subsection, we present the numerical results of the first detection probability and the total detection probability of the system with a single impurity.
First, we consider the relationship between the sampling time and the total detection probability. As shown in Figure 4, the highest peak appears immediately after raising the sampling time, and the sampling time of the peak is much smaller than the case without the barrier, namely τ = π 2 . In presence of a barrier, the pedestrian will pass through the barrier or be reflected by the barrier. Except for the left-moving initial wave, the reflected waves have no contributions to the total probability. When the sampling time τ > π / 2 , the total probability oscillates without monotonic behaviour and there are no conspicuous peaks.
Figure 5 shows the probability distribution F n as a function of the attempted number of first detection for the transition problem in the presence of a barrier located at site j = 0 . The behaviors of σ = 1 , 3 , which are not shown in this figure, are similar to the case σ = 5 with oscillations. In order to show different behaviors, the other two parameters are selected for presentation in Figure 5. The transport velocity is same as in the impurity-free case, that is, the wider packet propagates faster. There are many peaks resulting from the barrier and the successive measurements, and the different components of wave packet cross the barrier with different probabilities. The probability of wide wave packet decays monotonously between the adjacent peaks in comparison to the narrow initial condition. Because the narrow initial wave contains more components of wavenumbers, there is more interference with other components after passing the barrier.

3.3. Tunneling Time on First Detection Probability

In the presence of a barrier, the time required for a wave packet to traverse the barrier is a well-studied problem, though not free of controversies [14,44,45,46,47,48,49,50,51,52,53,54]. The analysis of tunneling time is currently debated because of the unusual and subtle role that time plays in quantum mechanics. In the community of traditional quantum mechanics, time is thought of as a nonquantum ingredient of quantum mechanics. Previously, the tunneling time has been defined in different ways, such as phase time (or group delay) [49,50,51], dwell time [51,52,53], and Larmor time [53,54].
Here, we introduce the first detection tunneling time, defined with the aforementioned stroboscopic protocol, in analogy with the phase time, which can be calculated theoretically by the frequency derivative of the transmission phase change or measured experimentally at the time instant when the peak of a tunneling wave packet impinges and transmits the barrier.
Corresponding to the phase time, we can utilize the most probable first detection time to calculate the tunneling time; we measure the walker at the detected site, rather than the boundary of the barrier. Replacing the single localized initial condition with a broad wave packet | ψ i n that is sharply peaked in the momentum space, we represent a particle with momentum p = ħ k 0 and velocity v = ħ k 0 / m . The distribution can be written as
| ψ i n = 1 A e i k 0 ( j j c ) e ( j j c ) 2 4 σ 2 ,
where the center of the wave packet is located at j = j c and the width is Δ j = σ . The initial wave packet in the momentum representation is the Fourier transform of the position representation, that is, the wave function in the momentum representation is Gaussian as well. The corresponding standard deviation is Δ k = 1 / σ , and the average momentum is k = k 0 .
Based on the above considerations, we can investigate the tunneling time by comparing the incident time of the barrier case to the impurity-free system. Thus, the tunneling time is provided by
t t u n n e l = | Δ n τ | = | n i n f r e e n i n b a r r i e r | τ ,
where n i n f r e e is the incident time in the absence of a barrier and n i n b a r r i e r denotes the incident time in the presence of the barrier. As demonstrated in Figure 6, we choose a wide initial wave packet to ensure that the wave vector spread of the wave packet is narrow, and we can obtain the tunneling time. A walker carrying more momentum takes the same time to reach the detection site as one in the circumstance with no barrier. For a walker with less momentum, the peak of the tunneling wave packet arrives at the detection site earlier than normal free propagation. However, this seemingly anomalous behavior does not mean a violation of Einstein causality. The so-called “phase time” cannot be regarded as the velocity of the propagation of the tunneling wave, as it arises from the head start of the initial broad wave.
Furthermore, we can extend the tunneling problem to multiple defects by simulating the first detection problem of the quantum walk. In this multiple defects scenario, the system can be expressed as
H = j ( | j j + 1 | + | j + 1 j | ) + ȷ = 0 1 ϵ | ȷ ȷ | ,
where ȷ is the location of the defect and is interpreted as the spread of the barrier. The probability of the walker being detected at a specific point for the first time is determined by the Schrödinger equation and the quantum renewal equation. As shown in Figure 7, the first detection probabilities are plotted for a variety of values of . Using the same method, we compare the peak of the first detection probability distribution. For the scenario with multiple defects, it takes more time for the walker to cross the barrier. However, after the walker is successfully detected, the mean first passage time is less than with fewer defects. In a sense, the defects give rise to an acceleration of the evolution, that is, the speed inside the barrier is faster than the speed outside the barrier. In the meantime, the length and strength of barriers enhance the acceleration effect. However, the first detection probability would be reduced by broad barriers. This represents a trade-off between acceleration of evolution and detection.

4. Asymptotic Results

In the case of ϵ = 0 , the decays of the long time limit of the detection probability show different behaviors for different initial conditions: the oscillating probability, which generally emerges in quantum mechanics, and the monotonous probability, which occurs in classical mechanics (see Figure 2).
In this section, we address the asymptotic formula to discuss when the first detection probability oscillates for a small sampling time τ . Previously, Schrödinger studied the first arrival time of Brownian motion, namely, the limit of the classical random walk [55]. He demonstrated that the probability density function was a fat tail and decayed with the power law 3 / 2 . In [32], the large n limit of φ n was obtained for a single source, namely, an initial condition on one node of the graph. The behavior of φ n exhibits a power-law decay with oscillations, which is quite different from its classical counterpart, which decays monotonically.
In Equation (23), the Bessel function can be expanded as an asymptotic formula for large arguments [36]:
J μ ( x ) 2 π x cos ( x μ π 2 π 4 ) .
Due to the linearity of quantum mechanics, all we need to do to consider a Gaussian initial condition is to sum over the different amplitudes with the weights c j . Therefore, the amplitude of the first detection for the Gaussian initial wave packet is
φ n j c j τ π n 3 e i ( 2 n τ + π 4 ) 1 + δ j d j , 0 2 i π 0 π d k sin 2 k ( j d j ) 2 tan ( 2 τ sin 2 k 2 ) + e i ( 2 n τ + π 4 ) ( 1 ) j d j + δ j d j , 0 2 + i 2 π 0 π d k ( 1 ) j d j cos k ( j d j ) tan [ τ ( 1 + cos k ) ] .
Notice the n 3 / 2 over all decay of the first detection amplitude, and recall that this is similar to the classical result. When squared, F n will be proportional to n 3 , with possible superpositions of oscillations which depend on parameters such as the width. Then, Equation (31) can be abbreviated with the auxiliary function r ( ν , τ ) and β ( ν , τ ) [32]:
φ n 4 τ π n 3 j c j r ( j d j , τ ) trig j d j 2 n τ + π 4 + β ( j d j , τ ) .
The auxiliary function satisfies the relation [32]
r ( ν , τ ) e i β ( ν , τ ) = 1 + δ ν , 0 2 i π 0 π sin 2 ( ν k / 2 ) tan [ 2 τ sin 2 ( k / 2 ) ] d k ,
and the trigonometric function is
trig μ ( x ) = e i x + ( 1 ) μ e i x 2 .
In the limit of small sampling time τ [32],
r ( μ , τ ) e i β ( μ , τ ) i μ 2 τ ,
thus, the first detection amplitude can be written as
φ n 1 4 π τ n 3 j i c j ( j d j ) ( 1 ) j d j e i ( 2 τ n + π 4 ) 1 4 π τ n 3 j i c j ( j d j ) e i ( 2 τ n + π 4 ) .
Note that the periodicity is determined by 2 τ n 2 π . We assume that the detection site and the center of the initial wave packet are situated on even lattice points, and find
φ n 1 π τ n 3 j e v e n c j ( j d j ) sin 2 τ n + π 4 i j o d d c j ( j d j ) cos 2 τ n + π 4 = 1 π τ n 3 j e v e n 1 A e ( j j c ) 2 4 σ 2 ( j d j ) sin 2 τ n + π 4 j o d d i A e ( j j c ) 2 4 σ 2 ( j d j ) cos 2 τ n + π 4 .
Due to the symmetry of the wave packet, the prefactor of the trigonometric function of the odd part can be written as
j o d d c j ( j d j ) = κ = 1 , 3 , 5 , 1 A e κ 2 4 σ 2 ( 2 j d 2 j c ) = 1 A ( j d j c ) ϑ 2 ( 0 , e 1 σ 2 ) ,
and the even part is
j e v e n c j ( j d j ) = λ = 0 , 2 , 4 , 1 A e λ 2 4 σ 2 ( 2 j d 2 j c ) 1 A ( j d j c ) = 1 A ( j d j c ) ϑ 3 ( 0 , e 1 σ 2 ) ,
where ϑ ν ( z , q ) is the Elliptic Theta function [56].
When σ < 1 , the second-order Elliptic Theta function is not equal to the third-order one, and the trigonometric function in the first detection probability stays alive; consequently, F n decays with added oscillations when σ < 1 .
When σ 1 , the two elliptic functions behave similarly, that is,
j o d d c j ( j d j ) = j e v e n c j ( j d j ) .
Thus, the trigonometric function vanishes and the first detection amplitude is
φ n 1 π τ n 3 1 A ( j d j c ) ϑ 3 ( 0 , e 1 σ 2 ) e i ( 2 τ n π 4 ) .
In the limit of large n, the first detection probability for σ 1 is
F n | φ n | 2 = ( j d j c ) 2 ϑ 3 ( 0 , e 1 / σ 2 ) 2 π τ n 3 A = ( j d j c ) 2 ϑ 3 ( 0 , e 1 / σ 2 ) 2 2 π 3 σ τ n 3 ϑ 3 ( j c π , e 2 σ 2 π 2 ) .
In Figure 8, the asymptotic Equation (42) fits well with the exact result, and the first detection probability decays monotonically with the power-law 3 . The prefactor is related to the width of the wave packet σ and the distance between the center of the wave packet j c and the detection site j d . When the width is larger than the lattice constant, which in this paper is 1, the probability decays monotonically with the power-law 3 in the absence of oscillations present for narrower initial states.

5. Conclusions and Discussions

We have investigated the first detection problems of a continuous-time quantum walk on an infinite (im)pure lattice under the repeated measurement. The impurity in the lattice is described as one of the diagonal elements of the Hamiltonian. We show the relation between the decay of the first detection probability and the width of the initial Gaussian wave. We found that the distribution of the first detection probability decays while oscillating with the power-law 3 for the initial narrow wave, i.e., σ < 1 . Conversely, the distribution decays monotonically, as Schrödinger described when he considered the first passage time of the Brownian motion. In the limit of large n, as Equation (42) shows, the probability is sensitive to the distance between the detection site j d and the center of the initial wave packet j c . For an impure lattice, the walker tunnels through the barrier with different transmission probabilities which depend on the components of the momentum of the initial wave. For large σ , i.e., corresponding to a single ingredient in momentum space, the probability keeps decaying monotonically when the walker goes back and forth between the barrier and the detection site. By comparing the incident time t i n between the barrier case and the pure system, we found that the incident time in the impure system is smaller than the pure one, and is strongly sensitive to the width of the wave. In other words, the evolution of the walker speeds up. Furthermore, the total probability of detection P t o t is always less than unity, and there exits an optimal value in the vicinity of the critical sampling time τ = m τ / 2 . However, the critical point is transformed by the presence of the barrier and the period is destroyed.
By tuning the width of the initial wave and the distance between the detector and the center of the wave, it is possible to succeed in detecting the particle more efficiently. Defects and the nature of the materials can accelerate successful detection or reduce the probability of successful detection. We hope that our results for the stroboscopically probed system can help in optimizing the read-out of the state of a quantum computer.

Author Contributions

Conceptualization, Z.N. and Y.Z.; investigation, Z.N.; writing—original draft preparation, Z.N.; writing—review and editing, Z.N. and Y.Z.; supervision, Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (Grant Nos. 12234013 and 12174221).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author. The data are not publicly available due to privacy.

Acknowledgments

Z.N. was supported by a Sandwich fellowship in Israel. We warmly thank Eli Barkai, David A. Kessler, and Quancheng Liu for their hospitality and fruitful discussions at Bar Ilan University.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
QWQuantum Walk
CTQWContinuous-Time Quantum Walk
DTQWDiscrete-Time Quantum Walk

Appendix A

Appendix A.1

In this appendix, we present the Green Function for a tight-binding Hamiltonian with a single impurity. Here, the Hamiltonian of the impurity system is
H = H 0 + H 1 = j ( | j j + 1 | + | j + 1 j | ) + ϵ | 0 0 | ,
while the eigenvalues and eigenfuctions of H 0 have been exhibited in the main text,
E k = 2 cos k , | ψ k = 1 2 π j e i k j | j .
The Green function corresponding to the Schrödinger equation satisfies
E H ( l ) G ( l , l ; E ) = δ ( l l ) ,
and the solution of the aforesaid equation is
G = G 0 + G 0 T G 0 = G 0 + G 0 | 0 ϵ 1 ϵ G 0 ( 0 , 0 ) 0 | G 0 ,
where G 0 ( 0 , 0 ) = 0 | G 0 | 0 , G 0 is the Green function of the non-perturbed Hamiltonian. The poles of G correspond to the discrete eigenvalues (bound state) of H. In the present case, the eigenvalue of the bound state is provided by
G 0 ( 0 , 0 , E b ) = 1 ϵ ,
and the bound state is provided by
| ψ b = j b j | j ; b j = G 0 ( j , 0 , E b ) G 0 ( 0 , 0 , E b ) ,
where the prime denotes differentiation with respect to E and the Green function is as follows:
G 0 ( l , m , z ) = z 2 + z 2 4 1 | l m | z 2 4 .
The eigenstates in the energy band are scattering states ( | ψ s ) , and can be written as
| ψ s = | ψ k + G 0 + ( E k ) T + ( E k ) | ψ k .
Therefore, the j-site amplitude of ψ s is
j | ψ s = j | ψ k + j | G 0 + ( E k ) | 0 ϵ 0 | ψ k 1 ϵ G 0 + ( 0 , 0 , E k ) ,
where the matrix elements are
l | G 0 + ( E k ) | m = i 4 E k 2 E k 2 + i 1 E k 2 4 | l m | .
With the eigenfunctions from Equations (A6) and (A9), we can obtain the propagator j 2 U ( n τ ) j 1 as in the main text.

References

  1. Hughes, B.D. Random Walks and Random Environments; Oxford University Press: Oxford, UK, 1995. [Google Scholar]
  2. Shor, P.W. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 1997, 26, 1484–1509. [Google Scholar] [CrossRef]
  3. Grover, L.K. Quantum Mechanics Helps in Searching for a Needle in a Haystack. Phys. Rev. Lett. 1997, 79, 325–328. [Google Scholar] [CrossRef]
  4. Shenvi, N.; Kempe, J.; Whaley, K.B. Quantum random-walk search algorithm. Phys. Rev. A 2003, 67, 052307. [Google Scholar] [CrossRef]
  5. Herrman, R.; Humble, T.S. Continuous-time quantum walks on dynamic graphs. Phys. Rev. A 2019, 100, 012306. [Google Scholar] [CrossRef]
  6. Childs, A.M. Universal Computation by Quantum Walk. Phys. Rev. Lett. 2009, 102, 180501. [Google Scholar] [CrossRef]
  7. Mülken, O.; Blumen, A. Continuous-time quantum walks: Models for coherent transport on complex networks. Phys. Rep. 2011, 502, 37–87. [Google Scholar] [CrossRef]
  8. Weiss, G.H. Aspects and Applications of the Random Walk; North-Holland: Amsterdam, The Netherlands, 1994. [Google Scholar]
  9. Portugal, R. Quantum Walks and Search Algorithms; Springer: New York, NY, USA, 2013. [Google Scholar]
  10. Wang, J.; Manouchehri, K. Physical Implementation of Quantum Walks; Springer: Berlin/Heidelberg, Germany, 2014. [Google Scholar]
  11. Aharonov, Y.; Davidovich, L.; Zagury, N. Quantum random walks. Phys. Rev. A 1993, 48, 1687–1690. [Google Scholar] [CrossRef]
  12. Farhi, E.; Gutmann, S. Quantum computation and decision trees. Phys. Rev. A 1998, 58, 915–928. [Google Scholar] [CrossRef]
  13. Childs, A.M.; Farhi, E.; Gutmann, S. An Example of the Difference Between Quantum and Classical Random Walks. Quantum Inf. Process. 2002, 1, 35. [Google Scholar] [CrossRef]
  14. Childs, A.M.; Cleve, R.; Deotto, E.; Farhi, E.; Gutmann, S.; Spielman, D.A. Exponential Algorithmic Speedup by a Quantum Walk. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, 9–11 June 2003; pp. 59–68. [Google Scholar] [CrossRef]
  15. Watrous, J. Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. J. Comput. Syst. Sci. 2001, 62, 376–391. [Google Scholar] [CrossRef]
  16. Brun, T.A.; Carteret, H.A.; Ambainis, A. Quantum to Classical Transition for Random Walks. Phys. Rev. Lett. 2003, 91, 130602. [Google Scholar] [CrossRef]
  17. Brun, T.A.; Carteret, H.A.; Ambainis, A. Quantum walks driven by many coins. Phys. Rev. A 2003, 67, 052317. [Google Scholar] [CrossRef]
  18. Strauch, F.W. Connecting the discrete- and continuous-time quantum walks. Phys. Rev. A 2006, 74, 030301. [Google Scholar] [CrossRef]
  19. Perets, H.B.; Lahini, Y.; Pozzi, F.; Sorel, M.; Morandotti, R.; Silberberg, Y. Realization of Quantum Walks with Negligible Decoherence in Waveguide Lattices. Phys. Rev. Lett. 2008, 100, 170506. [Google Scholar] [CrossRef] [PubMed]
  20. Ryan, C.A.; Laforest, M.; Boileau, J.C.; Laflamme, R. Experimental implementation of a discrete-time quantum random walk on an NMR quantum-information processor. Phys. Rev. A 2005, 72, 062317. [Google Scholar] [CrossRef]
  21. Karski, M.; Förster, L.; Choi, J.M.; Steffen, A.; Alt, W.; Meschede, D.; Widera, A. Quantum Walk in Position Space with Single Optically Trapped Atoms. Science 2009, 325, 174–177. [Google Scholar] [CrossRef]
  22. Redner, S. A Guide to First-Passage Processes; Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
  23. Varbanov, M.; Krovi, H.; Brun, T.A. Hitting time for the continuous quantum walk. Phys. Rev. A 2008, 78, 022324. [Google Scholar] [CrossRef]
  24. Dhar, S.; Dasgupta, S.; Dhar, A.; Sen, D. Detection of a quantum particle on a lattice under repeated projective measurements. Phys. Rev. A 2015, 91, 062115. [Google Scholar] [CrossRef]
  25. Krovi, H.; Brun, T.A. Hitting time for quantum walks on the hypercube. Phys. Rev. A 2006, 73, 032341. [Google Scholar] [CrossRef]
  26. Krovi, H.; Brun, T.A. Quantum walks with infinite hitting times. Phys. Rev. A 2006, 74, 042334. [Google Scholar] [CrossRef]
  27. Friedman, H.; Kessler, D.A.; Barkai, E. Quantum walks: The first detected passage time problem. Phys. Rev. E 2017, 95, 032141. [Google Scholar] [CrossRef] [PubMed]
  28. Pal, A.; Reuveni, S. First Passage under Restart. Phys. Rev. Lett. 2017, 118, 030603. [Google Scholar] [CrossRef] [PubMed]
  29. Grünbaum, F.A.; Velázquez, L.; Werner, A. Recurrence for Discrete Time Unitary Evolutions. Commun. Math. Phys. 2013, 320, 513–569. [Google Scholar] [CrossRef]
  30. Yin, R.; Ziegler, K.; Thiel, F.; Barkai, E. Large fluctuations of the first detected quantum return time. Phys. Rev. Res. 2019, 1, 033086. [Google Scholar] [CrossRef]
  31. Liu, Q.; Yin, R.; Ziegler, K.; Barkai, E. Quantum walks: The mean first detected transition time. Phys. Rev. Res. 2020, 2, 033113. [Google Scholar] [CrossRef]
  32. Thiel, F.; Barkai, E.; Kessler, D.A. First Detected Arrival of a Quantum Walker on an Infinite Line. Phys. Rev. Lett. 2018, 120, 040502. [Google Scholar] [CrossRef] [PubMed]
  33. Liu, Q.; Ziegler, K.; Kessler, D.A.; Barkai, E. Driving quantum systems with periodic conditional measurements. Phys. Rev. Res. 2022, 4, 023129. [Google Scholar] [CrossRef]
  34. Bénichou, O.; Voituriez, R. From first-passage times of random walks in confinement to geometry-controlled kinetics. Phys. Rep. 2014, 539, 225–284. [Google Scholar] [CrossRef]
  35. Cohen-Tannoudji, C.; Diu, B.; Faloë, F. Quantum Mechanics; Wiley: New York, NY, USA, 1997. [Google Scholar]
  36. Arfken, G.B.; Weber, H.J.; Harris, F.E. Mathematical Methods for Physicists; Academic Press: New York, NY, USA, 2013. [Google Scholar]
  37. Zheng, Y.; Brown, F.L.H. Single-Molecule Photon Counting Statistics via Generalized Optical Bloch Equations. Phys. Rev. Lett. 2003, 90, 238305. [Google Scholar] [CrossRef]
  38. Brown, F.L.H. Generating Function Methods in Single-Molecule Spectroscopy. Acc. Chem. Res. 2006, 39, 363–373. [Google Scholar] [CrossRef]
  39. Feynman, R.P.; Leighton, R.B.; Sands, M. The Feynman Lectures on Physics; Basic Books: New York, NY, USA, 1965. [Google Scholar]
  40. Cardano, F.; Massa, F.; Qassim, H.; Karimi, E.; Slussarenko, S.; Paparo, D.; de Lisio, C.; Sciarrino, F.; Santamato, E.; Boyd, R.W.; et al. Quantum walks and wavepacket dynamics on a lattice with twisted photons. Sci. Adv. 2015, 1, e1500087. [Google Scholar] [CrossRef] [PubMed]
  41. Economou, E.N. Green’s Functions in Quantum Physics; Springer: Berlin, Germany, 2005. [Google Scholar]
  42. Elliott, T.J.; Vedral, V. Quantum quasi-Zeno dynamics: Transitions mediated by frequent projective measurements near the Zeno regime. Phys. Rev. A 2016, 94, 012118. [Google Scholar] [CrossRef]
  43. Thiel, F.; Kessler, D.A. Non-Hermitian and Zeno limit of quantum systems under rapid measurements. Phys. Rev. A 2020, 102, 012218. [Google Scholar] [CrossRef]
  44. Davies, P.C.W. Quantum tunneling time. Am. J. Phys. 2005, 73, 23–27. [Google Scholar] [CrossRef]
  45. Kaname, M.; Leo, M.; Osamu, O.; Etsuo, S. Resonant-tunneling in discrete-time quantum walk. Quantum Stud. Math. Found. 2019, 6, 35–44. [Google Scholar] [CrossRef]
  46. Koster, G.F.; Slater, J.C. Wave Functions for Impurity Levels. Phys. Rev. 1954, 95, 1167–1176. [Google Scholar] [CrossRef]
  47. Landauer, R. Barrier traversal time. Nature 1989, 341, 567–568. [Google Scholar] [CrossRef]
  48. Hauge, E.H.; Støvneng, J.A. Tunneling times: A critical review. Rev. Mod. Phys. 1989, 61, 917–936. [Google Scholar] [CrossRef]
  49. Wigner, E.P. Lower Limit for the Energy Derivative of the Scattering Phase Shift. Phys. Rev. 1955, 98, 145–147. [Google Scholar] [CrossRef]
  50. Bohm, D. Quantum Theory; Prentice-Hall: New York, NY, USA, 1951. [Google Scholar]
  51. Hauge, E.H.; Falck, J.P.; Fjeldly, T.A. Transmission and reflection times for scattering of wave packets off tunneling barriers. Phys. Rev. B 1987, 36, 4203–4214. [Google Scholar] [CrossRef]
  52. Smith, F.T. Lifetime Matrix in Collision Theory. Phys. Rev. 1960, 118, 349–356. [Google Scholar] [CrossRef]
  53. Büttiker, M. Larmor precession and the traversal time for tunneling. Phys. Rev. B 1983, 27, 6178–6188. [Google Scholar] [CrossRef]
  54. Baz’, A.I. Life Time of Intermediate States. Yad. Fiz. 1966, 5, 229. [Google Scholar]
  55. Schrödinger, E. Zur Theorie Der Fall-und Steigversuche an Teilchen Mit Brownscher Bewegung. Physik. Z. 1915, 16, 289. [Google Scholar]
  56. Mathematica; Wolfram Research, Inc.: Champaign, IL, USA, 2019.
Figure 1. (a) The stroboscopic detection protocol. The particle propagates freely between two adjacent measurements, and the detection time interval is τ . (b) The lattice system for the quantum walk. The initial condition | ψ i n is a wave packet, and we measure whether the particles arrive at the destination by a projective operator D ^ = ψ d e t ψ d e t . The dashed line denotes a barrier located at a lattice. The cases with and without a barrier are discussed in Section 2.2 and Section 2.3, respectively.
Figure 1. (a) The stroboscopic detection protocol. The particle propagates freely between two adjacent measurements, and the detection time interval is τ . (b) The lattice system for the quantum walk. The initial condition | ψ i n is a wave packet, and we measure whether the particles arrive at the destination by a projective operator D ^ = ψ d e t ψ d e t . The dashed line denotes a barrier located at a lattice. The cases with and without a barrier are discussed in Section 2.2 and Section 2.3, respectively.
Entropy 25 01231 g001
Figure 2. The probabilities of the first detection for different initial conditions (log−log). The initial condition is a Gaussian wave packet which centered at j c = 10 , and the detection state is | 0 . The sampling time is τ = 1 and the momentum k 0 = 0 . The circles, squares, and crosses numerically obtained by Equation (23) represent the results of the width of the Gaussian wave packet σ = 1 / 3 , 1 , 3 , respectively. Generally, F n n 3 with superimposed oscillations, the latter vanish when the initial width of the wave packet σ is large.
Figure 2. The probabilities of the first detection for different initial conditions (log−log). The initial condition is a Gaussian wave packet which centered at j c = 10 , and the detection state is | 0 . The sampling time is τ = 1 and the momentum k 0 = 0 . The circles, squares, and crosses numerically obtained by Equation (23) represent the results of the width of the Gaussian wave packet σ = 1 / 3 , 1 , 3 , respectively. Generally, F n n 3 with superimposed oscillations, the latter vanish when the initial width of the wave packet σ is large.
Entropy 25 01231 g002
Figure 3. The plot of the total detection probability. The horizontal ordinate τ is the sampling time and the vertical coordinate represents the total probability given by Equation (11). For small τ , we have the Zeno limit, namely, the particle cannot be detected at all. The non-analytical behaviour at the sampling time provided by Equation (26) is visible with a finite width of the packet.
Figure 3. The plot of the total detection probability. The horizontal ordinate τ is the sampling time and the vertical coordinate represents the total probability given by Equation (11). For small τ , we have the Zeno limit, namely, the particle cannot be detected at all. The non-analytical behaviour at the sampling time provided by Equation (26) is visible with a finite width of the packet.
Entropy 25 01231 g003
Figure 4. The total detection probability for different widths of the wave packet. The initial condition is a Gaussian wave packet centered at j c = 10 . The detection site is located at j d = 20 , and the magnitude of the barrier is ϵ = 2 .
Figure 4. The total detection probability for different widths of the wave packet. The initial condition is a Gaussian wave packet centered at j c = 10 . The detection site is located at j d = 20 , and the magnitude of the barrier is ϵ = 2 .
Entropy 25 01231 g004
Figure 5. The probability distribution F n of first detection in the nth attempt for the different widths of the wave packet (log−log). The initial condition is a Gaussian wave packet centered at j c = 100 , the wave vector is k 0 = π / 8 , and the sampling time is τ = 0.1 . We measured the particles at j d = 100 , and the magnitude of the barrier is ϵ = 2 .
Figure 5. The probability distribution F n of first detection in the nth attempt for the different widths of the wave packet (log−log). The initial condition is a Gaussian wave packet centered at j c = 100 , the wave vector is k 0 = π / 8 , and the sampling time is τ = 0.1 . We measured the particles at j d = 100 , and the magnitude of the barrier is ϵ = 2 .
Entropy 25 01231 g005
Figure 6. The tunneling time of a quantum walk as a function of k 0 . The wide Gaussian wave packet ( σ = 20 ) is centered at j c = 100 , the magnitudes of the barrier are ϵ = 3 , corresponding to the orange triangles, and ϵ = 5 , corresponding to the purple diamonds, and the sampling time τ = 0.1 . We measure the walker at j d = 100 . The tunneling time is provided by Equation (28).
Figure 6. The tunneling time of a quantum walk as a function of k 0 . The wide Gaussian wave packet ( σ = 20 ) is centered at j c = 100 , the magnitudes of the barrier are ϵ = 3 , corresponding to the orange triangles, and ϵ = 5 , corresponding to the purple diamonds, and the sampling time τ = 0.1 . We measure the walker at j d = 100 . The tunneling time is provided by Equation (28).
Entropy 25 01231 g006
Figure 7. The tunneling time of a quantum walk as a function of the number of the defects, denoted by (log−log). The parameters of the simulation were as follows: the spread of the initial wave packet was 10, the distance between the detector and the starting point was 200, the projective measurement was operated at j d = 100 , and the magnitude of the defects was 3.
Figure 7. The tunneling time of a quantum walk as a function of the number of the defects, denoted by (log−log). The parameters of the simulation were as follows: the spread of the initial wave packet was 10, the distance between the detector and the starting point was 200, the projective measurement was operated at j d = 100 , and the magnitude of the defects was 3.
Entropy 25 01231 g007
Figure 8. The plot of the asymptotic result of Equation (42) (log−log). The width of the Gaussian wave is σ = 1 , the detection state | ψ d e t = | 90 , the initial state is centred at j c = 10 , and the sampling time τ = 0.2 .
Figure 8. The plot of the asymptotic result of Equation (42) (log−log). The width of the Gaussian wave is σ = 1 , the detection state | ψ d e t = | 90 , the initial state is centred at j c = 10 , and the sampling time τ = 0.2 .
Entropy 25 01231 g008
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ni, Z.; Zheng, Y. First Detection and Tunneling Time of a Quantum Walk. Entropy 2023, 25, 1231. https://doi.org/10.3390/e25081231

AMA Style

Ni Z, Zheng Y. First Detection and Tunneling Time of a Quantum Walk. Entropy. 2023; 25(8):1231. https://doi.org/10.3390/e25081231

Chicago/Turabian Style

Ni, Zhenbo, and Yujun Zheng. 2023. "First Detection and Tunneling Time of a Quantum Walk" Entropy 25, no. 8: 1231. https://doi.org/10.3390/e25081231

APA Style

Ni, Z., & Zheng, Y. (2023). First Detection and Tunneling Time of a Quantum Walk. Entropy, 25(8), 1231. https://doi.org/10.3390/e25081231

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop