可编程光子态融合：基于异步生成资源的暂存存储
Programmable photonic state fusion via heralded storage of asynchronously generated resources
浏览论文内容
中文总结 AI 辅助
提出一种通过主动存储环依次加载异步生成的光子态、以条件化真空选择实现时间模式匹配的融合协议，利用可编程线性因子乘积构建目标叠加态，并优化耦合以提升加载效率，应用于光子时钟干涉测量。
中文摘要 AI 辅助
概率性光子源在不同试验中生成基本态，而多光子协议要求它们在共同的时间模式中干涉。我们提出一种融合协议，通过将独立触发的光子态依次加载到主动存储环中来克服这一不匹配。对受监控的丢弃模式中的真空进行条件化，选择每个新生成态被转移到与已存储光子相同的循环模式的事件，从而去除其生成时间标签。假设每个基本态的两种替代方案经历相同的加载变换，累积态由可编程线性因子的乘积描述，允许通过多项式因式分解构建目标叠加态。随着态的增长调整存储环耦合可显著提高加载效率，将固定平衡耦合器的超指数惩罚改变为指数缩放。我们将该协议应用于光子时钟干涉测量的双光子路径-频率态，并估计包括源等待时间和往返损耗在内的探测速率。
英文摘要
Probabilistic photonic sources generate elementary states in different trials, whereas multiphoton protocols require them to interfere in common temporal modes. We propose a fusion protocol that overcomes this mismatch by successively loading independently heralded photonic states into active storage loops. Conditioning on vacuum in monitored dump modes selects events in which each newly generated state is transferred into the same circulating modes as the photons already stored, thereby removing its generation time label. Provided the two alternatives of each elementary state undergo the same loading transformation, the accumulated state is described by a product of programmable linear factors, allowing a target superposition to be constructed by polynomial factorization. Adjusting the storage loop coupling as the state grows substantially improves the loading efficiency, changing the faster-than-exponential penalty of fixed balanced couplers to exponential scaling. We apply the protocol to two-photon path--frequency states for photonic clock interferometry and estimate the detected rate including source waiting time and round-trip loss.
发表机构
- Humboldt-Universität zu Berlin（柏林洪堡大学）
- University College London（伦敦大学学院）
- TU Wien（维也纳工业大学）
机构由 AI 辅助整理，请以论文原文为准。
