Running Measurement Protocol for the Quantum First-detection problem
Dror Meidan, Eli Barkai, David A. Kessler

TL;DR
This paper studies how a moving quantum detector affects the detection probabilities of a quantum walker, revealing a phase transition and modifications to the Zeno effect with implications for quantum search strategies.
Contribution
It introduces a novel approach to quantum first-detection problems by analyzing a moving detector, mapping it to a stationary case, and uncovering a dynamical phase transition at a critical sampling time.
Findings
Detection probability exhibits a phase transition at critical sampling time τ.
Power-law decay with exponent 10/3 at the critical τ.
Moving detector significantly alters the Zeno effect in quantum walks.
Abstract
The problem of the detection statistics of a quantum walker has received increasing interest, connected as it is to the problem of quantum search. We investigate the effect of employing a moving detector, using a projective measurement approach with fixed sampling time , with the detector moving right before every detection attempt. For a tight-binding quantum walk on the line, the moving detector allows one to target a specific range of group velocities of the walker, qualitatively modifying the behavior of the quantum first-detection probabilities. We map the problem to that of a stationary detector with a modified unitary evolution operator and use established methods for the solution of that problem to study the first-detection statistics for a moving detector on a finite ring and on an infinite 1D lattice. On the line, the system exhibits a dynamical phase transition at a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Running Measurement Protocol for the Quantum first-detection problem
Dror Meidan1,2, Eli Barkai1,2 and David A. Kessler1
1Department of Physics, Bar-Ilan University, Ramat-Gan 52900, Israel
2Department of Physics, Institute of Nanotechnology and Advanced Materials, Bar-Ilan University, Ramat-Gan 52900, Israel
Abstract
The problem of the detection statistics of a quantum walker has received increasing interest, connected as it is with to the problem of quantum search. We investigate the effect of employing a moving detector, using a projective measurement approach with fixed sampling time , with the detector moving right before every detection attempt. For a tight-binding quantum walk on the line, the moving detector allows one to target a specific range of group velocities of the walker, qualitatively modifying the behavior of the quantum first-detection probabilities. We map the problem to that of a stationary detector with a modified unitary evolution operator and use established methods for the solution of that problem to study the first-detection statistics for a moving detector on a finite ring and on an infinite 1D lattice. On the line, the system exhibits a dynamical phase transition at a critical value of , from a state where detection decreases exponentially in time and the total detection is very small, to a state with power-law decay and a significantly higher probability to detect the particle. The exponent describing the power-law decay of the detection probability at this critical is , as opposed to for every larger . In addition, the moving detector strongly modifies the Zeno effect.
††: \jpa
Keywords: quantum walk, first passage, renewal equation
Special Issue on New Trends in First-Passage Methods and Applications in the Life Sciences and Engineering
1 Introduction
The problem of detecting a quantum walker has been attracting increasing interest, as many search and decision algorithms can be modeled as a continuous-time quantum walk [1], as established by Farhi, et al. [2]. (For a general review of quantum walks, see Refs. [3, 4]). Recent experimental advances have made it possible to measure a quantum walk at the single particle level [5, 6, 7]. In addition, the theoretical side of the quantum first-detection problem for both continuous and discrete time walks, and more generally, any unitary evolution of a quantum system, has been the focus of study as it deals with the basic issue of when a given target state will first be detected [8, 9, 10, 11, 12]. In general, the system is defined as a graph and the Hamiltonian includes both hopping and site energy terms. The wave function, initially localized at node , is probed stroboscopically at a node with period . This problem, reminiscent of the well-known classical first passage time problem, shares some of its aspects but also exhibits striking qualitative differences.
In the quantum problem, the sampling time , determined in principle by the experimenter, is crucial. Too small will lead to the Zeno effect, which implies the particle is not detected if the initial and detected state are orthogonal, while too large will make the whole approach impractical. Hence there exists an optimal , which can be chosen either to maximize the total detection probability or the mean time to detection, conditioned on successful detection [10].
As quantum particles move ballistically, and given the fact that the measurement is local, in an infinite system the particle will typically leave the stationary detector far behind, leading to a rapid falloff of the detection probability in time, compared to the classical case. This ballistic motion in the absence of any measurement is demonstrated in Fig. 1, for the case of a nearest-neighbor tight-binding Hamiltonian on the infinite line,
[TABLE]
where the spatial probability distribution, , of a state initially localized at the origin is seen to exhibit two symmetrically located peaks, which move outward at constant velocity, the maximal group velocity of the state. The probabilities in the interior region decays in time as , with characteristic quantum oscillations, and decays exponentially in space beyond the peaks. Actually, this is an upper bound; the first-detection probability falls off faster than this, as , due to the cumulative effects of unsuccessful measurements [10]. It is thus interesting to examine the possibility of moving the detector after every measurement attempt, so that the detection site follows the walker along the graph. This Running Measurement Protocol allows one to maximize the total detection probability by adjusting the detector velocity (via the measurement period).
The questions to be tackled are as follows: Given and the tight-binding Hamiltonian on a ring or infinite line, what are the properties of the first-detection probability distribution at attempt , which we denote ? What is the asymptotic behavior of for large ? In particular, since in the tight-binding model, the velocity of the walker is bounded, how does the asymptotic behavior change where the velocity of the detector is greater, slower or exactly at this bound? In addition, what is the behavior of when the detector traverses classically forbidden and allowed regions of the evolving particle? As demonstrated in previous studies, the particle is not always detected [13, 14, 8, 10], so what is the optimal sampling rate for which the total detection is maximized? How is the Zeno effect, discussed in Ref. [10], affected by the moving of the detector?
2 The Running Measurement Protocol
The detection protocol with a moving detector we study here (which we call the Running Measurement Protocol (RMP)), is a straightforward modification of the previous protocol we and others have studied for a stationary detector (which for convenience we refer to as the Stationary Measurement Protocol (SMP)). As before, the system is represented by the Hilbert space . The wave function of the particle is initially prepared in the state . The particle dynamics is governed by the Schrödinger equation with a time-independent Hermitian Hamiltonian , and a stroboscopic detection measurement is applied to the current state of the system with time period , checking if the particle in the state . The two possible answers are ’yes’ if the particle is detected in the probed location or ’no’ otherwise. The experiment is terminated when we get a positive answer. The first attempt which yields a positive answer is denoted by . The statistics of this first-detection attempt , and the elapsed time are the focus of our interest. The new feature in our RMP is that immediately prior to performing the measurement, we move the detector right by one lattice spacing. In this paper we will discuss only systems with translation symmetry, in particular focussing on the finite ring and the infinite line.
Mathematically, the strong stroboscopic detection (also known as von Neumann detection) is a projection onto , the current detection site, and so the measurement operator is represented as . An unsuccessful detection causes a collapse of the particle’s wave function, equivalent to acting with the operator , and subsequent renormalization of the wave function. This is the collapse postulate [15]. In addition, the unitary propagation operator of the quantum walker during the inter-measurement interval is .
The procedure of unitary evolution followed by strong measurement is repeated until the first detection is accomplished. This first-detection protocol combines the collapse of the wave function with the unitary dynamics generated by the Hamiltonian.
As shown in Ref. [8, 10], the first-detection probability at attempt , , for the SMP is the square norm of the detection amplitude, , defined by:
[TABLE]
so
[TABLE]
For our RMP protocol, this generalizes immediately to
[TABLE]
To talk about the moving detector, we define the shift operator , where:
[TABLE]
Then, in our problem,
[TABLE]
An in this paper we assume that the Hamiltonian is translation invariant, we have . Then,
[TABLE]
This equation leads to an equivalence between the RMP and an effective SMP with a modified unitary operator,
[TABLE]
consisting of the standard propagator followed by a shift leftward. It should be noted that the SMP with this propagator was previously considered by Sinkovicz, et al. [16], and here we see that the RMP naturally gives rise to this exact system. The equivalence is generally applicable to systems with translation symmetry (such as our hopping Hamiltonian, Eq. (1), on the infinite line or a finite ring) and says that moving the detector one site right is equivalent to moving the particle one site left. This argument is shown for a ring with three sites in Fig. 2.
For the RMP, we define the “return” problem as the case where the initial site of the detector and particle are equal (so that the first measurement occurs one site to the right of the initial site). Likewise, the “arrival problem” describes the case when the detector and the particle start at different sites. Note that the first measurement takes place at time , while other treatments [13, 14] take the first measurement to be at time . This choice of protocol obviously yields very different physics when we consider the “return” [17] case.
Not all sequences of measurements lead to an eventual detection. This phenomenon is not unique for quantum systems; for example, it also occurs for the classical random walk in three or higher dimensions. However, in the quantum world we may find non-detected dark states also in finite systems like a ring, unlike the classical counterpart [13, 14, 8, 10]. We define the total detection probability:
[TABLE]
For numerical computations of , given our mapping, it is convenient to use the quantum renewal equation [10]:
[TABLE]
This equation connects the first-detection amplitudes with the free evolution of the wave function unperturbed by any measurement. It is a natural analogue of the well-known classical renewal equation [18]. The first term is the direct (i.e. absent of measurement) evolution from initial to detection state. The second term accounts for the effects of previous unsuccessful detection measurements.
The renewal equation is also the starting point for analysis of the properties of , as it can be solved for [10] using the generating function approach of classical random walk theory. The transform or discrete Laplace transform of is by definition:
[TABLE]
(here we define , since the first-detection attempt happens at ), and can be shown [10] to be given by
[TABLE]
where
[TABLE]
The detection amplitude can then be recovered via a contour integral:
[TABLE]
Note that is by definition analytic inside the unit disk, so the integration over the circle contour with radius only contains the one pole at the origin. In the “return” problem, we take , and this equation simplifies to [17]
[TABLE]
In the “arrival” problem (i.e. ), we have, assuming that and are orthogonal [10]:
[TABLE]
Finally, we define some useful notation:
[TABLE]
and
[TABLE]
The motion of the detector is thus seen to be equivalent to a stationary detector with a modified dynamics. In particular, the new dispersion relation depends on , which gives rise to new behaviors. In the next two sections, we will encounter these new behaviors as we analyze the RMP on two simple graphs, the finite ring and the infinite line.
3 The Ring
In this section, we discuss the RMP on a ring graph with sites, with the tight-binding Hamiltonian
[TABLE]
and cyclic boundary conditions, . The first-detection problem for this system with the SMP was discussed in Ref. [10]. The eigenvalues and eigenvectors of are: and defined with , . As noted above, the shift operator and the Hamiltonian commute. The Hamiltonian is constructed from the shift operator and its conjugate, , so it has the same diagonal basis, namely the Fourier modes. The form of the shift operator in Fourier space is
[TABLE]
The eigenvalues of the propagator , are, by unitarity, pure phases. We call these phases the dynamical phases of the system, (labelled by Fourier number , and denoted by ). One of the main properties of these dynamical phases is that they determine the exceptional values for which the moments of the first-detection time are discontinuous [17, 10]. The dynamic phases of the mapped RMP system on the ring graph are:
[TABLE]
As shown by Grünbaum, et al. [17], the most striking features of the “return” problem in the SMP for a system with a discrete spectrum are that: 1) ; and 2) is equal to the number of unique dynamical phases (with non-zero overlap of the corresponding eigenstate with the detected state). Given our mapping, these results carry over immediately to the RMP case. In particular, for the ring of length , the number of unique dynamical phases is , as opposed to the SMP where the number is roughly half this, namely for even, and for odd [10]. This is due to the breaking of reflection symmetry in the modified propagator in the equivalent SMP problem [16]. At the exceptional values of [10], for which accidental degeneracies exist, the number of unique dynamical phases is reduced, and consequently, so is , for both the SMP and RMP.
These results for are exemplified in the right panel of Fig. 3, where we see that are 3 and 4 for the SMP and RMP cases respectively, barring the exceptional . We see that, in this case, the RMP performs worse than the SMP in the sense that the average return time is increased, and this is because in the RMP we break the reflection symmetry and so increase the number of unique phases, thus increasing , according to the general theorem of Grünbaum, et al [17]. We will soon show that the return problem is not typical in this regard.
The difference in the dependence of in the return problem is even more striking. This is especially true at small , where the stationary detector protocol is dominated by the Zeno effect. There, the walker is almost surely detected on the first attempt, since it has not had time to move away from its initial position in the small time interval . If, however, the walker was not detected on this first attempt, the chance to detect it on the subsequent attempt is very small, of order , since the first failed measurement attempt has zeroed out the probability to be at the initial site and there is insufficient time to reconstitute its presence there. This persists for subsequent measurements, and it takes of order attempts to accumulate the missing total detection probability, as decays exponentially with at a rate proportional to . For the RMP, however, the picture is very different. The fact that the detector moves makes the zeroing out of the probability at the detection site much less important. Thus, the first-detection is attempted one site distant from the initial site, so the probability of success is small, of order . This is the case for subsequent attempts as well, until the detector returns to the original position of the particle on the ’th attempt. Then the particle is almost surely detected. Subsequently, the detection probability drops by an additional power of after each series of measurements. Thus, the variance of for small is dramatically reduced in the RMP, as seen in Fig. 4, despite the small increase in , seen in Fig. 3 for the “return” problem on a ring graph with sites. We see the increase from 3 to 4 for the average for all nonexceptional values of . Secondly, the sets of exceptional ’s are different in the two cases, due to the difference in the dynamical phases. In the first panel, we show the comparison of for the two protocols, showing the peak at and the very slow decay for for the stationary detector, compared to the peak at and the very rapid subsequent decay for RMP. In these and all subsequent figures, we have taken .
The major difference in the arrival problem in the two problems is in . For the SMP, is typically less than unity for highly symmetrical graphs like the ring (this point is analysed in more detail in [19]), whereas for the RMP for nonexceptional ’s, it is unity, due to the nondegeneracy of the dynamical phases and in this sense, the RMP performs better in this case. This is seen in Fig. 5, where we simulate the case of for the SMP and RMP.
4 Infinite Line
For the case of the moving detector on the infinite line with Hamiltonian:
[TABLE]
Again we go to the moving frame using , and the dynamical phase, which plays the role of in the SMP is
[TABLE]
To obtain the last equation we took Eq. (21) and went to the continuum limit with , so runs continuously in the range . The behavior of changes at . For , corresponding to detector motion with velocity , which is faster than the maximum group velocity of the particle, , has no critical points satisfying , on the real interval . On the other hand, for , slow detector motion, there are two real critical points, which approach the values of [math] and for , i.e., with no detector motion. The connection between and the dynamical phase relation (which for SMP is just the dispersion relation) in the return problem was discussed in Ref. [12]. As we shall see, the conversion from to yields qualitatively different results in the fast and slow detector cases. We use the same contour integral procedure used for the stationary detector in [11].
4.1 Return problem, fast-moving detector case
We first treat the fast detector case, , starting on and measuring there. We need the singularity structure of , where , which is determined by the large- behavior of . For the moving detector, we have
[TABLE]
as opposed to the same expression with for the stationary detector.
We can then use the approximation from [20] (Eq. 8.452, p. 921): when and the index of the Bessel function is greater than its argument,
[TABLE]
In our case , so , and
[TABLE]
where and . For , diverges logarithmically as , , and decreases to 0 as . Near the singularity of , the large- terms dominate, and we can calculate :
[TABLE]
where is the polylogarithm. The polylogarithm has a branch-cut in the complex plane along the positive real axis for , and near the branch-cut [21]:
[TABLE]
In the fast-moving detector case, the branch-cut is along the part of the positive imaginary axis where . Parameterizing the branch-cut as , we have:
[TABLE]
Substituting this into Eq. (15) and then using the small expansion, we get:
[TABLE]
Using Eq. (14), we can now recover via a contour integral , along a sufficiently small circle surrounding the origin. We can then deform the contour to infinity, leaving only the branch-cut contribution. The trajectory is sketched in Fig. 6(a). Along the branch-cut, we change variables to as above. For large , the integral is of Laplace type, dominated by the region close to the singularity, and the discontinuity of along the branch-cut, denoted , is approximately:
[TABLE]
Doing the contour integral, we get
[TABLE]
The final result is:
[TABLE]
and so
[TABLE]
The analytic result matches the simulation results, as we see in Fig. 6(c). While for the stationary detector, the power law was found previously, double the classical exponent from random walk theory [10], here the decay is exponential in , modulated by the same exponent .
In addition, because is monotonically decreasing in the interval and , the exponential decay is stronger for smaller , and for , attains its fastest decay rate, . In this “Zeno” limit, is dominated by , and . In physical terms, when is small, the detector outruns the particle and so the probability to see the particle decays rapidly, an effect which gets stronger as the detector velocity increases.
4.2 Return problem, slow detector case
In this subsection, we treat the slow detector case, . The calculation in principle proceeds as above, however here the argument of the Bessel function is greater than the index. The asymptotics of the Bessel function in this case are [20] (Eq. 8.453,p. 922)
[TABLE]
Here, so , and the final approximation for large of is:
[TABLE]
where and . For , diverges linearly as and decreases to 0 as . Near the singularity of , again the large terms dominate, and so:
[TABLE]
In the slow-moving detector case, because of the phases in the arguments of the polylogarithm there are two line branch-cuts, at angles around the positive imaginary axis, with . We parameterize the branch-cuts by , where , and use the behavior of the polylogarithm near its singularity:
[TABLE]
Substituting this into and expanding for small , becomes:
[TABLE]
Again, we can recover via a contour integral deforming the contour to infinity, leaving only the two branch-cut contributions. The trajectory in Fig. 6(b). Along the branch-cuts, we change variables to y as above. For large , the integrals are again of Laplace type, dominated by the region close to the singularities, and the discontinuity of along the branch-cuts is approximately:
[TABLE]
Doing the contour integral, we get
[TABLE]
The final result is:
[TABLE]
and so:
[TABLE]
This analytic result matches the simulation results, as we see in Fig. 6(d). In addition, because is monotonically increasing for , the oscillation frequency of increases with . The frequency has a supremum because the difference of phase which gave rise to is limited by . This occurs at , where . In addition, we see the effect of the coinciding of the two branch-cuts, causing a change of behavior of from monotonic increasing to oscillations. It is obtained in the RMP return and (as we shall see) arrival problems and also in the arrival problem on the infinite line with the SMP [11].
We note that, according to Eq. (43), the leading-order large- behavior of vanishes in the limit . This indicates that for behaves differently, and requires a more careful analysis, to which we turn in the next subsection.
4.3 Return problem:
The critical value marks the transition between the exponential decaying and oscillatory large- behavior of the first-detection probabilities, so we expect that the limit has only a pure power-law decay without exponential or oscillatory behaviors. Physically, in this case, the detection site sees only the maximal group velocity of the particle and the participation of only one velocity eliminates the oscillations. In addition, the power-law of the decay is anomalous, due to the changing of the exponent of the power-law decay of from its typical value of to , as we shall see. More fundamentally, this will be seen to arise from the emergence of an inflection point in the dynamical phase relation, Eq. (23).
It was shown in Ref. [12] that the power-law decay of is governed by the behavior of the dispersion relation at its extremum. For , there is instead an inflection point, where both the first and second derivatives vanish, and the power-law is governed by the third order derivative. The general relation between the behavior near the inflection point and the order of power-law of will be discussed in Appendix B.
In detail, the calculation of proceeds as above; therefore in this subsection, only the changes will be mentioned. First, here the argument of the Bessel function is equal to the index. The asymptotics of the Bessel function in this case are [22] (eq. 9.3.5 p.366):
[TABLE]
where . is the Airy function. The presence of the Airy function in this equation signals the transition between the oscillatory and exponential decaying regimes of , as in the vicinity of the turning point in the Schrödinger Eq.
The different power-law in the large- asymptotics changes the index of polylogarithm in ; this affects the behavior around its branch-cut. has one branch-cut which runs from to infinity on the negative imaginary axis. This implies that exhibits neither exponential decaying (because the branch-cut starts at ) nor oscillations (because there is only a single branch-cut). Performing the integration around the branch-cut yields
[TABLE]
The results of a simulation (not shown) of with the critical agree with this last equation.
4.4 Arrival Problem: Fast-moving detector
We now turn to the arrival problem, where the experiment starts with the particle initially located at the origin, , and the detector at , so that , first looking at the fast-moving detector case. Similar to the return problem for the fast-moving detector, it can be shown that there is only one branch-cut in the arrival problem, simplifying the analysis of how changing the initial location of the detector affects the probabilities, as we show below in the case where the initial . In addition, in the case of , we will briefly explain the location of the critical points and the change of behavior at these points. The slow-moving detector case has two branch-cuts, so the analysis is similar to that of the stationary detector discussed in Ref. [11] and we will not revisit it here in this paper.
When the initial location of the detector is to the left of the initial location of the particle, , due to the fact that the fast-moving detector catches up with and passes the particle, there are two special times, marking the entrance () and departure () of the detector to the oscillatory zone between the peaks of the free particle wave-function (as shown in Fig. 7); note that in the slow-moving detector case there is only one , which marks the entrance, and then we obtain the familiar behavior of power-law decay with oscillations. Before the entrance time, increases monotonically, then between and it oscillates and after the departure, an exponential decay sets in. Using the maximal group and detector velocities, these incidence times are:
[TABLE]
Note that the dwell time between the peaks, , increases as a function of . The incidence times in the simulation result in Fig. 7a agree with this last equation.
In the opposite case, when , the detector starts to the right of the particle and moves away at a constant velocity. For less than the critical value, the detector outruns the particle and is dominated by the first measurement and so is exponentially small in . We get
[TABLE]
For larger than the critical value, the particle eventually catches up to and passes the slowly moving detector. In this case, is maximal at the time of meeting, and falls off like a power-law for large , and the dependence on is only in the phase, as in the case of the SMP.
4.5 Zeno effect in the RMP
The quantum Zeno effect (also known as the Turing paradox) is a feature of quantum mechanical systems allowing a particle’s time evolution to be arrested by measuring it frequently enough [23, 24, 25]. In the quantum first-detection problem, it is manifested as the sampling time goes to zero. For example, when the detection site is fixed in the tight-binding model, as discussed in Ref. [10], there are two types of Zeno effect. The first is in the arrival problem, where, as the detection sampling period approaches 0, the total detection probability goes to 0. The second case is in the return problem, in which case, when .
In the RMP on the infinite line, where the detector site moves right after every detection attempt, the physics of the small limit is very different, depending essentially on the sign of , and the Zeno effect is irrelevant. As noted above, for , the detector runs away very quickly from the particle and the detection probability is extremely small. For , on the other hand, for small the detector quickly arrives at the initial particle position before the particle has had any chance to move away, and the total detection probability goes to one. Thus, in this case, the RMP manages to completely defeat the Zeno-induced problems of the small- limit of the SMP.
Only for very large, on order , does the particle have a chance to spread out significantly, so in this regime things become more complicated. For small sampling time and large , with order 1, we find (see Appendix C for the derivation) the total probability to detect the particle is still close to one. The survival probability in this limit is given by:
[TABLE]
where we have defined . Fig. 9 presents two limits of the last equation. The first limit is where is small so (48) becomes:
[TABLE]
When is very large, the survival probability approaches the finite limit with algebraically decaying oscillations. More specifically,
[TABLE]
Fig. 9 show agreement of the simulation and Eq. (48) for the finite case and Eq. (49) for the small limit.
4.6 Large Rings and the Infinite Line
In Ref. [10], the behavior of for the SMP for a large but finite ring was discussed. It was noted that for the large ring closely followed that for the infinite line, up to some critical , but the details were not analyzed. In the case of the RMP, the situation is similar. Physically, the cyclic boundary condition causes the detector to see the opposite peak of the wave function at this critical and therefore in this region starts increasing as a power-law. This behavior is similar to behavior for not too large in the SMP arrival problem which was discussed in Ref. [11]. As there, we can find the value of via considerations of group velocity. The maximum group velocity of the return peaks is , while the detector’s velocity is , so, for the return problem, their first meeting will occur at:
[TABLE]
The cyclic boundary condition means that the free propagation (the direct term in the renewal equation) of the particle on the finite ring can be expressed as a summation over “image particles” of free propagation on the infinite line. Specifically, as shown in Appendix A,
[TABLE]
For , only the term in the sum is not negligible so in this time frame the particle propagates similarly to a particle on an infinite line, and so is the case for the first-dectection probability .
As we approach the critical , the term of the sum decreases and the terms become more significant, with the dominating for . Note that the unsuccessful measurement reaction terms of the renewal equation for are negligible because of the tiny values of ; a similar phenomenon for the SMP case was discussed in Ref. [11]. An approximation of direct terms at this time gives the power-law increase. In Fig. 10, we simulate on a ring for both the fast and slow detector cases. In addition, the simulation of on the infinite line of the return and arrival amplitude are shown. The match between the first-detection probability on the finite ring with that on the infinite line before and near and the subsequent agreement with Eq. (51) are shown in Fig. 10.
5 Summary and Discussion
We investigated the Running Measurement Protocol on the tight-binding quantum walk model under repeated stroboscopic measurement and mapped it to an equivalent stationary detector system with a modified unitary evolution operator. We computed the first-detection probability distribution and other statistical quantifiers of the process like and for a ring and for an infinite line. For the ring, the modified unitary evolution operator breaks the reflection symmetry and restores perfect detection for the arrival problem. For the return problem, it increases while reducing close to the small Zeno limit, in line with the findings of Ref. [16]. This fact is important, since the average time for first detection is which is very small but now the variance is also small, so that the Zeno effect is eliminated. The increase of in the return problem due to the elimination of quantum interference is observed also in open quantum systems when decoherence effects are added [16].
For the infinite line, one major new feature of the RMP is the presence of a critical detector velocity. If , the detector outruns the particle, so if , the total detection probability is very small and goes to zero as increases. For , the detector is slow enough that it captures a range of particle velocities, and is significantly larger. Hence we have a simple quantum dynamical phase transition. This behavior is seen in the numerical results in Fig. 7. This transition obtains also in a biased discrete quantum walk [26]. The second transition, at , at which oscillations in set in for , is analogous to the transition seen at for the corresponding stationary detector case.
The ability to tune, by varying and hence the detector velocity, which range of group velocities of the particle the detector will encounter, allows new behaviors to emerge. In the case where the detector outruns all possible velocities of the particle, an exponential decay of the detection probability with attempt number emerges (see Fig. 6). When the detector velocity is such that it encounters particles within a certain range of group velocities, one sees behavior similar to that of the stationary protocol with power-law decay and recurrence of the system. In the critical case () where only the maximal velocity is probed, there is a power-law behavior with an anomalous exponent (Eq. (45)). A similar special power-law decay at the border between exponential and power-law decay of the arrival probability is observed in Brownian motion with a boundary with a velocity that decays as a power-law in time [27].
The moving frame in addition breaks the left/right symmetry between in the total detection probability. For , the total probability to detect the particle decays exponentially. For large values of negative , it converges to a finite value (which decreases with increasing ) as . The exponential decay of the total probability to detect the particle as a function of the initial particle-detector distance is found also in Brownian motion with escape through ballistically moving boundaries [27, 28].
A possible generalization of RMP is to move the detector more than one step between measurements. This would allow independent control over the measurement interval and the detector velocity. One complication of this scheme is the possibility of hopping over the particle and missing it completely. To counter this, one would have to widen the detector to compensate. It would be interesting to pursue this line of inquiry.
Our results can, in principle, be tested experimentally in a cold atom system, given the possibility of realizing a conveyor belt of cold atoms [29, 30] with a very local detection of a single site in an optical lattice. This conveyor belt protocol is equivalent to the Running Measurement Protocol and its dynamics are again representable as a modified unitary propagator a la Eq. (8).
The support of Israel Science Foundation’s grant 1898/17 is acknowledged.
Appendix A Poisson summation
In this appendix we will discuss the finite version of Poisson summation and its application to the finite ring propagator as discussed in main text. Let a complex-valued function of a real variable , periodic with period . Therefore it can expressed as a Fourier series:
[TABLE]
where the Fourier coefficients are given by:
[TABLE]
Plugging (53) into the Riemann sum of over a period, the only contributions that survive are for , for integer , and we get the finite version of the Poisson summation forumula[31]:
[TABLE]
We can use this formula to calculate the () propagator represented as a sum over the wavenumber of the function . Note that is continuous and periodic with period . In addition, the number of sites () is equal to in Eq.(55). Therefore the Fourier coefficients are:
[TABLE]
This, together with Eq. (55), gives Eq. (52) in the main text.
Appendix B The behavior of in the RMP for the infinite line with
In this Appendix, we analyze the return amplitudes for the RMP infinite line problem at the critical from the dispersion relation using the Fourier-Tauber theorem which is discussed in Ref. [12]. The goal is to calculate the exponent associated with the power-law decay from the behavior of the measured spectral density of states (MSDOS, see Ref. [12] for the definition) near the singular point using the Mellin transform. The exponent is determined by the location of the pole with the largest real part. The novel aspect of the case treated in this appendix is that the effective dispersion relation for has an inflection point at , and so we have to expand to 3rd order in Taylor series. The Mellin transform of the return amplitude MDOS () is:
[TABLE]
where is the Heaviside step function. Note that the integral includes only those energies greater than the singular energy so from this equation we will get only . Equivalently, it is possible to calculate from the energies lower than because the expansion is around an inflection point, as opposed to the case of an extremal point, and so both sides of the energies contribute. Expanding to 3rd order around we get:
[TABLE]
where , since the falloff is controlled by the region near the critical point. The function causes asymmetric limits of integral around . Changing variables to , we get:
[TABLE]
is defined as the other terms which do not depend on . The integral yields a one first-order pole at . The next step is to find . This is done via an inverse Mellin transform.
[TABLE]
The notation implies this is a line integral taken over a vertical line in the complex plane. Using the residue theorem, we find the power-law of around is . According the Fourier-Tauber theorem, the large- decay of is then a power-law with exponent . This result matches with the power-law of we saw in Eq. (44), the difference between and Eq. (44) is only the phase of which does not change the decay exponent.
Appendix C Derivation of for the infinite line arrival problem
As mentioned in the main text, we can solve for in the small limit. For , falls off very rapidly with , and is dominated by the “direct” term, , as the denominator in is to leading order in , giving
[TABLE]
for is then dominated for small by , yielding
[TABLE]
The situation is very different for . Again, the direct term dominates , but the dominant term is , where . To next order in , also contribute, yielding an additional to . Whereas for fixed , this term is down by a factor , for large , this term can be of order 1. Summing up all the direct contributions, we have
[TABLE]
where we have used the identity 9.1.76 from Ref. [22] in the last line. This result gives correctly to leading order in the small , finite limit.
To next order, we have to include the first correction from the denominator in . We have
[TABLE]
The numerator is as before, so
[TABLE]
so that
[TABLE]
The sum, is as above, dominated by the term, so that, to this order, we have
[TABLE]
We thus see that . The function is given by
[TABLE]
This last identity can be proven by differentiating Eq. (68a) and seeing that the sum telescopes:
[TABLE]
Similarly, differentiating Eq. (68b) gives the same result. For small , behaves linearly, The large- asymptotics of are easy to calculate:
[TABLE]
In principle, we also have to include the correction induced by the in the argument of the Bessel functions in Eq. (63). However, this correction, being odd in , does not give a net contribution to .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aharonov Y, Davidovich L and Zagury N 1993 Physical Review A 48 (2) 1687–1690
- 2[2] Farhi E and Gutmann S 1998 Physical Review A 58 915
- 3[3] Mülken O and Blumen A 2011 Physics Reports 502 37–87
- 4[4] Venegas-Andraca S E 2012 Quantum Information Processing 11 1015–1106
- 5[5] Roushan P, Neill C, Tangpanitanon J, Bastidas V, Megrant A, Barends R, Chen Y, Chen Z, Chiaro B, Dunsworth A et al. 2017 Science 358 1175–1179
- 6[6] Karski M, Förster L, Choi J M, Steffen A, Alt W, Meschede D and Widera A 2009 Science 325 174–177
- 7[7] Sherson J F, Weitenberg C, Endres M, Cheneau M, Bloch I and Kuhr S 2010 Nature 467 68
- 8[8] Dhar S, Dasgupta S and Dhar A 2015 Journal of Physics A: Mathematical and Theoretical 48 115304
