Quantum
Detector Placement Relaxes Efficiency Requirements for Detecting a Weak Coherent Link
Publication: quant-ph updates on arXiv.org
Author: M. H. Yu, S. Y. Li, X. Z. Zhang
Source published: 03/11/2026, 05:00:00 UTC
Briefing created: 03/11/2026, 09:11:40 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 03/11/2026, 08:58:25 UTC.
Briefings
A new arXiv preprint (2611.00500) proposes that relocating detectors on an eight-site ring can relax efficiency requirements for detecting weak coherent links. The study finds that missed jumps along routes without the link can produce records similar to the link itself, obscuring its presence. At fixed error and 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.
Key points
- Relocating detectors on an eight-site ring exposes one more crossing on the easiest background route to hide a weak coherent link, without changing the underlying dynamics.
- Tolerated missed fraction and time-bin width scale with the fourth root of link strength rather than the square root, meaning efficiency requirements relax significantly for weaker links.
Context
This research addresses the challenge of detecting weak coherent links in quantum networks where standard detection methods may miss signals due to routing inefficiencies. The findings suggest that by carefully selecting which routes to monitor, researchers can improve sensitivity without needing higher detector efficiency.
Limitations
The study relies on a single arXiv preprint (2611.00500v1) and does not include experimental validation or field data. Results are theoretical and depend on specific assumptions about detector placement and observation protocols. The fourth-root scaling relationship is derived from simulation rather than empirical measurement.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 03/11/2026, 09:11:40 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeigrugzcehvvsp6jfs4bnbzcqxchg7rcjgs5wql5ekghfwogv7hywm