论文标题
挤压增强的交流而没有阶段参考
Squeezing-enhanced communication without a phase reference
论文作者
论文摘要
我们研究了使用有限的退积时间的量子噪声通道上使用量子高斯状态传输经典信息的问题,以便在连续使用$ m $的传输线路后丢失了相位引用。此问题与自由空间和光纤中的长距离通信有关,该相位噪声通常被视为限制因素。这些渠道的孔波容量始终具有光子数编码,这在当前技术方面具有挑战性。因此,对于相干状态编码,最佳速率仅取决于总能量分布,我们为所有$ m $提供上限和下限,后者可在低能和关闭调制和光相位的低能下实现。我们将其概括为挤压编码的挤压编码,这是我们的首次展示,我们知道,对于$ m = 1 $的任何连贯编码的任何连贯的编码都有无条件的优势,并且对于$ m> 1 $的直接相干对应物具有可观的优势。对于中等衰减,这种优势是强大的,并且在一个具有多达两光子状态的Fock编码也是次优的方向上。最后,我们表明,即使在很大的能量下,也可以使用部分能量来建立参考框架。我们的结果代表了与相位互联的高斯渠道的关键不同,并构成了在动机的沟通环境中使用非古典,挤压光的优势的原理证明。
We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the transmission line. This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor. The Holevo capacity of these channels is always attained with photon-number encodings, challenging with current technology. Hence for coherent-state encodings the optimal rate depends only on the total-energy distribution and we provide upper and lower bounds for all $m$, the latter attainable at low energies with on/off modulation and photodetection. We generalize this lower bound to squeezed-coherent encodings, exhibiting for the first time to our knowledge an unconditional advantage with respect to any coherent encoding for $m=1$ and a considerable advantage with respect to its direct coherent counterpart for $m>1$. This advantage is robust with respect to moderate attenuation, and persists in a regime where Fock encodings with up to two-photon states are also suboptimal. Finally, we show that the use of part of the energy to establish a reference frame is sub-optimal even at large energies. Our results represent a key departure from the case of phase-covariant Gaussian channels and constitute a proof-of-principle of the advantages of using non-classical, squeezed light in a motivated communication setting.