Detector Placement Relaxes Efficiency Requirements for Detecting a Weak Coherent Link
M. H. Yu, S. Y. Li, X. Z. Zhang
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.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado