betaFeedback

WorksPhysics and Astronomy

Detector Placement Relaxes Efficiency Requirements for Detecting a Weak Coherent Link

Abstract

A weak coherent link can produce unusually early arrivals without changing stationary count rates. Missed jumps along routes available without the link can produce similar records, obscuring its presence. On an eight-site ring, relocating the same detector losses exposes one more crossing on the easiest background route to hide, without changing the dynamics or leading link signal. At fixed error and a common observation-time scaling, the tolerated missed fraction and time-bin width follow fourth-root rather than square-root scaling with link strength. These requirements hold for every decision using the counting record and are met using three event counts per bin, with all elapsed time included. At the same stationary collected flux, where jumps are monitored can therefore determine the time resolution needed for weak-link sensing.

Introduction

Introduction.—Quantum sensing uses detected events to infer weak interactions [1, 2, 3]. Continuous monitoring provides their times and types, from which count rates and temporal correlations can be determined [4, 5, 6] [7, 8, 9]. A weak coherent link opens a shortcut between distant sites. An early arrival, however, does not by itself establish that the link is present. A particle following a route available without the link can leave a similar record if its intervening jumps go undetected. The link can change arrival times while leaving stationary count rates unchanged. Can detector placement reduce the required efficiency and time resolution to distinguish these processes, without increasing the stationary collected flux?

A weak signal can become easier to distinguish when it produces outcomes that the background almost never produces [10–14]. Detector crosstalk can remove this advantage [15], while recording events at finite resolution can reduce the information in correlated records [16]. Quantum-trajectory and waiting-time methods already account for missed jumps, multiple detection channels, and event correlations [17–21]. The remaining question is how the location of losses sets the efficiency and time resolution needed to detect a weak transport link. An excess of early arrivals alone cannot settle this question. Other events and correlations may carry information, and collecting further events takes time. Any bound on the observation time must therefore include the complete record and all elapsed time.

We compare two detector arrangements, C and S, on a fixed eight-site ring. In S, the easiest background route to hide crosses one more well-monitored bond than in C, while the leading direct-link signal is unchanged. The weaker background leaves longer waits informative and permits coarser timing. At a common observation-time scaling, the tolerated missed fraction and bin width change from square-root order in C to fourth-root order in S as the link weakens. We bound the time required by every decision using the binned counting record. A rule using three event counts per bin attains the same powers. At common settings, the dynamics, stationary collected flux, and entire selected return-time distribution are identical. The advantage thus comes from revealing background routes, rather than producing sensing opportunities more rapidly.

Model and detected events

A particle moves on eight sites j=0,…,7j=0,\ldots,7, with indices taken modulo eight. The state is localized at site jj as Pj=∣j⟩⟨j∣P_j=\lvert j\rangle\langle j\rvert. Frequencies are in units of the fixed ring hopping J>0J>0, and times in J−1J^{-1}. The Hamiltonian and jump operators are

Hh=∑j=07(∣j+1⟩⟨j∣+H.c.)+h(∣0⟩⟨4∣+H.c.),(1)H_h=\sum_{j=0}^{7}(\lvert j+1\rangle\langle j\rvert+\mathrm{H.c.})+h(\lvert0\rangle\langle4\rvert+\mathrm{H.c.}), \tag*{(1)}
Lj,+=γ∣j+1⟩⟨j∣,Lj,−=γ∣j⟩⟨j+1∣.(2)L_{j,+}=\sqrt{\gamma}\lvert j+1\rangle\langle j\rvert,\qquad L_{j,-}=\sqrt{\gamma}\lvert j\rangle\langle j+1\rvert. \tag*{(2)}

Here hh is the dimensionless link strength. The coherent hoppings are real, and the jump rate γ>0\gamma>0 is fixed and known. Jumps occur on ring bonds; the 44–00 link is purely coherent. At each hh, both detector arrangements have the same Lindblad generator Lh\mathcal{L}_h [22, 23]. A jump in channel μ\mu is missed with probability δμ\delta_\mu. Arrangement C misses half of the jumps in both directions on bonds 00–11 and 11–$2; S does so on 77–00 and 00–11. The other twelve directed channels share the missed fraction ℓ\ell. We call their six bonds protected: a jump crossing one is detected with probability 1−ℓ1-\ell. Protection refers to observation, not a barrier to motion.

The particle is prepared once in P4P_4 to distinguish h=0h=0 from a specified h>0h>0. Efficiencies are known; detector settings and the test may be chosen for this target hh, then held fixed under both hypotheses. Starting at preparation, a clock divides absolute time into bins of width Δ\Delta. Each bin records the numbers of events in three classes,

F=(3→4),A=(0→1),O=other registered events.(3)F=(3\to4),\qquad A=(0\to1),\qquad O=\text{other registered events}. \tag*{(3)}

An FF detection places the particle at site 44. An AA detection reports occupation of site 00 immediately before the jump. Every OO event is counted, but its direction is discarded. Within each bin, neither event times nor their order are retained. Observation ends at a predetermined time; empty bins and intervals that yield no useful detection still count towards its duration. There are no external resets, feedback, dark counts, dead time, or label errors. A false alarm declares a link under h=0h=0; a missed link declares none under h>0h>0. For arrangement D, let TDp(h,ℓ,Δ)T_D^p(h,\ell,\Delta) be the shortest time at which both probabilities can be at most a fixed ϵ∈(0,1/2)\epsilon\in(0,1/2). Using their equal-weight average as the error criterion gives the same time scalings.

The optimization covers this counting experiment, not arbitrary output measurements.

When no event is detected, the particle can still undergo missed jumps. Its conditional state, weighted by the probability of no detection, therefore evolves under

Kh,ℓ(X)=−i[Hh,X]−2γX+∑μδμLμXLμ†.(4)\mathcal{K}_{h,\ell}(X)=-i[H_h,X]-2\gamma X+\sum_{\mu}\delta_\mu L_\mu X L_\mu^\dagger. \tag*{(4)}

For a particle starting at bb, define Fh,ℓ(a,b;t)=⟨a∣etKh,ℓPb∣a⟩F_{h,\ell}(a,b;t)=\langle a|e^{t\mathcal{K}_{h,\ell}}P_b|a\rangle. This is the unnormalized population at aa with no intervening detection. Its sum over aa is the probability of no detection before tt. The probability density that the next detected jump is a→ca\to c is γ(1−δac)Fh,ℓ(a,b;t)\gamma(1-\delta_{ac})F_{h,\ell}(a,b;t). This jump leaves the particle in PcP_c [24–26].

The physical stationary state is π=I/8\pi=I/8 for every real hh. Each directed channel therefore carries flux γ/8\gamma/8, and both detectors register the fraction

qcoll=78−3ℓ4.(5)q_{\mathrm{coll}}=\frac{7}{8}-\frac{3\ell}{4}. \tag*{(5)}

The stationary registered-event rate is 2γqcoll2\gamma q_{\mathrm{coll}}. Total collection approaches 7/87/8 as ℓ→0\ell\to0; only the protected channels approach perfect efficiency. Each channel’s stationary rate is independent of hh. At h=0h=0, a rotation of the ring by one site also relates the generators K0,ℓ\mathcal{K}_{0,\ell} of C and S, giving identical spectra.

To find the times between FF detections, sum over all intermediate outcomes. The resulting generator is Qh=Lh−JFQ_h=\mathcal{L}_h-\mathcal{J}_F, where JF(X)=γ(1−ℓ)X33P4\mathcal{J}_F(X)=\gamma(1-\ell)X_{33}P_4. It gives −Qh−1P4=I/[γ(1−ℓ)]-Q_h^{-1}P_4=I/[\gamma(1-\ell)] and mean return time 8/[γ(1−ℓ)]8/[\gamma(1-\ell)]. Because QhQ_h is common to C and S, their entire FF return-time distributions match. The detector still records the intermediate events summed over in this return law. The mean counts during the transient that follows the initial preparation can differ and are included in the time bounds (SM [27], Secs. S1 and S4). Here placement changes which jumps are reported; control of collective order [28, 29] and relaxation [30] instead changes the dynamics.

The background is the population at site 0 under h=0h=0, starting at site 4 with no intervening detection. A detected jump excludes a history from this population; it does not stop the particle. Expanding (22) order by order in the number of missed jumps gives positive contributions from histories containing coherent motion between those jumps. Within each coherent segment, amplitudes are summed before taking their squared modulus. The distance dependence of coherent and stochastic short-time powers, open-system path shortening, and explicit remainder bounds are established [31]. A coherent segment of dd bonds contributes population of order t2dt^{2d}; each missed jump adds a time integral. Coherent passage across a protected bond contributes a short-time weight of order t2t^2. An undetected jump across the same bond contributes a weight of order γℓt\gamma\ell t. From site 4 to site 0,

F0,ℓC(0,4;t)≃t4(ℓ+t)2,F0,ℓS(0,4;t)≃t4(ℓ+t)3.(6)F^{\mathrm{C}}_{0,\ell}(0,4;t)\simeq t^4(\ell+t)^2,\qquad F^{\mathrm{S}}_{0,\ell}(0,4;t)\simeq t^4(\ell+t)^3. \tag*{(6)}

Here ≃\simeq means equality up to positive constant factors, uniformly at short times and small ℓ\ell. In C, the easiest four-bond background route to hide crosses two half-loss bonds and two protected bonds. Either route in S crosses three protected bonds. At ℓ=0\ell=0, protected bonds must be crossed coherently to avoid detection. The leading C route combines two missed jumps and two coherent crossings, giving t2t4=t6t^{2}t^{4}=t^{6}. Each leading S route combines one missed jump and three coherent crossings, giving tt6=t7tt^{6}=t^{7}. The ring distance remains four [Figure 1]. For nonzero ℓ\ell, the S background gains an additional factor ℓ+t\ell+t. Coherent motion across protected bonds dominates for t≫ℓt\gg\ell, and missed jumps for t≪ℓt\ll\ell, at fixed γ\gamma. The calculation retains interference between coherent paths; bond counting alone does not establish these powers.

Figure 1. Relocating losses suppresses background arrivals at site 0 with no intervening detection while preserving the leading link signal. (a) and (b) Ring bonds have coherent hopping JJ and jump rate γJ\gamma J in each direction; the 4–0 link has hopping hJhJ. Solid bonds are well monitored (protected), with missed fraction ℓ\ell; dashed bonds have missed fraction 1/21/2. The two routes from 4 to 0 cross two and four protected bonds respectively in C, but three each in S. Gray arrows trace one background route; black arrows mark the selected event F=(3→4)F=(3\to4) and target A=(0→1)A=(0\to1). (c) Unnormalized populations at site 0 after preparation at site 4, with no intervening detection. Orange dashed and blue solid curves show the null populations F0,ℓC(0,4;t)F^{\mathrm{C}}_{0,\ell}(0,4;t) and F0,ℓS(0,4;t)F^{\mathrm{S}}_{0,\ell}(0,4;t). The curves are calculated by matrix exponentiation at γ=1\gamma=1, ℓ=0\ell=0 on logarithmic axes; the analytical short-time powers are t6t^6 and t7t^7. Black circles show the S signal increment F0,0S(0,4;t)−F0,0S(0,4;t)F^{\mathrm{S}}_{0,0}(0,4;t)-F^{\mathrm{S}}_{0,0}(0,4;t) at h=0.01h=0.01; the dotted line is h2t2h^2t^2. Time is t=Jtphyst=Jt_{\mathrm{phys}}. These local probabilities explain the mechanism; the text and Supplemental Material (SM) establish the observation-time bounds.

The weak link bypasses these routes. The leading contribution of the link is the same in both arrangements,

Fh,ℓ(0,4;t)−F0,ℓ(0,4;t)=h2t2[1+O(t)].(7)F_{h,\ell}(0,4;t)-F_{0,\ell}(0,4;t)=h^{2}t^{2}[1+O(t)]. \tag*{(7)}

Reversing the sign of the real link leaves all counting probabilities unchanged, so odd powers of hh vanish (SM, Sec. S2.1). (25) gives the nonzero quadratic term. At ℓ=0\ell=0, balancing t6t^{6} or t7t^{7} against h2t2h^{2}t^{2} gives waits tC≍h1/2t_{\mathrm C}\asymp h^{1/2} and tS≍h2/5t_{\mathrm S}\asymp h^{2/5}, at fixed γ\gamma. Thus S leaves longer waits informative as hh decreases. This explains the mechanism; establishing the required clock resolution also requires the complete record.

A detected F jump places the particle at site 4. We compare the waiting-time densities for A to be the next detection, with and without the link. Integrating the squared difference between their square roots gives the target-channel contribution to the squared Hellinger distance. This distance measures statistical distinguishability. Write pp for the minimum number of protected bonds on a background route from site 4 to site 0; p=2p=2 for C and p=3p=3 for S. With a short-time cutoff τ>0\tau>0 independent of h,ℓh,\ell, rationalizing the square-root difference gives the scaling

h4∫0τt2 dtt2(ℓ+t)p+h2≲h4(ℓ+h2/(p+2))p−1.(8)h^{4}\int_{0}^{\tau}\frac{t^{2}\,dt}{t^{2}(\ell+t)^{p}+h^{2}}\lesssim\frac{h^{4}}{(\ell+h^{2/(p+2)})^{p-1}}. \tag*{(8)}

Both background and signal enter the denominator: at the shortest waits, the signal can exceed the background although both probabilities are small. Waits of order ℓ+h2/(p+2)\ell+h^{2/(p+2)} dominate the integral. Their information comes from intervals with no detection, without an enhanced spectral response [32, 33]. With exact timestamps, the finite mean return time supplies sensing opportunities at a rate bounded away from zero. Equation (8) already accounts for how rarely a useful wait occurs in each such opportunity.

For ℓ>h2/(p+2)\ell>h^{2/(p+2)}, waits of order ℓ\ell give information of orders h4/ℓh^{4}/\ell for C and h4/ℓ2h^{4}/\ell^{2} for S. A fixed nonzero ℓ\ell therefore restores h−4h^{-4} observation-time scaling. S tolerates more loss because its background must cross one additional protected bond without detection; the direct link bypasses that bond.

Efficiency and time resolution

References

  1. [1]A. H. Kilerich and K. Mølmer, Parameter estimation by multichannel photon counting, Phys. Rev. A 91, 012119 (2015).
  2. [2]B. E. Szigeti, G. Homa, Z. Zimborás, and N. Barankai, Short-time behavior of continuous-time quantum walks on graphs, Phys. Rev. A 100, 062320 (2019).DOI
  3. [3]D. E. Evans and R. Høegh-Krohn, Spectral Properties of Positive Maps on C* -Algebras, J. London Math. Soc. 17, 345 (1978).DOI
  4. [4]F. Girotti, A. Godley, and M. Guță, Estimating quantum Markov chains using coherent absorber post-processing and pattern counting estimator, Quantum 9, 1835 (2025).DOI
  5. [5]L. H. Y. Chen, X. Fang, and Q.-M. Shao, Moderate deviations in Poisson approximation: a first attempt, Statistica Sinica 23, 1523 (2013).arxiv.org/abs/1207.1605
  6. [6]G. E. Crooks, Quantum operation time reversal, Phys. Rev. A 77, 034101 (2008).

Paper details

vlnc:W_ggmsz4vm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents