arXiv:2610.01703
Exact first-detection probability in a locally monitored solvable quantum circuit
Cecilia De Fazio, Igor Lesanovsky, Gabriele Perfetto
Abstract
We study the interplay between local stroboscopic measurements and the unitary quantum circuit dynamics of the deterministic Floquet-quantum East model. We derive exact analytical results for the probability of first detecting a subset of qubits back in their initial state. This is achieved via a renewal equation linking the first-detection probability to the subsystem Loschmidt echo, which encodes the effective open dynamics of the monitored qubits. The resulting statistics exhibit two regimes set by the competition between the measurement probing time and the relaxation timescale of the unitary circuit dynamics: while infrequent monitoring leads to geometric first-detection statistics, frequent monitoring induces correlations that manifest as deviations from this geometric behavior. These results provide a rare exact characterization of how local measurement backaction reshapes detection statistics in an interacting quantum many-body system. In our local protocol, return probabilities are controlled by the size of the monitored subregion and can therefore be accessed on digital quantum simulators via local mid-circuit measurements.
AI Summary
The paper studies when a finite subsystem is first detected back in its initial state under repeated local measurements during many-body unitary dynamics. It considers the deterministic Floquet-quantum East model, a brickwork CNOT circuit with a directional kinetic constraint. A region of $2\ell$ qubits starts in $|0\rangle^{\otimes 2\ell}$; the surrounding chain starts in a restricted family of solvable product states. Binary projective measurements test return to the target every $\tau$ periods. In the thermodynamic limit, folding the circuit and using spatial transfer-matrix fixed points reduces the environment to temporally factorized boundary operators. Special projector identities then yield a probability-level renewal equation, $F(k)=\mathcal L(k)-\sum_{m=1}^{k-1}\mathcal L(m)F(k-m)$, with the measurement-free subsystem return probability $\mathcal L(m)=2^{-\min(m\tau,2\ell)}$. For $\tau\geq2\ell$, first detection is geometric with success probability $2^{-2\ell}$. For $\tau<2\ell$, $F(1)=2^{-\tau}$, while $F(k)=0$ for $k>1$ and $k\tau\leq2\ell$. Later statistics are non-geometric. A rational generating function gives the full distribution; numerically identified dominant poles describe exponential late-time decay. Eventual detection has probability one, and the mean number of attempts is $2^{2\ell}$ for every probing interval, although the variance depends on $\tau$. The exact reduction relies on the circuit’s special algebra, the all-zero target, and the specified environment states. The probability-level renewal relation is therefore not established for generic interacting circuits. The late-time dominant-pole characterization is supported numerically rather than proved generally.
The authors acknowledge using Claude (Anthropic) as a support tool for refining TikZ code for diagrams and for minor language editing.
Error found: Supplemental Section V.B and its pole-figure caption incorrectly count n+1 poles: the displayed generating function has a common numerator–denominator factor 1−2^(−τ)z, making z=2^τ removable and leaving a denominator of degree n.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 7 pages, 3 figures; Supplemental Material: 19 pages, 4 figures