arXiv:2610.04556
The collapse time of weak measurement on entangled sites
Truong-Son P. Van, David W. Snoke
Abstract
We determine the time required for local weak measurements to collapse to one occupied site in an initial superposition of $N$ alternatives in the model of PRA 111, 032217 (2025). For equal initial occupation probabilities and a fixed confidence threshold $1-δ$, we prove $T_N/\ln N\to1/2$ in $L^1$, with time measured in units of the characteristic measurement time $τ_m$ of each detector. We also connect the asymptotic stabilization theorem of that work to a finite measurement: the first site to reach $1-δ$ is the eventual outcome with conditional probability exactly $1-δ$. The result corrects the previously proposed double-logarithmic asymptotic scaling. The finite-range numerical fit does not determine a constant asymptotic correction or a precise finite-$N$ law.
AI Summary
The paper asks how the time needed for continuous local weak measurements to identify one occupied site scales with the number $N$ of alternatives. It studies a single excitation initially distributed uniformly over $N$ sites, with identical ideal detectors and no Hamiltonian dynamics. Collapse is defined operationally as the first time $T_N$ that any conditional occupation probability reaches $1-\delta$, for fixed $0<\delta<1/2$. In units of each detector’s measurement time $\tau_m$, the main result is $T_N/\ln N\to1/2$ in $L^1$, correcting a previously proposed double-logarithmic scaling for this model. Explicitly, $\mathbb E|T_N-\tfrac12\ln N|\le \sqrt{\pi\ln N}/[2\delta(1-\delta)]$. Early deviations of size $K\sqrt{\ln N}$ have probability at most $e^{-K^2}/(1-\delta)$; the corresponding late-tail bound is $\sqrt\pi/(2\delta K)$. The proof bounds the largest occupation probability using optimized power-sum moments, then controls the remaining waiting time through an entropy-drift identity. Bounded-martingale convergence also establishes almost-sure eventual localization with Born probabilities $1/N$. Identifying the weights as posterior probabilities given detector records shows that the first threshold-crossing site is the eventual outcome with conditional probability exactly $1-\delta$. A reanalysis of archived simulations favors the logarithmic curve over the earlier double logarithm. However, its fitted offset is only empirical: the theorem establishes neither a constant asymptotic correction nor a precise finite-$N$ law. Threshold dependence, sharper mean corrections, and the crossing-time distribution remain unresolved.
ChatGPT 6 Astra (OpenAI) was used to derive the results presented here through an extended series of conversations.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 21 pages, 1 figure