Next Article in Journal
Remarks on Limit Theorems for the Free Quadratic Forms
Previous Article in Journal
Corrected Thermodynamics of Black Holes in f(R) Gravity with Electrodynamic Field and Cosmological Constant
Previous Article in Special Issue
Continuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State Transfer
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States

by
Qingyuan Wang
1,*,
Silin Ren
1,
Ruoyu Yin
1,*,
Klaus Ziegler
2,
Eli Barkai
1 and
Sabine Tornow
3,*
1
Department of Physics, Institute of Nanotechnology and Advanced Materials, Bar Ilan University, Ramat-Gan 52900, Israel
2
Institut für Physik, Universität Augsburg, 86135 Augsburg, Germany
3
Research Institute CODE, University of the Bundeswehr Munich, 81739 Munich, Germany
*
Authors to whom correspondence should be addressed.
Entropy 2024, 26(10), 869; https://doi.org/10.3390/e26100869
Submission received: 2 July 2024 / Revised: 6 October 2024 / Accepted: 14 October 2024 / Published: 16 October 2024
(This article belongs to the Special Issue Quantum Walks for Quantum Technologies)

Abstract

:
We investigate a quantum walk on a ring represented by a directed triangle graph with complex edge weights and monitored at a constant rate until the quantum walker is detected. To this end, the first hitting time statistics are recorded using unitary dynamics interspersed stroboscopically by measurements, which are implemented on IBM quantum computers with a midcircuit readout option. Unlike classical hitting times, the statistical aspect of the problem depends on the way we construct the measured path, an effect that we quantify experimentally. First, we experimentally verify the theoretical prediction that the mean return time to a target state is quantized, with abrupt discontinuities found for specific sampling times and other control parameters, which has a well-known topological interpretation. Second, depending on the initial state, system parameters, and measurement protocol, the detection probability can be less than one or even zero, which is related to dark-state physics. Both return-time quantization and the appearance of the dark states are related to degeneracies in the eigenvalues of the unitary time evolution operator. We conclude that, for the IBM quantum computer under study, the first hitting times of monitored quantum walks are resilient to noise. However, a finite number of measurements leads to broadening effects, which modify the topological quantization and chiral effects of the asymptotic theory with an infinite number of measurements.

1. Introduction

Quantum walks, which are the quantum analogs of random walks [1,2,3], have gained significant interest recently due to advancements in quantum computing technology. Just as random walks play a crucial role in computer science, particularly in the development of stochastic algorithms, quantum walks serve as a foundation for the development of quantum algorithms.
There are two categories of quantum walks: the continuous-time quantum walk and the discrete-time quantum walk. The former is conducted within the position Hilbert space of a quantum walker, where its evolution is governed by the system’s Hamiltonian. The latter operates in a Hilbert space that also includes a coin space, and its evolution is controlled by a position shift.
The necessity to measure the position of a walker in the position Hilbert space to evaluate properties of the underlying system introduces a new kind of quantum walk because the intermediate measurements introduce stochastic effects and lead, in general, to monitored quantum dynamics.
The central quantity of random and quantum walks is the first hitting time [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25], the expected time it takes for a walker to reach a particular state or position for the first time. Therefore, the quantum walk must be modified so that a specific measurement method is included in the walk protocol. The observation had to be performed during the quantum walk and, therefore, during the quantum computation. We use the continuous-time walk and perform periodic strong measurements to define the hitting time. The quantum walk with interspersed mid-circuit measurements set big challenges for the state-of-the-art quantum computers [26,27], which are met, e.g., by the quantum computer IBM Sherbroke. This option of low-error mid-ciruit read-out not only leads to new possibilities to benchmark quantum algorithms based on dynamic circuits on real hardware or to test quantum error correction codes but also provides opportunities to explore the dynamics and statistics of monitored quantum systems, fundamentally relying on the information obtained by the observation.
Italics are not necessary. It indicated only the quantum computer. The company is mentioned in the acknowledgment. Other entropy articles with IBM Quantum computers are doing the same.
The repeated monitoring at predetermined times yields a string of measurement outputs. These can be viewed as a stochastic trajectory varying in time, which depends on many factors, including the initial state, the dynamics of the measurement-free process, the chosen time intervals between measurements and the measurement protocol. Given a stochastic trajectory, the first quantum hitting time is defined as the time taken to reach a target for the first time.
The monitored quantum walks can be applied to evaluate the structure and dynamics of classical and quantum networks for which a Hermitian Hamiltonian or adjacency matrix can be defined. In principle, this can be extended to non-Hermitian adjacency matrices.
The primary objective of this work is the implementation of a monitored quantum walk on a small directed graph. Here, the triangle model represents the simplest nontrivial model that serves as a proof of concept on a quantum computer where the different measurement protocols can be tested. The complexity of the problem lies not in the number of qubits, but in the depth of the circuit, which also includes mid-circuit measurements. Specifically, our aim is to investigate whether the interference, topological, and Zeno effects, as well as the effect of different monitoring protocols, are present when the quantum walk is implemented on a quantum computer or if too many mid-circuit measurements distort the result. The fundamental questions are how the monitoring methods affect return times and detection probabilities on a quantum computer, whether they are affected by noise, and how the known properties derived by the asymptotic theory are changed due to a finite number of measurements. First, we discover that  I B M S h e r b r o o k e  is a well-suited testbed to confirm the stochastic trajectory of monitored quantum walks without considering a noise model. Second, due to finite resolution effects (finite number of measurements), new metastable quantization effects are found. These effects, while very visible in our experiments, are expected to vanish in the limit of an infinite number of measurements, giving new insights into monitored quantum systems.
The paper is organized as follows. Section 2 introduces the physical properties of continuous-time quantum walks subject to periodic observation. Section 3 is the theoretical part that describes the model, the measurement protocol, and how to implement it on a quantum computer. In Section 4 and Section 5, we present the asymptotic theory and experiments, respectively, for the hitting time when the initial and target states are identical for different control parameters. In Section 6, we vary the initial state, which leads to interference effects and dark states. Finite resolution effects are discussed in Section 7. In Section 8, we simulate the mean return time with a larger number of measurements and with the inclusion of noise. We summarize our results in Section 9 and propose some ideas for future studies.

2. First Passage Time of Random and Monitored Quantum Walks (Recap)

Consider a classical random walker on a lattice of dimension d [28,29]. The classical walker starts at the origin, and the first hitting time is the time it takes the classical walker to reach some other vertex. The basic questions are: Will the classical walker reach the target after, in principle, an infinite number of steps? What is the distribution of the first passage times to the target state? The mean first hitting time is a widely used quantifier of the process. In finite systems, excluding ergodicity breaking, simple random walks are recurrent, and hence, the classical walker is detected with probability one, i.e.,  P det = 1 , in any dimension. For infinite systems, the process is non-recurrent in dimension 3 and above, and hence,  P det < 1 . For the purpose of the search, the processes are diffusive and hence non-efficient in the sense that paths resample previously visited locations many times. For quantum walks, which are monitored by repeated projective measurements, the situation is vastly different, and here, we mention four such aspects.

2.1. Path Definition and Measurement Protocol

When we obtain quantum trajectories through repeated projective measurements, the statistics of the first detection time will depend on the observation scheme with which the path is constructed. We utilize the global or tracking protocol and the local or on-site protocol (see Section 3). In ref. [30], a shell game was considered on a triangle (a similar geometry as in our work). In the global measurement scenario, all position states are considered equally likely, resulting in a winning probability of 1/3, with repeated trials ensuring eventual success. In contrast, local measurement shows deviation, potentially leading to a situation where winning is impossible, regardless of the number of attempts.
Here, we address the first hitting times with different measurement protocols using IBM quantum computers. For that purpose, the first hitting time for tracking and for localized (on-site) measurements at the target state is defined and studied. We will also highlight when these protocols exhibit a classical behaviors, in the sense of classical random walk behaviors, and when they exhibit quantum features.

2.2. Constructive and Destructive Interference

Quantum walks, for example, tight-binding models (studied here), serve as a benchmark for quantum searches [2]. These walks may exhibit a quantum speedup for the hitting time, which can be exponential for specific initial states and highly symmetric graphs [4]. However, in some other cases, the quantum search can perform poorly due to destructive interference, and the latter problem can be avoided in principle using specially designed graphs [31] or with a restart strategy [32].

2.3. Topological Effects

A case study is the return or recurrence problem in finite systems. The return problem addresses the time it takes for a process to return to its initial state [7,8,15,19,33,34]. In the classical domain, the mean recurrence time is described by Kac’s lemma [35]. This gives the mean return time in terms of the steady-state measure (see below). In a pioneering work, Grünbaum et al. [7,8] extended this result to the quantum domain. They showed that the mean number of measurements until the detection of the quantum walker in its initial state is quantized. This is connected to a topological effect. Mathematically, the mean return time is related to a winding number of the generating function of the first detection statistics. One of the most striking differences between classical and quantum walks is a phase in the latter. Although the phase is usually not directly observable, its properties can have a significant impact on observable quantities. Here, the mean return time is topologically protected; however, sharp transitions are found for special choices of the sampling time. It turns out that the mean return time number is directly linked to the winding number, which implies a quantization of the latter [7,8]. Moreover, the winding number of the return problem is equal to the dimensionality of the available Hilbert space. These results are valid for local measurements at the target state when the information about the trajectory between measurements is unknown.
The authors of ref. [36] studied a different protocol, when the trajectory is defined with a tracking protocol. In this case, the position of the quantum walker is recorded along its path until its first detection in the target state. Again, the mean return time is quantized, being larger than or equal to the one found in refs. [7,8] using local monitoring. When monitoring obtains the information about the trajectory of the quantum walker, we destroy the phase, and hence, for most sampling rates, the behavior we find experimentally underneath is classical. However, for specific sampling rates, quantum features are shown to emerge. In contrast, the local measurement protocol investigated here exhibits robust quantum characteristics that are independent of the sampling rate.

2.4. Zeno Physics

In quantum mechanics, sampling cannot be performed too fast to avoid freezing of the wave packet in its initial state [37]. Thus, the data acquisition rate is an important parameter controlling the statistics of the hitting time process in both protocols. However, when delving into the real-world open quantum systems, including noise, it became evident that the anti-Zeno effect may be present, which means that measurements can accelerate qubit decay rates [38].

3. Model and Measurement Protocols

3.1. Model

We consider a tight-binding chiral quantum walk [39,40,41] on a triangle graph with complex edge weights in the presence of a magnetic flux (Figure 1) for two different monitoring protocols. The localized states are  | 0 , | 1  and  | 2 , and the initial state is  | ψ in . The measurement-free evolution is defined via unitary dynamics
U = exp ( i H τ )
with the time interval  τ  between detection attempts, and  = 1 . The Hamiltonian H is
H = γ e i α | 0 1 | + | 1 2 | + | 2 0 | + h . c . .
Here, h.c. stands for hermitian conjugate.  α  and  γ  are control parameters that model the effect of magnetic flux and hopping amplitude, respectively. The time-reversal symmetry is broken when  exp ( i α ) 1 . The eigenvalues of the Hamiltonian are
E k = 2 γ cos 2 π k 3 + α , k = 0 , 1 , 2 .
When  α = 0 , we have a pair of distinct energy levels, and more generally, when the flux  α 0 , we typically remove the two-fold degeneracy, and the number of distinct energy levels is three [42]. The removal of energy degeneracy will have a profound effect on the mean return time and the dark states in the system as we will soon show.
To understand the physical properties of the monitored quantum walks, it is useful to visualize at which of the  α  and  γ τ  parameters (our control parameters) the eigenvalues of U are degenerate
exp ( i E k τ ) = exp ( i E l τ ) , ( k l ) , k , l = 0 , 1 , 2
in a phase factor matching diagram; see Figure 2. The analytical results are given in Appendix A. For  α = 0 , two phase factors match due to the degeneracies of the eigenenergies, while three phase factors match for  γ τ = 2 π j / 3  with  j N . Other points where three phase factors match are, e.g.,  ( α , γ τ ) = ( π / 6 , 2 π / 3 ) , ( π / 3 , 2 π j / 3 ) , ( π / 2 , 2 π / 3 ) , etc. We will later see how this matching phase factor diagram is related to the hitting time problem as well as the dark states. We define a target state  | 0  in which we monitor each  τ  units of time using two measurement protocols. These are described in the next two subsections.

3.2. On-Site Protocol

First, we consider the stroboscopic measurement scheme [11], which we call the local measurement protocol or the on-site protocol. Here, measurements are performed every  τ  units of time. Between measurements, the dynamics is controlled by the unitary time evolution  U = exp ( i H τ ) . The measurement is made locally at  | 0  to detect this state; see Figure 1 (left panel). Here, the measurements yield either a no or a yes, that is, the quantum walker is either not found or is found on  | 0 . Mathematically, the measurement is described by the projector  | 0 0 | . A typical string of measurements is, for instance,
{ no , no , no , yes , } .
In this case, the first hitting time is  4 τ . The first click yes gives the random number of measurements, denoted n, needed to detect the quantum walker in the target state  | 0 . In this case, unless we deal with a two-state system, the information obtained in this way does not specify the state function of the walker after each null measurement. Hence, after obtaining a no-result, we do not know what the amplitudes are for states  | 1  and  | 2 .

3.3. Tracking Protocol

Second, we consider the tracking protocol [36], with the target state  | 0 , where we record the position of the walker on the graph every  τ  units of time; see Figure 1 (right panel). In this stroboscopic protocol, measurements are made at times  τ , 2 τ , , 20 τ . In a typical realization of the process, we find a result, which is given by the eigenvalues of the position operator, for example
{ 1 , 2 , 0 , }
or using the same initial condition and the same unitary
{ 1 , 2 , 1 , 2 , 1 , 0 , } .
The first hitting time is clearly random, and in these two examples, it is  3 τ  and  6 τ , respectively.
From the basic postulates of quantum measurement theory [43], we know the state of the system immediately after each measurement. This will be the eigenstate corresponding to the eigenvalue just recorded, assuming strong measurements. For the first example, we will therefore find
{ | 1 , | 2 , | 0 , } .
This implies that with this type of measurement, we know precisely what the state of the system along the measured path is.

3.4. The Return Problem

In the return problem, the target state and the initial state are the same. This choice is also called the reccurrence time problem. It will be studied with both protocols. Thus, we start with state  | ψ in = | 0 . Just before the first measurement at time  τ , the state function is  | ψ ( τ ) = U | ψ in . For the tracking protocol, we then measure the location of the walker on the triangle graph. Suppose that the first measurement yields  1 , i.e., the system is projected to state  | 1 . We then continue and evolve the system until the second measurement according to  U | 1 , and measure again. For the on-site protocol, the new state is the projection to the other accessible states if we do not detect the quantum walker on site  | 0 . Note that when we study dark state physics, we use other initial conditions, see below.

3.5. Implementation on the Quantum Computer

To record the trajectory on a quantum computer, we have to encode the tight-binding Hamiltonian into a qubit Hamiltonian:
H = 1 2 γ [ cos ( α ) ( σ 1 x + σ 2 x + σ 1 z σ 2 x + σ 1 x σ 2 z + σ 1 x σ 2 x + σ 1 y σ 2 y ) + sin ( α ) ( σ 1 y σ 2 y + σ 1 y σ 2 z σ 1 z σ 2 y + σ 1 x σ 2 y σ 1 y σ 2 x ) ]
where  σ x σ y  and  σ z  are the Pauli matrices. The Hamiltonian H defines two disconnected subspaces, the first composed states of  | 00 , | 01 , | 10  and the second of  | 11 . The unitary evolution operator  U ( τ ) = exp ( i H τ )  is decomposed into unitary gates using Cartan’s decomposition [44]. This allows us to vary  τ  without increasing the depth of the circuits.
For the on-site protocol, we need to detect the state  | 0  while we do not want to receive the information that allows us to distinguish the states  | 1  and  | 2 . This can be achieved by measuring only one qubit, which we define as the right qubit in the Dirac notation. We use the following mapping between the qubits and the representation of the spatial states:  | 01 | 0 , | 10 | 2 and | 00 | 1 . Measuring the right qubit in state  | 0  does not give any information to distinguish the states  | 1 = | 10  and  | 2 = | 00  but measuring the right qubit in state  | 1 , the system is in  | 0 = | 01  with certainty.
For the tracking protocol, we measure the states of both qubits, and thus, after each measurement, we find the outcome 00, 01 or 10. For error prevention reasons, we use a different mapping between the qubit and the spatial state representation:  | 00 | 0 , | 01 | 1 and | 10 | 2 . The reason is that, experimentally, there is an asymmetry in the measured spectrum. For example, it is much more likely to migrate from a state  | 01  to  | 00  than from  | 00  to  | 01  due to decay processes. Therefore, we define  | 00  as our initial state.
We discuss the procedure for executing the quantum walk on noisy quantum hardware, focusing on general-purpose gate-based quantum computing platforms accessible via the cloud, which allows for a couple of mid-circuit measurements: IBM Sherbrooke.
The coherence times have been increased, with recently exhibiting median  T 1  and  T 2  times approaching 300 μs and 150 μs, respectively. To minimize the error, we restrict our computation to two quits (for three sites), where it is possible to find a constant depth circuit using Cartan’s decomposition [44], specifically with three CNOT gates and single-qubit unitary gates. Importantly, this formulation allows us to vary  τ  in the computation without increasing the circuit depth and thus the noise. We do not mitigate the noise of the mid-circuit read-out, since the standard read-out error mitigation methods for terminal measurements are not applicable. Recently, mid-circuit read-out mitigation has been proposed [45,46], which should be applied when scaling up the system size and thus the number of qubits and circuit depth. For larger systems, the mean first hitting time may reach larger values, which necessitate more mid-circuit measurements. As an error suppression strategy, we use dynamical decoupling by inserting two X-gates at specific intervals on the qubit, which is not measured, to keep it coherent [47]. We compute the time for the first detection or the first hitting time  n τ  and evaluate its statistical properties as a function of  α  and  γ . Effectively, the measurement process has ended when we find the target state for the first time. The result obtained from the measurements is a string of size N, which yields what we call a trajectory (a string of N bits for the on-site protocol and N times two bits for the tracking protocol for 32,000 runs). In practice, we cannot stop the experiments in the middle of the process, i.e., currently, there is no conditional abort option on IBM quantum computers. We, therefore, shorten the trajectories using classical post-processing at the bit position where the target site was measured.

3.6. Observables

Now, we define the statistical observables of interest. They can be estimated from the sample paths and will depend on the parameters of the model, such as  γ τ α , the initial state and the measurement protocol. Let  F n  be the probability that the quantum walker is detected for the first time in the target state at the n-th measurement [11,36]. Thus,  F 1  is the probability that the target state is recorded at the first measurement event, while  F 2  describes the case where the state was recorded for the first time in the second attempt.  n  is the conditional mean number of events until detection
n ( N ) = n = 1 N n F n n = 1 N F n ,
for  n = 1 N F n 0 . Hence,  τ n ( N )  is the mean time until detection. From now on, we will call this physical quantity the mean return time for brevity. We also define the total detection probability  P det
P det ( N ) = n = 1 N F n ,
which is the probability that a detection event was recorded. The estimation of this probability comes from the number of strings without detection. In an ideal situation with infinite resolution, these are obtained through  lim N P det ( N ) = n = 1 F n  and if the latter is unity, that is, if the system is detected with a probability of one,  lim N n ( N ) = n = 1 n F n . As mentioned in the introduction, even for the triangle model under study, we can find cases where  P det < 1  due to destructive interference, as explained below.
In the experiment, we obtain the statistical properties of the first detection time for a finite number of measurements N, giving rise to finite resolution effects. Per trajectory, the first detection time is  n τ , where the integer n is the random number of measurements until the first detection of the target state. Clearly in our experiments,  n N . Note that the obtained strings are vectors of size N. It is possible that the string did not contain the target state  | 0 , a fact that will become important later, close to topological transitions.

4. Theory Recap

We consider the return problem when the initial state  | ψ in = | 0  is detected for the first time. Furthermore, for now, we assume  N .

4.1. On-Site Protocol (Theory)

The theorem of recurrence for on-site measurements reads [7,8]
n = number   of   distinct   phase   factors exp ( i E k τ )
where  E k  are the eigenstates of H [Equation (3)] for the triangle model. From Equation (3), it becomes clear why the phase factor matching diagram is a very useful tool. For example, for the choice of parameters corresponding to blue circles in Figure 2, we expect  n = 1 , while for the colored lines (besides blue)  n = 2 , and anywhere else,  n = 3 . This holds, in general, under the condition that the energy states, i.e., eigenstates of H, denoted  | E k  have finite overlap with the detected state. For example, in the Zeno limit  τ 0 , the three phase factors merge, and hence,  n  is equal to one. This is expected for the return problem, since we start at the measured state, and hence, the first measurement detects it when  τ = 0 . Phase factor matching conditions correspond to the removal of a state from the effective Hilbert space. If the phase factor match  exp ( i E 1 τ ) = exp ( i E 2 τ ) , the state  ψ 0 | E 1 | E 2 0 | E 2 | E 1  cannot be detected. Thus, the phase factor matching choices of  γ τ  and  α  reduce the dimension of the Hilbert space, which can be shown to lead to faster detection compared to the cases where the phase factors do not match.
We provide more details in Appendix B.

4.2. Tracking Protocol (Theory)

Except for special model parameters, the mean return time  n  is the number of states in the system, which is three for the triangle model under study. The result  n = 3  can be viewed as a classical result. More specifically, consider a classical random walk coupled to a heat bath in the infinite temperature limit. In this case, in a steady state, all states are equally likely; namely, the occupation probability is  1 / 3 . Then, from the classical Kac theorem for the return problem,  n = 3  [35]. At least in the classical domain this is easy to understand since the probability of measuring the walker in the target state in the first measurement is  1 / 3 , in the second  ( 2 / 3 ) ( 1 / 3 ) , etc., and hence,  n = n = 1 n ( 2 / 3 ) n 1 ( 1 / 3 ) = 3 . Thus, tracking, for most of the choices of  τ , drives the system to a classical limit. The quantum aspect of the hitting-time process is found for special values of  τ  that capture the revival of the wave packet, and hence, the underlying periodicity of the quantum dynamics. Namely, there exist revival times where the initial wave function returns to its original state in addition to an unimportant phase. Then, if we measure at that time, the quantum walker is detected with a probability of one in the target state in the first measurement, and hence,  n = 1 . In particular, when  τ = 0 , we have  n = 1 . In the diagram in Figure 2, these special sampling times correspond to three phase factors matching, shown as blue dots and blue lines. Clearly, the idealized theory predicts that as we vary  γ τ  and  α , when three phase factors match, we will see a dip or a transition in  n . Thus,  n  will jump from  n = 3  to  n = 1  and back. In Appendix C, following ref. [36], we provide more details of the theory by introducing the corresponding Markov or stochastic matrix.

5. First Hitting Return Times on IBM Quantum Computers

We now turn to the experiments for the first hitting return time where, for the initial condition, we start at the target state
| ψ 0 = | 0 .
Theoretically,  n  exhibits pointwise discontinuous behavior, as mentioned. Can we see this on a quantum computer? At first glance, this might seem hard since the width of these transitions is theoretically zero, but in reality, for finite N, the transitions are broadened. In the following, we compare the experimental values, the classical simulation of Equation (5), and the asymptotic theory ( N ).

5.1. On-Site Protocol (Experiment)

Figure 3a shows the parameter regime (red dashed line) utilized for the computation of the mean return time as well as the classical simulation of the mean return time as a function of  γ τ  and  α  for  N = 20 . In comparison to Figure 2, the areas for  n = 1  (dark blue) and  n = 2  (medium blue) are broadened. The figure clearly shows how the conditions for phase factor matching can lead to jumps in  n .
For the experimental computation of  n , we utilize the quantum circuit in Figure 3b. The on-site protocol can be emulated by measuring the upper qubit after each unitary U.
Let us first discuss the results of the asymptotic theory using Equation (7). In Figure 3c–f, we consider  n  versus the dimensionless sampling time  γ τ , as well as the magnetic flux  α  (black solid line). For almost any  τ , on average, we return after two measurements, i.e.,  n = 2 . This holds when the magnetic flux is turned off ( α = 0 ). In contrast, when  α 0 , we have very special choices of  τ n = 3 , which is related to the fact that the magnetic flux  α > 0  removes the degeneracy by breaking the time-reversal symmetry and the rotational invariance. In addition, one observes typical sudden plunges in  n . These are found for special values of  γ τ  and  α . As mentioned in the introduction, these transitions, e.g., dips in  n  when plotted versus  γ τ  or  α  are related to a discontinuous change in the topology of the underlying generating function [7,8,15].
Quantization of the mean return time of the experimental result (light blue circles) is clearly evident for most values of  γ τ  and  α . Far from transitions in  n , theory predicts, and the experiments confirm, that for on-site measurements, with and without magnetic flux,  n 2  (Figure 3c) and  n 3  (Figure 3d–f), respectively. Notwithstanding these successes, theory ( N ) and experiment depart close to the parameters in which the broadening of the dark blue and medium blue areas is obvious in Figure 3a. When we choose path (III), in the ( α γ τ ) plain, we are in the vicinity of a phase factor matching curve, though strictly not exactly on it. Since the number of measurements N is finite in the experimental study, we are effectively witnessing a topological state with  n = 2 , instead of  n = 3  predicted by theory; see Figure 3e. We observe not only a broadening of the resonances but also additional resonances for finite N that are not present in the theoretical graph ( N ) (Figure 3d).
Furthermore, experiment and asymptotic theory do not match when triplets of dips of  n  are in the vicinity of one another on path (II). Indeed, when  α = 0.5 , we see three nearby dips (black solid line) from the theoretical prediction in Figure 3d, while in reality, we see one wide resonance (light blue circles). Thus, fine details are wiped out near the point where all three phase factors are almost matching.
What is the cause of the deviation between theory (black solid lines) and experiment (light blue circles) close to these topological transitions? It might be due to noise, readout errors, or finite resolution effects. Without a doubt, all of these effects may play some role. However, for the mean return time under study, we concluded that the main factor is the finite resolution of the experiment. The unitary dynamics and measurements implemented on the quantum computer work well on the time and size scale of our experiment, indicated by the fact that the experimental points lie close to the simulation on a classical computer (blue dashed lines). Finite resolution effects are discussed in detail in Section 7.

5.2. Tracking Protocol (Experiment)

Figure 4a shows the parameter regime (red dashed line) utilized for the computation of the mean return time as well as the simulation of the mean return time as a function of  γ τ  and  α  for  N = 20  for the tracking protocol. Compared to Figure 2, the areas for  n = 1  (dark blue) are broadened and in comparison to the on-site protocol in Figure 3a, we observe the dark color ( n ) more sporadically, i.e., the lines where only two phase factors match are irrelevant. For the experimental computation of  n , we implement the quantum circuit in Figure 4b, where both qubits are measured after applying the unitary U.
We start by discussing the theory for  N  (black solid line). The tracking protocol produces results with and without flux ( α n = 3 , for nearly all  τ , according to theoretical predictions. Note that any small deviation of  τ  from the special revival times or  τ = 0 , that is, the Zeno limit, yields  n = 3 , as shown in Figure 4c–f as a black solid line. For the finite magnetic flux  α = 0.5  in Figure 4d, there are no special sampling times  τ  except  τ = 0 . (Similar for  γ τ = 3 π / 3  and finite  α  in Figure 4e). When three phase factors merge, the deviations between the theory valid for  N  and experiments (light blue circles) for  N = 20  are large. We obtain a large deviation for the parameters in which the broadening of the dark blue areas is observed in Figure 4a between experiments and assymptotic theory. The broadening is present in the direction of  γ τ  and  α , which leads not only to a broadening of the resonances but also to additional resonances for finite N that are not present in the theoretical graph ( N ) (Figure 4d,e) but in the finite N simulation (blue dashed line). Similarly to the on-site protocol, the deviation of the experimental values from the asymptotic theory is due to finite-resolution effects. These are discussed in detail in Section 7.

6. Dark States on IBM Quantum Computers

So far, we have considered the return problem, where the initial state was also the target state. As mentioned in the introduction, considering more general initial conditions, we encounter dark states, and the eventual detection of the walker, even after an infinite number of repeated measurements, is not generally guaranteed [5,16].
The detection probability is defined in Equation (6). As mentioned in the introduction, for classical random walks on finite graphs like the triangle model,  lim N P det ( N ) = 1 , namely, the walker is detected with a probability of one. In our study, considering a finite graph, whenever  lim N P det ( N ) < 1 , we say that the system exhibits dark-state physics. Some initial conditions give  P det ( N ) = 0 , and these initial states are called dark states.

6.1. Dark States for Zero Magnetic Flux

Consider the case  α = 0  the initial condition
| ψ 0 = | 1 + e i ϕ | 2 2
and as before, the hitting process ends when we detect the system in state  | 0 . We study the influence of the phase  ϕ  on the detection process.
For on-site measurement and when  ϕ = 0 , the system is detected with a probability of one, except for special values of sampling times. In contrast, if  ϕ = π , the detection probability is zero. The latter case is caused by destructive interference and the symmetry of the problem. When  ϕ = π , the current from  | 1  to the detected state is minus the current from  | 2 , which means that for all times, including between measurements, the amplitude of the detected state is zero. This can break down when  α 0 , i.e., when the symmetry is broken. A different behavior is found for the tracking protocol. Then, after the first measurement, the wave packet is spatially localized in the system; hence, the symmetry is broken by the measurements, and the walker is eventually detected. Thus, a dark state in the on-site protocol can be bright for the tracking method.
A comparison between the two protocols is presented in the three-dimensional graphs in Figure 5a,b. The dark color in the figure corresponds to dark states. For the on-site protocol, using the methods in [16], we find
lim N P det ( N ) = 0 , γ τ = 2 π k / 3 1 + cos ( ϕ ) 2 , otherwise
The first line for  k = 0  corresponds to the well-studied Zeno limit. The Schrödinger equation being first-order in time implies that the amplitude in the detected state  | 0 , at time  τ , is proportional to  τ , but according to the rules of quantum measurement theory, the probability of detecting the quantum walker is proportional to  τ 2 , and hence, the walker is not detected at all. It should be noted, however, that for any small value of  τ  and when  N , the walker is eventually detected, which means that the limits of large N and small  τ  do not commute. Other values of  k = 1 , 2 , 3 ,  are choices of  τ  corresponding to revival times, when the wave function returns to its original state, and hence, the stroboscopic measurements cannot click yes even after many measurements and the quantum walker is never detected. The second line in Equation (9) corresponds to the destructive interference that is strongest when  ϕ = π . It is a robust effect in the sense that, for on-site measurements, it will hold for any choice of measurement time.
We recorded  P det  on a quantum computer using on-site measurements; see Figure 5a. We use  N = 10  measurements for each value of  γ τ  and  ϕ . The three-dimensional plot, Figure 5a, clearly demonstrates the above-mentioned features as horizontal and vertical dark stripes. In contrast, in the tracking protocol (Figure 5b), we see only the horizontal lines corresponding to the Zeno effect and the revivals, since, as mentioned, tracking breaks the symmetry in the system needed to maintain destructive interference effects.
Clearly, the results in Figure 5a,b using the quantum computer and in Figure A3 in Appendix D using simulations indicate a very good agreement between theory and experiment.

6.2. Dark States for a Finite Magnetic Flux

When  α 0 , the detection probability plots presented so far could, in principle, be replaced with a study of  P det  versus of  α , ϕ  and  γ τ . To simplify the matter, in the experiments and simulations below, the initial condition is
| ψ 0 = | 1
and therefore, the control parameters are  γ τ  and  α . In Figure 5c,d, we plot the detection probability for the on-site and tracking protocols, respectively, and find a striking difference. For comparison, the corresponding simulation is shown in Figure A3 in Appendix D.
The main features of these figures can be explained as follows. We start with the on-site protocol. Consider the choice of parameters for which two phase factors merge. For example,  exp ( i E 1 τ ) = exp ( i E 2 τ ) . We also denote the corresponding eigenstates with  | E 1  and  | E 2 , respectively. Then, an initial state
| ψ in 0 | E 1 | E 2 0 | E 2 | E 1
is clearly orthogonal with respect to the detected state  | 0 . In this case, every unitary step yields the same global phase shift  exp ( i E k τ )  with  k = 1 , 2 . Therefore, the amplitude of the target state will be zero for any subsequent measurement. In other words, this initial condition is completely dark and cannot be detected at all. Any initial state that is not orthogonal to this state cannot be detected with a probability of one; hence, in our example, the initial state under study is not bright when two phase factors merge.
When the three phase factors merge, a stronger effect will occur on the triangle graph. Then, the wave function, every  τ  units of time, returns to its initial state and hence revives. Since in the case studied in this section, the initial state is orthogonal to the detected state, clearly one cannot detect the walker. The same holds for the tracking measurement. The walker cannot be detected in the first measurement, nor in any of the repeated measurements. Hence, for on-site measurements, nonbright states are found when two or three phase factors merge. For the tracking protocol, dark states are found only when three phase factors merge; otherwise, the state is detected with a probability of one. Therefore, to better understand the detection, we return to the phase factor matching diagram in Figure 2, where we plot in the ( γ τ α ) plane curves when two phase factors coincide. That is,  exp ( i E 1 τ ) = exp ( i E 2 τ )  gives one branch of this relation between  γ τ  and  α  and similarly for pairs  ( E 1 , E 3 )  and  ( E 2 , E 3 ) . The plot of this information requires the energy levels that depend, of course, on  α . Different pairs of matching phase factors are presented in different colors. When three phase factors merge (circles), i.e., when curves cross each other in Figure 2, we see that for the tracking protocol, the detection probability in Figure 5d is small or zero. These crossing events appear as dark blue circles in Figure 5d. In the small  γ τ  limit, we see a clear dark stripe, representing Zeno dark states. When  τ = 0 , the three phase factors coincide.
When two phase factors match, in Figure 2, we see for the on-site measurements, i.e., in Figure 5c, the corresponding darker color. An issue for future study is whether one can distinguish between the colors in Figure 2 using repeated measurements. If we want to remove curves in Figure 5c, at least partially, then we have to choose an initial state orthogonal to the dark-energy state in Equation (10), which will be bright, corresponding to the merging of the two phase factors  exp ( i E 1 τ ) = exp ( i E 2 τ ) . Adding a phase to the initial state, like in Equation (8) can also add features to these plots. Can any of this be observed in the experiment? The results presented in Figure 5 are very convincing in this regard.
If we consider the return problem, the detection probability is at its maximum, and hence, a figure like Figure 5c would be colored white and, therefore, not very informative. In the dark area, where  P det = 0 , the mean return time is  n = 1  for both protocols. On brighter lines where the two phase factors match, we obtain  n = 2  (return) and  0 < P det < 1  (transfer) for the on-site protocol. Also, here, finite resolution effects are important, as for  N , the dark lines will become infinitely thin.
Finally, we pose the question of whether the total detection probability changes if we choose  | ψ 0 = | 2 . The total detection probability for the transition from  | 1  to  | 0  and  | 2  to  | 0 , respectively, is different and depends on the direction of the magnetic flux  α  for  N = 10 . The difference in the total detection probabilities is shown in Figure 6, where an asymmetry is observed around the broadened phase-matching areas and lines. The total detection time of the chiral quantum walker for the transfer depends on the direction (clockwise or counterclockwise) and also on the sign of the magnetic flux. Breaking the time-reversal symmetry can therefore enhance or suppress the total detection and, therefore, provide a directional control for certain parameters.

7. Finite Resolution

Finite resolution plays an important role in explaining the deviations between finite-time experiments and the theory for  N . It is present in the data of the mean return time  n  in Figure 3 and Figure 4 as well as the dark states in Figure 5. By finite resolution, we mean that measurements are performed N times per run. Typically, we record the target state for the first time in some random measurement attempt numbered  n i N . We repeat this process by constructing an ensemble of trajectories to sample the mean return time, which is the maximum number of runs. On the quantum computer that we chose, the number of runs is equal to 32,000. We have already explained that, in some cases, we might not find the target within these N measurements. Hence, in the figures presented, we show sample averages that, in principle, depend on our choice of N. More specifically, we define  K  32,000 as the number of paths for which we record the target state. Then, the sample mean n conditioned on the target measurement state is  n = i = 1 K n i / K , where we exclude the cases that we did not detect. Far from the topological transitions, the option of zero detection per run (null measurement) of size N, is rare, and the conditional measurement and the theoretical predictions yield similar results. However, as mentioned, close to topological transitions, we see deviations, which are due to the finite value of N. It should be noted that these deviations are a blessing in the sense that a precise measurement of a jump of  n , for a special value of  τ , as presented as black solid lines in Figure 3 and Figure 4, is non-physical, as the width of the transition cannot be zero. In the asymptotic theory ( N ) for a special value of model parameters (here  γ τ  and  α ),  n  exhibits a pointwise discontinuity related to a jump in the winding number, and the dark lines in Figure 5 become infinitely thin.
Remarkably, the simulations for the first hitting time (Figure 3 and Figure 4) and the detection probability (Figure 5) agree with the results provided by the IBM quantum processor without fitting. This led us to the conclusion that noise is not an essential factor here. In particular, the return time  n  seems to be protected from noise for values until  N = 20 , whereas interference effects that lead to dark states are only unaffected by noise up to  N = 10 . The influence of noise on larger N will be discussed in a forthcoming publication.
For the finite N case, e.g., in experiments, we gain three important insights that are due to finite resolution: (i) the broadening of the transition (Figure 3, Figure 4 and Figure 5), (ii) additional dips and plateaus (Figure 3e and Figure 4d,e) and a chirality effect of the total detection probabilities (Figure 6).
We have already mentioned that for the on-site measurement and  α = 0.5 , three dips found by theory are not found in the experiment; see Figure 3d. Furthermore, for the tracking protocol, a wide resonance is found in the experiment, which is absent in theory [Figure 4d]. We claim that this is due to finite N effects. To study this, we consider the mean return time, obtained from simulations, for various N. As shown in Figure 7a,b, for  N = 1000 , the resonances reveal themselves. However, that resolution is not yet experimentally available. The effects of finite resolution lead to the possibility of a crossover between different topological winding numbers (Figure 7c) from  n = 1  to  n = 2  and  n = 3 , with an increasing number of measurements N, i.e., near the special point  ( γ τ , α ) = ( 2 π / 3 , π / 6 )  for the on-site protocol, which can be interpreted as a metastable topological effect. For the tracking protocol, the crossover from  n = 1  to  n = 3  can be understood as a partial thermalization for a small number of measurements.
In Appendix B and Appendix C, the eigenvalue spectrum of the survival operator and the stochastic matrix are analyzed for the on-site and tracking protocol, respectively.  n  is discontinuous at special points when the absolute value of the eigenvalue is one. For  N = 20 , resonances and plateaus are also present when the absolute values of the eigenvalues are almost one, leading to metastable topological effects and partial thermalization. This, as mentioned, is because the observation is for a limited duration, i.e.,  N τ  is finite, and because of the slow decay of the null measurement probability. Both are discussed in the following two subsections.

7.1. Broadening Effect

We present an exact solution to the problem related to our experimental setup for both on-site and tracking measurement protocols. Previously, the broadening effect was studied in more generality for the on-site measurements, although the asymptotic behavior of large N was studied there [48]. In the following, we will discuss the broadening of the return time  n  for zero magnetic flux in detail.

7.1.1. On-Site Protocol (Broadening)

We first consider the broadening effect of the resonances of  n  using the on-site measurement protocol and  α = 0 . Let  F n  be the probability of finding the target for the first time at the  n -th measurement. The case under study is exactly solvable [15,49]. Specifically, with the eigenvalues of Equation (3), we obtain
F n = | z | 2 n = 1 1 | z | 2 2 | z | 2 ( n 2 ) n 2 ,
where  | z | 2 = 5 / 9 + 4 / 9 cos ( 3 γ τ ) . Here, we stick to the notation in [15], where in general, z stands for the zeros of the generating function. When  | z | 2 = 1 , we have  F 1 = 1 , and then,  n = 1 . Otherwise,  n = n = 1 n F n = 2 , which is a behavior that was presented in Figure 3c. Clearly, when  | z | 2  is slightly less than one, so is  F 1 , yet from the recurrence theorem [7,8], we have  lim N n ( N ) = 2 , implying a very slow decay of  F n | z | 2 ( n 2 )  for  n > 1 . Physically, close to  | z | 2 = 1 , we usually detect the system with the first click, but in rare events, we click no. Then, the wave function does not overlap with the detected state, and recording a yes becomes unlikely. On average, we find that the return clicks yes after  n = 2  attempts, which is remarkable since  F 1  is nearly one.
In a finite-time experiment, we find  n  (Equation (5)) using Equation (11)
n = 2 | z | 2 ( N 1 ) 1 + N ( 1 | z | 2 ) 1 | z | 2 ( N 1 ) 1 | z | 2 .
We will study this expression in the vicinity of the revival times, namely when  | z | 2 1 , where we also include the Zeno limit in this category. Note that if  | z | 2 = 1 , we have  n ( N ) = 1  for any N.
We note that the expressions in Equations (11) and (12) have the same form for a two-level system, except for a different function of  | z | 2  [49]. This indicates that for  α = 0 , the three-site model represents an effective two-level system.
Close to transitions, we use the small parameter  ϵ 2 = 1 | z | 2 . For the model under study,  ϵ 2 = ( 2 / 9 ) ( 3 γ τ 2 π k ) 2 , where  k = 0 , 1 ,  is the index for the k-th transition of  n . For example,  k = 0  is the Zeno limit, which corresponds to the first dip from the left in the upper panel in Figure 3a. Taking the limit of large N and  ϵ 2  to be small, we find
n = 2 exp ( N ϵ 2 ) 1 + N ϵ 2 .
Recall that close to the transition point,  n = 1  for large N. Here, by transition, we mean a transition for  n = 2  to  n = 1 , as we vary gamma tau across a resonance.
On the other hand, if we choose a control parameter like  γ τ  to be far from the transition, then  n 2 , since N is large.

7.1.2. Tracking Protocol (Broadening)

Now, let us consider the broadening effect of the resonances of  n  using the tracking protocol and  α = 0 . The probability of finding the quantum walker the first time is
F n = | z | 2 n = 1 2 | η | 4 | η | 2 + | z | 2 n 2 n 2 ,
where  | z | 2 = 5 / 9 + 4 / 9 cos ( 3 γ τ )  and  | η | 2 = 2 / 9 2 / 9 cos ( 3 γ τ ) . With  | ξ | 2 = | z | 2 + | η | 2 , the mean number is:
n = 2 | η | 4 | ξ | 4 2 | ξ | 2 + | ξ | 2 N N | ξ | 2 + N + 1 | ξ | 2 1 2 | η | 4 | ξ | 2 | ξ | 2 N | ξ | 2 | z | 2 | ξ | 2 1 | ξ | 2 | z | 2 | ξ | 2 1 2 | η | 4 | ξ | 2 | ξ | 2 N | ξ | 2 | z | 2 | ξ | 2 1
For small  ϵ 2 = ( 2 / 9 ) ( 3 γ τ 2 π k ) 2  close to the transition, we obtain an expression for the tracking case:
n 3 2 exp ( N ϵ 2 / 2 ) ( 1 + N ϵ 2 / 2 )
Close to the transition,  n = 1 , for any large enough N. If we choose a control parameter like  γ τ  to be far from the transition, then  n = 3 . Figure 8 compares the approximations for the on-site and tracking protocol in Equations (13) and (16) with the simulation and experimental data.

7.2. Slow Decay of the Null Measurement Probability

To explain the experimental findings of an additional dip (transition) in the mean first return time  n  at  α = 0.5 γ τ = 3.63  for both protocols (see Figure 3d,e and Figure 4d,e) as well as the plateau near  α = 0.5  for the on-site protocol in Figure 3e, which are absent in the theory for  N , we investigate the probability of null measurement, i.e., the probability that the quantum walker is not detected. The null measurement probability is defined as
S N = 1 n = 1 N F n .
It is zero in the limit  N  for the return problem [7,8,11]. Near special points where the three phase factors merge, the null measurement probabilities decay only very slowly to zero for increasing N, leading to the transition of  n  to 3 (tracking protocol) and 2 (on-site protocol) only for large  N > 1000  for  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) )  (Figure 7c). If  γ τ 3.63 n  shows a staircase behavior. The system is only partially thermalized until, for a larger number of measurements, the high-temperature limit is reached.
The probability of null measurement decreases exponentially to zero at non-special sampling rates, whereas the decay rate slows down considerably at special sampling rates. At the special point  ( γ τ , α ) = ( 2 π / 3 , π / 6 ) , the mean first return time  n = 1 , since the three phase factors match. This is also approximately the case near the special point  ( γ τ , α ) = ( 3.63 , 0.5 )  due to finite resolution. The null measurement probability is displayed in Figure 9 for the tracking and on-site protocol. This behavior is very similar to the Zeno effect at  τ 0  and is discussed in detail in Appendix B and Appendix C, by analyzing the eigenvalues of the survival operator (on-site protocol) and the stochastic matrix (tracking protocol), respectively.

8. First Hitting Return Times with Depolarization Noise

In this section, we show that noise in the system facilitates transitions to theoretically forbidden states, an effect that becomes significant as N increases. We model a system with the dynamics given by the Hamiltonian in Equation (2) with the basis states  { | 0 , | 1 , | 2 }  and the disconnected fourth state  | 3  subjected to depolarization noise [50], which represents a quantum noise channel where the qubit state is replaced by a completely mixed state with some probability p [51]. We assume that noise acts independently after each unitary operation. Thus, rather than the unitary evolution described by  ρ U ( τ ) ρ U ( τ ) , we consider an evolution where the unitary transformation is combined with the depolarization noise channel.
ρ ( 1 p ) U ( τ ) ρ U ( τ ) + p 4 I .
We compute the mean return time to the initial state  | 0  for both measurement protocols ( γ τ = 1 ) and different noise strengths in Figure 10. The mean return time under the influence of noise shows a plateau for noise parameters between  p = 1 %  and  p = 5 % , indicating that the topological effect is resilient to depolarization noise for up to  N 20 , which could explain our very good results on the noisy quantum computer. For large N, the mean first return time approaches  n = 4 , which is the total dimension of the Hilbert space including disconnected states.

9. Summary and Conclusions

We experimentally and theoretically investigated the monitored evolution of a quantum walker on a ring represented by a directed triangle graph with complex edge weights—a monitored chiral quantum walk. For this purpose, we used the capabilities of midcircuit measurements on IBM quantum devices. We were able to accurately confirm the predictions for the hitting times and detection probabilities of the general theory for a finite number of measurements. Remarkably, we utilize only dynamical decoupling as an error suppression scheme and no other error mitigation methods.
Hitting times and detection probabilities are closely related to the number of distinct eigenvalues (phase factors) of the unitary time-evolution operator  U = exp ( i H τ )  of the model Hamiltonian H during the measurement-free evolution time  τ  shown in Figure 2. To investigate them, we swept through the parameters of the phase-factor matching diagram and performed two different stroboscopic measurement protocols. In the first protocol, readout was performed only at the target site. The second protocol, known as the tracking protocol, involves measurements at each site along the ring. The main experimental result is that there are clear differences between both protocols, a feature not known for classical random walks. The onsite protocol shows quantum behavior. The mean return time is quantized and linked to a winding number. Moreover, the winding number of the return problem is equal to the dimensionality of the available Hilbert space. This was originally discovered in refs. [7,8] for periodic measurements and later found also for measurements at random times [21]. Since the dimensionality of the available Hilbert space changes when degenerate states occur, the winding number as well as the mean return time can jump between discrete values.
The tracking protocol exhibits quantum features when all the phase factors match, but otherwise shows classical behaviors. The results show that the postulates of measurement theory as well as the presence of a phase utilizing the onsite protocol could be confirmed on the IBM quantum computer, a non-trivial fact since  N 20  repeated noisy measurements are utilized.
We showed that finite resolution effects, which are clearly part of any experimental study, are a key feature of the hitting time statistics. This leads to a broadening of the mean return time and the detection probability because the detection is imperfect near special points, where two or three phase factors merge, due to finite  N τ . The finite resolution and the broadening effect are accompanied by a slow relaxation of the null measurement probability. The results show not only a broadening of the topological transitions but also metastable topological (see Figure 3e and Figure 4e) and chirality effects (see Figure 6), which disappear for the theory in the asymptotic limit.
We derived an analytical expression for the broadening of the  n = 2  to  n = 1  and back transition (on-site) and the  n = 3  to  n = 1  and back transition (tracking) for  α = 0  as a function of N. For both protocols, the resonances narrow as N increases. Furthermore, the additional resonances near the special points (but not exactly on them) disappear for growing N. The mean return time,  n  shows a crossover between different topological phases, which is revealed, e.g., as the staircase behavior for the on-site protocol (Figure 7c). A similar effect was found for a theoretical perturbed ring [19]. As mentioned, the tracking protocol of the monitored quantum walk has more of the character of a classical random walk. Because of the finite resolution, quantum effects are present close to the revival time. This can be seen as partial thermalization [52] during a quantum-to-classical crossover. Only for a large number of measurements is the classical limit and maximum  n  is reached, except for special  γ τ  and  α .
There are several future directions in which our work can be extended. Here, we focus on small systems. More generally, one could scale up the process by increasing the number of measurements and/or increasing the size of the system. According to our simulation in Section 8 in specific scenarios, noise will result in a quantized yet amplified value of  n . This increase reflects the emergence of accessible states that, although disconnected in the Hamiltonian, become linked due to the influence of noise.
Furthermore, one could ask whether the quantum computer exhibits a transition to a more classical behavior, for example, the elimination of the topological effect found for the mean return time or how partial information about the trajectories by measuring multiple but not all sites change the topological effect. Challenges for the implementation of larger systems include the necessity of methods like Trotteriation as well as error mitigation for mid-circuit measurements [45,46], which suffer not only from classical read-out error but also from projection errors. The computation of the first-return time is very suitable to benchmark these error mitigation methods. Furthermore, one could explore the possibility of measuring the readout rate-controlled oscillatory behavior of the energy expectation values corresponding to a certain trajectory of the monitored dynamics.

Author Contributions

E.B. and S.T. conceived and designed the project. S.T., S.R. and Q.W. ran hardware, numerical experiments, and classical simulations. S.T., E.B., K.Z., S.R., R.Y. and Q.W. discussed the theory and the results. E.B. and S.T. drafted the manuscript with input from all authors. All authors have read and agreed to the published version of the manuscript.

Funding

Israel Science Foundation grant 1614/21 is acknowledged.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Acknowledgments

We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team. In this paper, we used the IBM Sherbrooke processor, which is an IBM Quantum Eagle Processor. Q.W., S.R., and R.Y. acknowledge the use of the IBM Quantum Experience and the IBMQ-research program. We acknowledge helpful discussions with David Kessler.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Phase Factor Matching Diagram and Eigenstates

This appendix provides the analytical solutions of the phase factor matching equations and the eigenstates. As mentioned in the text, the eigenvalues of
H = γ e i α | 0 1 | + | 1 2 | + | 2 0 | + h . c .
are
E k = 2 γ cos 2 π k 3 + α , k = 0 , 1 , 2 .
Its eigenvectors for finite  α  are:
| E 0 = 1 3 | 0 + | 1 + | 2 ,
| E 1 = 1 2 1 3 i | 0 + 1 3 + i | 1 + 2 3 | 2
and
| E 2 = 1 2 1 3 + i | 0 + 1 3 i | 1 + 2 3 | 2
The eigenstates for  α = 0  are:
| E 0 = 1 3 | 0 + | 1 + | 2
and for the degenerate eigenvalue  E 1 = E 2 :
| E 1 = 1 2 | 0 + | 1
and
| E 2 = 1 2 | 0 + | 2
The solutions of the following equations (matching of phase factors):
exp ( i E k τ ) = exp ( i E l τ ) , ( k l ) , k , l = 0 , 1 , 2
are for  k = 1  and  l = 2 :
γ τ = 2 n π 3 sin ( α )
and
γ τ = ( 2 n + 1 ) π 3 sin ( α )
for  k = 1  and  l = 0 :
γ τ = n π sin ( α + π / 6 ) + cos ( α )
for  k = 2  and  l = 0 :
γ τ = n π sin ( α + π / 6 ) + cos ( α )
for  n Z .
Figure A1. (a) Phase factor matching diagram and paths through the parameter space labeled (I), (II), (III), and (IV), which are indicated with red dashed lines and correspond to (cf), respectively. The eigenvalues close to one lead to additional dips and plateaus in the mean return time, whereas the eigenvalues exactly equal to one indicate transitions for the theory  N . (b) Illustration of the on-site measurement protocol. (cf) Eigenvalue spectrum of the survival operator for the same parameters used for the mean return time in Figure 3. (c) For  α = 0 , the eigenvalues are one for  γ τ = 0 , 2 π / 3 , 4 π / 3  and  6 π / 3 , leading to transitions in the mean return time [path (I)]. (d) For  α = 0.5 , the eigenvalues are one for  γ τ 0 , 1.82 , 3.50 , 3.62 , 3.78 , 5.44 . The three eigenvalues  | λ | = 1  for  γ τ 3.50 , 3.62 , 3.78  are very close, so almost three phase factors match, leading to a transition to one of the mean return times [path (II)]. In (e) [path (III)] and (f) [path (IV)],  | λ |  is close to one between  α 0.3  and  α 0.7  leading to a plateau for  N = 20 .
Figure A1. (a) Phase factor matching diagram and paths through the parameter space labeled (I), (II), (III), and (IV), which are indicated with red dashed lines and correspond to (cf), respectively. The eigenvalues close to one lead to additional dips and plateaus in the mean return time, whereas the eigenvalues exactly equal to one indicate transitions for the theory  N . (b) Illustration of the on-site measurement protocol. (cf) Eigenvalue spectrum of the survival operator for the same parameters used for the mean return time in Figure 3. (c) For  α = 0 , the eigenvalues are one for  γ τ = 0 , 2 π / 3 , 4 π / 3  and  6 π / 3 , leading to transitions in the mean return time [path (I)]. (d) For  α = 0.5 , the eigenvalues are one for  γ τ 0 , 1.82 , 3.50 , 3.62 , 3.78 , 5.44 . The three eigenvalues  | λ | = 1  for  γ τ 3.50 , 3.62 , 3.78  are very close, so almost three phase factors match, leading to a transition to one of the mean return times [path (II)]. In (e) [path (III)] and (f) [path (IV)],  | λ |  is close to one between  α 0.3  and  α 0.7  leading to a plateau for  N = 20 .
Entropy 26 00869 g0a1
Figure A2. (a) Phase factor matching diagram and paths through the parameter space labeled (I), (II), (III), and (IV), which are indicated with red dashed lines and correspond to (cf), respectively. (b) Illustration of the tracking protocol. (cf) The eigenvalues of  G tar  for the same parameters as the mean return time in Figure 4. Two nearly degenerate eigenvalues close to one lead to additional dips in the mean return time, while two degenerate eigenvalues exactly at one indicate transitions for the theory  N . (c) For  α = 0 , the eigenvalues are degenerate, and one for  γ τ = 0 , 2 π / 3 , 4 π / 3  and  6 π / 3 , which leads to transitions of the mean return time [path (I)]. (d) For  α = 0  and  γ τ = 3.63 , the eigenvalues are almost degenerate and one, which leads to a transition for  N = 20  due to finite resolution effects [path (II)]. (e) For  γ τ = 3 π / 3 , the eigenvalues are almost degenerate and one for  α 0.3  and  α 0.7  [path (III)]. (f) For  γ τ = 2 π / 3 , the eigenvalues are degenerate and one for  γ τ = π / 6  indicating a transition for all N [path (IV)].
Figure A2. (a) Phase factor matching diagram and paths through the parameter space labeled (I), (II), (III), and (IV), which are indicated with red dashed lines and correspond to (cf), respectively. (b) Illustration of the tracking protocol. (cf) The eigenvalues of  G tar  for the same parameters as the mean return time in Figure 4. Two nearly degenerate eigenvalues close to one lead to additional dips in the mean return time, while two degenerate eigenvalues exactly at one indicate transitions for the theory  N . (c) For  α = 0 , the eigenvalues are degenerate, and one for  γ τ = 0 , 2 π / 3 , 4 π / 3  and  6 π / 3 , which leads to transitions of the mean return time [path (I)]. (d) For  α = 0  and  γ τ = 3.63 , the eigenvalues are almost degenerate and one, which leads to a transition for  N = 20  due to finite resolution effects [path (II)]. (e) For  γ τ = 3 π / 3 , the eigenvalues are almost degenerate and one for  α 0.3  and  α 0.7  [path (III)]. (f) For  γ τ = 2 π / 3 , the eigenvalues are degenerate and one for  γ τ = π / 6  indicating a transition for all N [path (IV)].
Entropy 26 00869 g0a2

Appendix B. Details of the On-Site Protocol

The probability  F n  of finding the quantum walker for the first time is for the on-site protocol [11]:
F n = | ψ tar | ( U ( I | ψ tar ψ tar | ) ) n 1 U | ψ in | 2
where  I  is the identity matrix,  | ψ t a r  is the target site and  | ψ i n  is the initial site. To explain the experimental findings of a transition from  n = 3  to  n = 1  for  α = 0.5 γ τ = 3.63  and  N = 20  in Figure 3c and in the simulation in Figure 7a, which changes to three close transitions from  n = 3  to  n = 2  (on-site protocol), for  N > 1000 , we analyze the survival operator for the on-site protocol.
The parameter regime is indicated by a dashed vertical line in Figure A1a at  α = 0.5 . The line crosses five phase lines where two phase factors merge. Three of them are very close. For very large N in the on-site protocol, five transitions from  n = 3  to  n = 2  are seen.
What is the effect of the nearby special point ( α = π / 6 γ τ = 2 π / 3 ) where the three phase factors merge? Does it lead to a slow relaxation of the null measurement probability and, therefore, to the aforementioned transition that is present for  N = 20  measurements?
The survival operator for the on-site protocol is defined as
S ( τ ) = I | ψ tar ψ tar | U
The eigenvalues of the survival operator are key to understanding the processes and to answering the questions at the beginning of the section. The absolute values of two eigenvalues  | λ 1 |     | λ 2 |  are close to one for  γ τ = 3.63  (see Figure A1d). The plateau in Figure 3e coincides with the eigenvalue  | λ | 1  between  α = 0.3  and  α = 0.7 .

Appendix C. Details of the Tracking Protocol

For the time evolution that takes into account unitary evolution and global measurements, we define the Markov or stochastic matrix G [36]:
G = x , x X x | U | x 2 | x x | ,
where  X = { | 0 , | 1 , | 2 }  and  x | U | x 2  are the transition probabilities. The probability  F n  of finding the quantum walker for the first time is then:
F n = ψ tar | G ( I | ψ tar ψ tar | ) n 1 G | ψ in ,
For  α = 0 , the eigenvalues of G are real, and the absolute value is less than or equal to one.  n  is discontinuous at special points when the eigenvalue  λ = 1  becomes degenerate. For a finite magnetic flux, the eigenvalues except one ( λ = 1 ) become complex and appear as conjugated complex pairs. There are special points for finite  α = π / 6 , π / 3 , π / 2 , ,  where for certain values of  γ τ , the eigenvalues of G are degenerate and one (see Figure A2). Therefore, no special points appear at  α = 0.5  and  n = 3  for all  γ τ  except in the Zeno regime for  γ τ = 0 . In Figure 7b,  n  with a finite magnetic flux is shown. For  N = 1000 , no transitions from 3 to 1 and back are present (except in the Zeno limit), while for  N = 20 , the transitions are clearly present due to finite resolution. Following ref. [36], we define:
G tar = G I | ψ tar ψ tar |
G | ψ in  is written in the eigenbasis of  G tar . The left and right eigenstates are defined in the usual way:  G tar | μ R = μ | μ R  and  μ L | G tar = μ μ L | , where  μ  is the eigenvalue. The null measurement probability (probability that the quantum walker is not detected) is then given by:
S N = μ e N ln ( μ ) 1 μ μ L | G | ψ in μ L | μ R ψ tar | μ R
The null measurement probability is characterized by  μ  as well as the overlap between  | μ R  and the target state  | ψ tar . For the special point  ( π / 6 , 2 π / 3 ) , the overlap is zero, and the eigenvalue is  μ = 1 . Near the special point  ( 0.5 , 3.63 ) , there is a finite overlap, and the eigenvalue is close to one, leading to a very slow relaxation of the null measurement probability. Therefore,  n = 1  for  N = 20 . For an increasing number of N, the system experiences a transition from  n = 1  to  n = 3 , driving the system into the high-temperature limit. Thus, for  N = 20 , we consider that the system is still in the quantum regime.

Appendix D. Simulated Detection Probability

In Figure A3, we present the simulation of the detection probability, which is in very good agreement with the experimental data shown in Figure 5.
Figure A3. The same as Figure 5 but as a simulation. We observe that the experiment and the simulations agree very well for  N = 10 .
Figure A3. The same as Figure 5 but as a simulation. We observe that the experiment and the simulations agree very well for  N = 10 .
Entropy 26 00869 g0a3

References

  1. Aharonov, Y.; Davidovich, L.; Zagury, N. Quantum random walks. Phys. Rev. A 1993, 48, 1687–1690. [Google Scholar] [CrossRef] [PubMed]
  2. Kempe, J. Quantum random walks: An introductory overview. Contemp. Phys. 2003, 44, 307–327. [Google Scholar] [CrossRef]
  3. Portugal, R. Quantum Walks and Search Algorithms; Springer Publishing Company, Incorporated: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  4. Krovi, H.; Brun, T.A. Hitting time for quantum walks on the hypercube. Phys. Rev. A 2006, 73, 032341. [Google Scholar] [CrossRef]
  5. Krovi, H.; Brun, T.A. Quantum walks with infinite hitting times. Phys. Rev. A 2006, 74, 042334. [Google Scholar] [CrossRef]
  6. Varbanov, M.; Krovi, H.; Brun, T.A. Hitting time for the continuous quantum walk. Phys. Rev. A 2008, 78, 022324. [Google Scholar] [CrossRef]
  7. Grünbaum, F.A.; Velázquez, L.; Werner, A.H.; Werner, R.F. Recurrence for Discrete Time Unitary Evolutions. Commun. Math. Phys. 2013, 320, 543–569. [Google Scholar] [CrossRef]
  8. Bourgain, J.; Grünbaum, F.A.; Velázquez, L.; Wilkening, J. Quantum Recurrence of a Subspace and Operator-Valued Schur Functions. Commun. Math. Phys. 2014, 329, 1031–1067. [Google Scholar] [CrossRef]
  9. 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]
  10. Dhar, S.; Dasgupta, S.; Dhar, A. Quantum time of arrival distribution in a simple lattice model. J. Phys. A Math. Theor. 2015, 48, 115304. [Google Scholar] [CrossRef]
  11. Friedman, H.; Kessler, D.A.; Barkai, E. Quantum walks: The first detected passage time problem. Phys. Rev. E 2017, 95, 032141. [Google Scholar] [CrossRef]
  12. Walter, B.; Perfetto, G.; Gambassi, A. Thermodynamic phases in first detected return times of quantum many-body systems. arXiv 2023, arXiv:2311.05585. [Google Scholar]
  13. Purkayastha, A.; Imparato, A. Interaction-induced transition in quantum many-body detection probability. Phys. Rev. A 2024, 109, L020202. [Google Scholar] [CrossRef]
  14. 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]
  15. 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]
  16. Thiel, F.; Mualem, I.; Meidan, D.; Barkai, E.; Kessler, D.A. Dark states of quantum search cause imperfect detection. Phys. Rev. Res. 2020, 2, 043107. [Google Scholar] [CrossRef]
  17. Modak, R.; Aravinda, S. Non-Hermitian description of sharp quantum resetting. arXiv 2023, arXiv:2303.03790. [Google Scholar]
  18. Kulkarni, M.; Majumdar, S.N. First detection probability in quantum resetting via random projective measurements. J. Phys. Math. Theor. 2023, 56, 385003. [Google Scholar] [CrossRef]
  19. Wang, Y.J.; Yin, R.Y.; Dou, L.Y.; Zhang, A.N.; Song, X.B. Quantum first detection of a quantum walker on a perturbed ring. Phys. Rev. Res. 2023, 5, 013202. [Google Scholar] [CrossRef]
  20. Meng, X.; Chen, L. The first detection time of one-dimensional systems with long-range interactions. Int. J. Mod. Phys. B 2024, 38, 2450190. [Google Scholar] [CrossRef]
  21. Kessler, D.A.; Barkai, E.; Ziegler, K. First-detection time of a quantum state under random probing. Phys. Rev. A 2021, 103, 022222. [Google Scholar] [CrossRef]
  22. Wanzambi, E.; Andersson, S. Quantum Computing: Implementing Hitting Time for Coined Quantum Walks on Regular Graphs. arXiv 2021, arXiv:2108.02723. [Google Scholar]
  23. Laneve, L.; Tacchino, F.; Tavernelli, I. On Hitting Times for General Quantum Markov Processes. Quantum 2023, 7, 1056. [Google Scholar] [CrossRef]
  24. Magniez, F.; Nayak, A.; Richter, P.C.; Santha, M. On the Hitting Times of Quantum Versus Random Walks. Algorithmica 2012, 63, 91–116. [Google Scholar] [CrossRef]
  25. Chen, X.X.; Wang, Y.J.; Zhang, A.N.; Meng, Z.; Wu, Q.Y.; Song, X.B.; Shi, X.S. Unmonitored and monitored recurrence in single-photon quantum walks. Phys. Rev. A 2024, 110, 012219. [Google Scholar] [CrossRef]
  26. Córcoles, A.D.; Takita, M.; Inoue, K.; Lekuch, S.; Minev, Z.K.; Chow, J.M.; Gambetta, J.M. Exploiting Dynamic Quantum Circuits in a Quantum Algorithm with Superconducting Qubits. Phys. Rev. Lett. 2021, 127, 100501. [Google Scholar] [CrossRef]
  27. Koh, J.M.; Sun, S.N.; Motta, M.; Minnich, A.J. Measurement-induced entanglement phase transition on a superconducting quantum processor with mid-circuit readout. Nat. Phys. 2023, 19, 1314–1319. [Google Scholar] [CrossRef]
  28. Redner, S. A Guide to First-Passage Processes; Cambridge University Press: Cambridge, UK, 2001. [Google Scholar] [CrossRef]
  29. Pólya, G. Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz. Math. Ann. 1921, 84, 149–160. [Google Scholar] [CrossRef]
  30. Yi, J. Shell game with a quantum pea. Europhys. Lett. 2024, 146, 20001. [Google Scholar] [CrossRef]
  31. Liu, Q.; Kessler, D.A.; Barkai, E. Designing exceptional-point-based graphs yielding topologically guaranteed quantum search. Phys. Rev. Res. 2023, 5, 023141. [Google Scholar] [CrossRef]
  32. Yin, R.; Barkai, E. Restart Expedites Quantum Walk Hitting Times. Phys. Rev. Lett. 2023, 130, 050802. [Google Scholar] [CrossRef]
  33. Štefaňák, M.; Jex, I.; Kiss, T. Recurrence and Pólya Number of Quantum Walks. Phys. Rev. Lett. 2008, 100, 020501. [Google Scholar] [CrossRef] [PubMed]
  34. Nitsche, T.; Barkhofen, S.; Kruse, R.; Sansoni, L.; Štefaňák, M.; Gábris, A.; Potoček, V.; Kiss, T.; Jex, I.; Silberhorn, C. Probing measurement-induced effects in quantum walks via recurrence. Sci. Adv. 2018, 4, eaar6444. [Google Scholar] [CrossRef] [PubMed]
  35. Kac, M. On Distributions of Certain Wiener Functionals. Trans. Am. Math. Soc. 1949, 65, 1–13. [Google Scholar] [CrossRef]
  36. Didi, A.; Barkai, E. Measurement-induced quantum walks. Phys. Rev. E 2022, 105, 054108. [Google Scholar] [CrossRef]
  37. Misra, B.; Sudarshan, E.C.G. The Zeno’s paradox in quantum theory. J. Math. Phys. 1977, 18, 756–763. [Google Scholar] [CrossRef]
  38. Thorbeck, T.; Xiao, Z.; Kamal, A.; Govia, L.C.G. Readout-Induced Suppression and Enhancement of Superconducting Qubit Lifetimes. Phys. Rev. Lett. 2024, 132, 090602. [Google Scholar] [CrossRef]
  39. Zimborás, Z.; Faccin, M.; Kádár, Z.; Whitfield, J.D.; Lanyon, B.P.; Biamonte, J. Quantum Transport Enhancement by Time-Reversal Symmetry Breaking. Sci. Rep. 2013, 3, 2361. [Google Scholar] [CrossRef] [PubMed]
  40. Bottarelli, A.; Frigerio, M.; Paris, M.G.A. Quantum routing of information using chiral quantum walks. AVS Quantum Sci. 2023, 5, 025001. [Google Scholar] [CrossRef]
  41. Annoni, E.; Frigerio, M.; Paris, M.G.A. Enhanced quantum transport in chiral quantum walks. Quantum Inf. Process. 2024, 23, 117. [Google Scholar] [CrossRef]
  42. Shapira, Y.; Manovitz, T.; Akerman, N.; Stern, A.; Ozeri, R. Quantum Simulations of Interacting Systems with Broken Time-Reversal Symmetry. Phys. Rev. X 2023, 13, 021021. [Google Scholar] [CrossRef]
  43. Cohen-Tannoudji, C.; Diu, B.; Laloë, F. Quantum Mechanics; Number v. 1 in A Wiley—Interscience publication; Wiley: Hoboken, NJ, USA, 1977. [Google Scholar]
  44. Vidal, G.; Dawson, C.M. Universal quantum circuit for two-qubit transformations with three controlled-NOT gates. Phys. Rev. A 2004, 69, 010301. [Google Scholar] [CrossRef]
  45. Koh, J.M.; Koh, D.E.; Thompson, J. Readout Error Mitigation for Mid-Circuit Measurements and Feedforward. arXiv 2024, arXiv:2406.07611. [Google Scholar]
  46. Gupta, R.S.; van den Berg, E.; Takita, M.; Riste, D.; Temme, K.; Kandala, A. Probabilistic error cancellation for dynamic quantum circuits. Phys. Rev. A 2024, 109, 062617. [Google Scholar] [CrossRef]
  47. Ezzell, N.; Pokharel, B.; Tewala, L.; Quiroz, G.; Lidar, D.A. Dynamical decoupling for superconducting qubits: A performance survey. Phys. Rev. Appl. 2023, 20, 064027. [Google Scholar] [CrossRef]
  48. Yin, R.; Wang, Q.; Tornow, S.; Barkai, E. Restart uncertainty relation for monitored quantum dynamics. arXiv 2024, arXiv:2401.01307. [Google Scholar]
  49. Tornow, S.; Ziegler, K. Measurement-induced quantum walks on an IBM quantum computer. Phys. Rev. Res. 2023, 5, 033089. [Google Scholar] [CrossRef]
  50. Urbanek, M.; Nachman, B.; Pascuzzi, V.R.; He, A.; Bauer, C.W.; de Jong, W.A. Mitigating Depolarizing Noise on Quantum Computers with Noise-Estimation Circuits. Phys. Rev. Lett. 2021, 127, 270502. [Google Scholar] [CrossRef]
  51. Chen, Y.T.; Farquhar, C.; Parrish, R.M. Low-rank density-matrix evolution for noisy quantum circuits. NPJ Quantum Inf. 2021, 7, 61. [Google Scholar] [CrossRef]
  52. Santini, A.; Solfanelli, A.; Gherardini, S.; Giachetti, G. Observation of partial and infinite-temperature thermalization induced by repeated measurements on a quantum hardware. J. Phys. Commun. 2023, 7, 065007. [Google Scholar] [CrossRef]
Figure 1. Scheme of the tight-binding model for a ring with three sites ( | 0 | 1  and  | 2 ) pierced by a magnetic flux  α , corresponding to a directed or chiral triangle graph with complex edge weights, for two different measurement protocols.  γ  denotes the strength of the hopping matrix element. Left panel: The on-site protocol measures periodically only the target state  | 0 . Right panel: the tracking protocol periodically measures all sites. The measurement is indicated with a measuring device. In both cases, the hitting time is the first time when the system is detected in state  | 0 .
Figure 1. Scheme of the tight-binding model for a ring with three sites ( | 0 | 1  and  | 2 ) pierced by a magnetic flux  α , corresponding to a directed or chiral triangle graph with complex edge weights, for two different measurement protocols.  γ  denotes the strength of the hopping matrix element. Left panel: The on-site protocol measures periodically only the target state  | 0 . Right panel: the tracking protocol periodically measures all sites. The measurement is indicated with a measuring device. In both cases, the hitting time is the first time when the system is detected in state  | 0 .
Entropy 26 00869 g001
Figure 2. Parameters where two or three eigenvalues of the unitary U are degenerate (phase factor matching diagram). In the plain  ( γ τ , α ) , the phase factors  exp ( i E k τ )  with  k = 0 , 1 , 2  match in pairs or triplets. Colors describe the matching of two phase factors, for example,  exp ( i E 0 τ ) = exp ( i E 1 τ )  in red, and similarly for the pairs  ( E 0 , E 2 )  (green) and  ( E 1 , E 2 )  (orange). The matching of all three phase factors is shown as blue circles or a blue line at  γ τ = 0  indicating the Zeno regime. Examples where three phase factors match are  ( α , γ τ ) = ( 0 , 0 ) , ( 0 , 2 k π / 3 ) , ( π / 6 , 2 π / 3 ) , ( π / 3 , 2 k π / 3 ) , ( π / 2 , 2 π / 3 ) , . The two dashed vertical lines ( α = 0  and  α = 0.5 ) as well as the horizontal bands ( γ τ = 2 π / 3  and  γ τ = 3 π / 3 ) indicate the parameter regime considered for the computation of the first hitting return time on  I B M S h e r b r o o k e . The phase factor matching diagram is obtained experimentally by studying the dark states (on-site protocol) in Figure 5c.
Figure 2. Parameters where two or three eigenvalues of the unitary U are degenerate (phase factor matching diagram). In the plain  ( γ τ , α ) , the phase factors  exp ( i E k τ )  with  k = 0 , 1 , 2  match in pairs or triplets. Colors describe the matching of two phase factors, for example,  exp ( i E 0 τ ) = exp ( i E 1 τ )  in red, and similarly for the pairs  ( E 0 , E 2 )  (green) and  ( E 1 , E 2 )  (orange). The matching of all three phase factors is shown as blue circles or a blue line at  γ τ = 0  indicating the Zeno regime. Examples where three phase factors match are  ( α , γ τ ) = ( 0 , 0 ) , ( 0 , 2 k π / 3 ) , ( π / 6 , 2 π / 3 ) , ( π / 3 , 2 k π / 3 ) , ( π / 2 , 2 π / 3 ) , . The two dashed vertical lines ( α = 0  and  α = 0.5 ) as well as the horizontal bands ( γ τ = 2 π / 3  and  γ τ = 3 π / 3 ) indicate the parameter regime considered for the computation of the first hitting return time on  I B M S h e r b r o o k e . The phase factor matching diagram is obtained experimentally by studying the dark states (on-site protocol) in Figure 5c.
Entropy 26 00869 g002
Figure 3. (a) Classical simulation of the mean return time  n  for  N = 20  for the on-site protocol as a function of  γ τ  and  α . For  n = 1 , three phase factors match (dark blue), for  n = 2 , two phase factors match (medium blue) and for  n = 3 , all phase factors are different (white). The paths through the parameter space labeled as (I), (II), (III) and (IV) are indicated with red dashed lines and correspond to (cf), respectively. Compared to the phase factor matching diagram in Figure 2, the lines are broadened due to finite N. (b) Quantum circuit for two qubits representing the three localized states for the on-site protocol with the initial state  | 0 = | 01 , where the unitary  U = exp ( i H τ )  and measurements are applied alternately. Only the upper qubit is measured, since we need to detect the state  | 0  while we do not want to receive the information that allows us to distinguish the states  | 1  and  | 2 . (cf) Mean return time  n  recorded on IBM Sherbrooke (light blue circles), obtained with the asymptotic theory for  N  (black solid lines) and simulated for  N = 20  (blue dashed lines): (c) [path (I)]  n  versus  γ τ  for  α = 0 . (d) [path (II)] When  α = 0.5 , we almost always find  n = 3 . As explained in the text, this is related to the removal of energy-level degeneracy when the magnetic flux is turned on. Note that some fine structure details predicted by the asymptotic theory, for  α = 0.5 , are washed out in the experiment, see the three nearby dips that merge into one resonance here. (e) [path (III)] Mean return time  n  as a function of  α  for  γ τ = 3 π / 3 n  develops a plateau, as well as additional transitions that are absent for  N . (f) [path (IV)] Mean return time  n  for  γ τ = 2 π / 3  as a function of  α . In this example, clearly the asymptotic theory is not predictive, while finite time simulations agree with experiments.
Figure 3. (a) Classical simulation of the mean return time  n  for  N = 20  for the on-site protocol as a function of  γ τ  and  α . For  n = 1 , three phase factors match (dark blue), for  n = 2 , two phase factors match (medium blue) and for  n = 3 , all phase factors are different (white). The paths through the parameter space labeled as (I), (II), (III) and (IV) are indicated with red dashed lines and correspond to (cf), respectively. Compared to the phase factor matching diagram in Figure 2, the lines are broadened due to finite N. (b) Quantum circuit for two qubits representing the three localized states for the on-site protocol with the initial state  | 0 = | 01 , where the unitary  U = exp ( i H τ )  and measurements are applied alternately. Only the upper qubit is measured, since we need to detect the state  | 0  while we do not want to receive the information that allows us to distinguish the states  | 1  and  | 2 . (cf) Mean return time  n  recorded on IBM Sherbrooke (light blue circles), obtained with the asymptotic theory for  N  (black solid lines) and simulated for  N = 20  (blue dashed lines): (c) [path (I)]  n  versus  γ τ  for  α = 0 . (d) [path (II)] When  α = 0.5 , we almost always find  n = 3 . As explained in the text, this is related to the removal of energy-level degeneracy when the magnetic flux is turned on. Note that some fine structure details predicted by the asymptotic theory, for  α = 0.5 , are washed out in the experiment, see the three nearby dips that merge into one resonance here. (e) [path (III)] Mean return time  n  as a function of  α  for  γ τ = 3 π / 3 n  develops a plateau, as well as additional transitions that are absent for  N . (f) [path (IV)] Mean return time  n  for  γ τ = 2 π / 3  as a function of  α . In this example, clearly the asymptotic theory is not predictive, while finite time simulations agree with experiments.
Entropy 26 00869 g003
Figure 4. (a) Classical simulation of the mean return time  n  for  N = 20  for the tracking protocol as a function of  γ τ  and  α . For  n = 1 , three phase factors match (dark blue), and for  n = 3 , all phase factors are different (white). Paths through the parameter space labeled (I), (II), (III) and (IV) are indicated with red dashed lines and correspond to (cf), respectively. Compared to the phase factor matching diagram in Figure 2, the dark blue areas are broadened due to finite N. (b) Quantum circuit for two qubits representing the three localized states for the tracking protocol with the initial state  | 0 = | 00 , where the unitary  U = exp ( i H τ )  and the measurements are applied alternately. (cf) Mean return time  n  recorded on IBM Sherbrooke (light blue circles), obtained with the asymptotic theory for  N  (black solid line) and simulated for  N = 20  (blue dashed line): (c) [path (I)]  n  versus  γ τ  for  α = 0 n  is quantized ( n = 3 ), and its value, for almost any choice of  γ τ , differs by unity from the on-site measurement protocol, the case presented in Figure 3c when  n = 2 . (d) [path (II)] For finite magnetic flux  α = 0.5 , the transitions to  n = 1  are absent except in the Zeno limit at  γ τ = 0  for  N . This is different for  N = 20 . The result for  α = 0.5  shows a transition to approximately  n = 1  at  γ τ = 3.63 . (e) [path (III)] Mean return time  n  for  γ τ = 3 π / 3 . For  N = 20 n  develops additional transitions that are absent for  N  (f) [path (IV)] Mean return time  n  for  γ τ = 2 π / 3  as a function of  α . We see a clear broadening effect of the resonance, while in (d,e), broadened resonances show up, which are not present in the asymptotic theory.
Figure 4. (a) Classical simulation of the mean return time  n  for  N = 20  for the tracking protocol as a function of  γ τ  and  α . For  n = 1 , three phase factors match (dark blue), and for  n = 3 , all phase factors are different (white). Paths through the parameter space labeled (I), (II), (III) and (IV) are indicated with red dashed lines and correspond to (cf), respectively. Compared to the phase factor matching diagram in Figure 2, the dark blue areas are broadened due to finite N. (b) Quantum circuit for two qubits representing the three localized states for the tracking protocol with the initial state  | 0 = | 00 , where the unitary  U = exp ( i H τ )  and the measurements are applied alternately. (cf) Mean return time  n  recorded on IBM Sherbrooke (light blue circles), obtained with the asymptotic theory for  N  (black solid line) and simulated for  N = 20  (blue dashed line): (c) [path (I)]  n  versus  γ τ  for  α = 0 n  is quantized ( n = 3 ), and its value, for almost any choice of  γ τ , differs by unity from the on-site measurement protocol, the case presented in Figure 3c when  n = 2 . (d) [path (II)] For finite magnetic flux  α = 0.5 , the transitions to  n = 1  are absent except in the Zeno limit at  γ τ = 0  for  N . This is different for  N = 20 . The result for  α = 0.5  shows a transition to approximately  n = 1  at  γ τ = 3.63 . (e) [path (III)] Mean return time  n  for  γ τ = 3 π / 3 . For  N = 20 n  develops additional transitions that are absent for  N  (f) [path (IV)] Mean return time  n  for  γ τ = 2 π / 3  as a function of  α . We see a clear broadening effect of the resonance, while in (d,e), broadened resonances show up, which are not present in the asymptotic theory.
Entropy 26 00869 g004
Figure 5. Detection probability  0 P det 1  as a function of the sampling time  γ τ  and the phase  ϕ  as well as  γ τ  and magnetic flux  α  obtained from IBM Sherbrooke with  N = 10  for the on-site and tracking protocol. The dark blue color corresponds to  P det = 0  (dark state), while the white color corresponds to  P det = 1  (bright state). (a P det  as a function of  γ τ  and  ϕ  for the on-site protocol. Dark states are found when  ϕ = π  is the result of destructive interference and for  γ τ 0  due to the Zeno effect. Additional horizontal bands show dark states, which are found when the time of revival in the initial state is the same as the sampling time  γ τ  and  α = 0 . (b P det  as a function of  γ τ  and  ϕ  ( α = 0 ) for the tracking protocol. The dark states found for  ϕ = π  for the on-site protocol turn bright when the tracking method is used, since the latter breaks spatial symmetry, while the former does not. The horizontal dark bands are due to revivals that forbid detection of the system in the target state. (c,d P det  as a function of  γ τ  and magnetic flux  α  ( ϕ = 0 ). The on-site protocol (c) and the tracking protocol (d) exhibit vastly different trends, i.e., dark states are present in the tracking protocol where three phase factors match and in the on-site protocol where two and three phase factors match. As explained in the text, (c) yields the phase factor matching diagram shown in Figure 2, while (d) corresponds to three phase factors matching, which are indicated by blue circles in Figure 2.
Figure 5. Detection probability  0 P det 1  as a function of the sampling time  γ τ  and the phase  ϕ  as well as  γ τ  and magnetic flux  α  obtained from IBM Sherbrooke with  N = 10  for the on-site and tracking protocol. The dark blue color corresponds to  P det = 0  (dark state), while the white color corresponds to  P det = 1  (bright state). (a P det  as a function of  γ τ  and  ϕ  for the on-site protocol. Dark states are found when  ϕ = π  is the result of destructive interference and for  γ τ 0  due to the Zeno effect. Additional horizontal bands show dark states, which are found when the time of revival in the initial state is the same as the sampling time  γ τ  and  α = 0 . (b P det  as a function of  γ τ  and  ϕ  ( α = 0 ) for the tracking protocol. The dark states found for  ϕ = π  for the on-site protocol turn bright when the tracking method is used, since the latter breaks spatial symmetry, while the former does not. The horizontal dark bands are due to revivals that forbid detection of the system in the target state. (c,d P det  as a function of  γ τ  and magnetic flux  α  ( ϕ = 0 ). The on-site protocol (c) and the tracking protocol (d) exhibit vastly different trends, i.e., dark states are present in the tracking protocol where three phase factors match and in the on-site protocol where two and three phase factors match. As explained in the text, (c) yields the phase factor matching diagram shown in Figure 2, while (d) corresponds to three phase factors matching, which are indicated by blue circles in Figure 2.
Entropy 26 00869 g005
Figure 6. Simulation of the difference of the total detection probability  Δ P det = P det ( | ψ in = | 1 ) P det ( | ψ in = | 2 )  with the different initial states  | 1  and  | 2 , which are not the target states as a function of the sampling time  γ τ , and magnetic flux  α  ( N = 10 ) for the on-site (upper panel) and tracking protocol (lower panel).
Figure 6. Simulation of the difference of the total detection probability  Δ P det = P det ( | ψ in = | 1 ) P det ( | ψ in = | 2 )  with the different initial states  | 1  and  | 2 , which are not the target states as a function of the sampling time  γ τ , and magnetic flux  α  ( N = 10 ) for the on-site (upper panel) and tracking protocol (lower panel).
Entropy 26 00869 g006
Figure 7. Simulation of the mean return time  n  versus  γ τ  and N for  α = 0.5 . (a) For  N = 20  (red dashed line), the fine structure at  γ τ 3.49 , 3.63  and  3.78  predicted by asymptotic theory  N  is washed out, unlike the case where  N = 1000  (blue solid line). (b) At  γ τ = 3.63 , a transition from  n = 3  to  n = 1  and back is present for  N = 20  (red dashed line), which is absent for  N = 1000  (blue solid line). (c) Mean  n  versus N for  α = 0.5  and  γ τ 3.63  (blue solid line, on-site protocol),  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) )  (green dotted-dashed line, tracking protocol) and  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) )  (red dashed line, on-site protocol). For an increasing number of midcircuit measurements, there is a transition from  n = 1  to  n = 3  (tracking protocol) that drives the system to the high-temperature limit. For the on-site protocol exactly at  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) ) , a crossover is observed from  n = 1  to  n = 2 , and for  γ τ 3.63 , a crossover between three topological phases from  n = 1  to  n = 2  and  n = 3 .
Figure 7. Simulation of the mean return time  n  versus  γ τ  and N for  α = 0.5 . (a) For  N = 20  (red dashed line), the fine structure at  γ τ 3.49 , 3.63  and  3.78  predicted by asymptotic theory  N  is washed out, unlike the case where  N = 1000  (blue solid line). (b) At  γ τ = 3.63 , a transition from  n = 3  to  n = 1  and back is present for  N = 20  (red dashed line), which is absent for  N = 1000  (blue solid line). (c) Mean  n  versus N for  α = 0.5  and  γ τ 3.63  (blue solid line, on-site protocol),  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) )  (green dotted-dashed line, tracking protocol) and  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) )  (red dashed line, on-site protocol). For an increasing number of midcircuit measurements, there is a transition from  n = 1  to  n = 3  (tracking protocol) that drives the system to the high-temperature limit. For the on-site protocol exactly at  γ τ = 2 π / ( sin ( 0.5 + π / 6 ) + cos ( 0.5 ) ) , a crossover is observed from  n = 1  to  n = 2 , and for  γ τ 3.63 , a crossover between three topological phases from  n = 1  to  n = 2  and  n = 3 .
Entropy 26 00869 g007
Figure 8. (a) The transition from  n = 2  to  n = 1  and back is widened due to the finite time of the experiment. We compare IBM quantum processor results (light blue circles) and theory  n = 2 exp ( b ) ( 1 + b )  with  b = N ( 2 / 9 ) ( 3 γ τ 2 π ) 2  for  N = 20  (red dashed line) and simulation (blue solid line). (b) The transition from  n = 3  to  n = 1  and back is widened due to the finite time of the experiment. We compare IBM quantum processor results (light blue circles) and theory  n = 3 2 exp ( b / 2 ) ( 1 + b / 2 )  with  b = N ( 2 / 9 ) ( 3 γ τ 2 π ) 2  for  N = 20  (red dashed line) and simulation (blue solid line).
Figure 8. (a) The transition from  n = 2  to  n = 1  and back is widened due to the finite time of the experiment. We compare IBM quantum processor results (light blue circles) and theory  n = 2 exp ( b ) ( 1 + b )  with  b = N ( 2 / 9 ) ( 3 γ τ 2 π ) 2  for  N = 20  (red dashed line) and simulation (blue solid line). (b) The transition from  n = 3  to  n = 1  and back is widened due to the finite time of the experiment. We compare IBM quantum processor results (light blue circles) and theory  n = 3 2 exp ( b / 2 ) ( 1 + b / 2 )  with  b = N ( 2 / 9 ) ( 3 γ τ 2 π ) 2  for  N = 20  (red dashed line) and simulation (blue solid line).
Entropy 26 00869 g008
Figure 9. The null measurement probability versus N for  α = 0.5  for the tracking and on-site protocol. The parameters for the tracking protocol are  γ τ = 3.63  and  α = 0.5  (magenta, dashed), and  γ τ = 2  and  α = 0.5  (grey, dashed dotted), and for the on-site protocol  γ τ = 3.63  and  α = 0.5  (black, dotted), and  γ τ = 2  and  α = 0.5  (blue, solid). The null measurement rate slows down considerably near special sampling rates at  ( γ τ , α ) = ( 3.63 , 0.5 )  for both protocols.
Figure 9. The null measurement probability versus N for  α = 0.5  for the tracking and on-site protocol. The parameters for the tracking protocol are  γ τ = 3.63  and  α = 0.5  (magenta, dashed), and  γ τ = 2  and  α = 0.5  (grey, dashed dotted), and for the on-site protocol  γ τ = 3.63  and  α = 0.5  (black, dotted), and  γ τ = 2  and  α = 0.5  (blue, solid). The null measurement rate slows down considerably near special sampling rates at  ( γ τ , α ) = ( 3.63 , 0.5 )  for both protocols.
Entropy 26 00869 g009
Figure 10. Mean first return time  n  as a function of N for  p = 0  (black dotted line),  p = 1 %  (blue solid line) and  p = 5 %  (red dashed line). The measurement protocols and parameters are (a) on-site,  α = 0.5 γ τ = 1 , on-site, (b) on-site  α = 0 γ τ = 1 , and (c) tracking,  α = 0 γ τ = 1 .
Figure 10. Mean first return time  n  as a function of N for  p = 0  (black dotted line),  p = 1 %  (blue solid line) and  p = 5 %  (red dashed line). The measurement protocols and parameters are (a) on-site,  α = 0.5 γ τ = 1 , on-site, (b) on-site  α = 0 γ τ = 1 , and (c) tracking,  α = 0 γ τ = 1 .
Entropy 26 00869 g010
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

Wang, Q.; Ren, S.; Yin, R.; Ziegler, K.; Barkai, E.; Tornow, S. First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States. Entropy 2024, 26, 869. https://doi.org/10.3390/e26100869

AMA Style

Wang Q, Ren S, Yin R, Ziegler K, Barkai E, Tornow S. First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States. Entropy. 2024; 26(10):869. https://doi.org/10.3390/e26100869

Chicago/Turabian Style

Wang, Qingyuan, Silin Ren, Ruoyu Yin, Klaus Ziegler, Eli Barkai, and Sabine Tornow. 2024. "First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States" Entropy 26, no. 10: 869. https://doi.org/10.3390/e26100869

APA Style

Wang, Q., Ren, S., Yin, R., Ziegler, K., Barkai, E., & Tornow, S. (2024). First Hitting Times on a Quantum Computer: Tracking vs. Local Monitoring, Topological Effects, and Dark States. Entropy, 26(10), 869. https://doi.org/10.3390/e26100869

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