Optimal entanglement-assisted electromagnetic sensing and communication in the presence of noise

被引:7
|
作者
Shi, Haowei [1 ]
Zhang, Bingzhi [1 ,2 ]
Shapiro, Jeffrey H. [3 ]
Zhang, Zheshen [4 ]
Zhuang, Quntao [1 ,2 ]
机构
[1] Univ Southern Calif, Ming Hsieh Dept Elect & Comp Engn, Los Angeles, CA 90089 USA
[2] Univ Southern Calif, Dept Phys & Astron, Los Angeles, CA 90089 USA
[3] MIT, Res Lab Elect, Cambridge, MA 02139 USA
[4] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
STANDARD QUANTUM LIMIT; CLASSICAL INFORMATION; CAPACITY; CHANNEL; ERROR; RECEIVER; STATES; RATES;
D O I
10.1103/PhysRevApplied.21.034004
中图分类号
O59 [应用物理学];
学科分类号
摘要
High time-bandwidth product signal and idler pulses comprised of independent identically distributed two-mode squeezed vacuum (TMSV) states are readily produced by spontaneous parametric down-conversion. These pulses are virtually unique among entangled states in that they offer quantum performance advantages-over their best classical-state competitors-in scenarios whose loss and noise break their initial entanglement. Broadband TMSV states' quantum advantage derives from its signal and idler having a strongly nonclassical phase-sensitive cross correlation, which leads to information-bearing signatures in lossy, noisy scenarios stronger than what can be obtained from classical-state systems of the same transmitted energy. Previous broadband TMSV receiver architectures focused on converting phasesensitive cross correlation into phase-insensitive cross correlation, which can be measured in second-order interference. In general, however, these receivers fail to deliver broadband TMSV states' full quantum advantage, even if they are implemented with ideal equipment. This paper introduces the correlation-todisplacement receiver-an alternative architecture comprised of a correlation-to-displacement converter, a programmable mode selector, and a coherent-state information extractor-that can be configured to achieve quantum optimal performance in known sensing and communication protocols for which broadband TMSV provides quantum advantage that is robust against entanglement-breaking loss and noise.
引用
收藏
页数:18
相关论文
共 50 条
  • [31] Entanglement-assisted atomic clock beyond the projection noise limit
    Louchet-Chauvet, Anne
    Appel, Jurgen
    Renema, Jelmer J.
    Oblak, Daniel
    Kjaergaard, Niels
    Polzik, Eugene S.
    NEW JOURNAL OF PHYSICS, 2010, 12
  • [32] Four classes of new entanglement-assisted quantum optimal codes
    Xiaojing Chen
    Shixin Zhu
    Wan Jiang
    Binbin Pang
    Journal of Applied Mathematics and Computing, 2021, 67 : 937 - 952
  • [33] Contextuality in Entanglement-assisted One-shot Classical Communication
    Yadavalli, Shiv Akshar
    Kunjwal, Ravi
    QUANTUM, 2022, 6
  • [34] Second-Order Coding Rates for Entanglement-Assisted Communication
    Datta, Nilanjana
    Tomamichel, Marco
    Wilde, Mark M.
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2772 - 2776
  • [35] Interplays between classical and quantum entanglement-assisted communication scenarios
    Vieira, Carlos
    de Gois, Carlos
    Pollyceno, Lucas
    Rabelo, Rafael
    NEW JOURNAL OF PHYSICS, 2023, 25 (11):
  • [36] Entanglement-assisted quantum communication beating the quantum Singleton bound
    Grassl, Markus
    PHYSICAL REVIEW A, 2021, 103 (02)
  • [37] Communication Complexity of Entanglement-Assisted Multi-Party Computation
    Meng, Ruoyu
    Ramamoorthy, Aditya
    ENTROPY, 2024, 26 (11)
  • [38] Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
    Shen Chen Xu
    Mark M. Wilde
    Quantum Information Processing, 2013, 12 : 641 - 683
  • [39] Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
    Xu, Shen Chen
    Wilde, Mark M.
    QUANTUM INFORMATION PROCESSING, 2013, 12 (01) : 641 - 683
  • [40] One-Shot Entanglement-Assisted Quantum and Classical Communication
    Datta, Nilanjana
    Hsieh, Min-Hsiu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1929 - 1939