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 条
  • [1] Optimal signal detection in entanglement-assisted quantum communication systems
    Ban, M
    JOURNAL OF OPTICS B-QUANTUM AND SEMICLASSICAL OPTICS, 2002, 4 (02) : 143 - 148
  • [2] Optimal entanglement-assisted one-shot classical communication
    Hemenway, Brett
    Miller, Carl A.
    Shi, Yaoyun
    Wootters, Mary
    PHYSICAL REVIEW A, 2013, 87 (06):
  • [3] Codes for entanglement-assisted classical communication
    Prasad, Tushita
    Grassl, Markus
    NPJ QUANTUM INFORMATION, 2025, 11 (01)
  • [4] Qubit- and entanglement-assisted optimal entanglement concentration
    Bandyopadhyay, S
    PHYSICAL REVIEW A, 2000, 62 (03):
  • [5] Optimal entanglement formulas for entanglement-assisted quantum coding
    Wilde, Mark M.
    Brun, Todd A.
    PHYSICAL REVIEW A, 2008, 77 (06):
  • [6] Quantum noise limited and entanglement-assisted magnetometry
    Jensen, Kasper
    Wasilewski, Wojciech
    Krauter, Hanna
    Renema, Jelmer J.
    Balabas, Mikhail V.
    Polzik, Eugene S.
    2010 CONFERENCE ON LASERS AND ELECTRO-OPTICS (CLEO) AND QUANTUM ELECTRONICS AND LASER SCIENCE CONFERENCE (QELS), 2010,
  • [7] Quantum Noise Limited and Entanglement-Assisted Magnetometry
    Wasilewski, W.
    Jensen, K.
    Krauter, H.
    Renema, J. J.
    Balabas, M. V.
    Polzik, E. S.
    PHYSICAL REVIEW LETTERS, 2010, 104 (13)
  • [8] Entanglement-assisted quantum communication with simple measurements
    Piveteau, Amelie
    Pauwels, Jef
    Hakansson, Emil
    Muhammad, Sadiq
    Bourennane, Mohamed
    Tavakoli, Armin
    NATURE COMMUNICATIONS, 2022, 13 (01)
  • [9] Strong Converse Exponent for Entanglement-Assisted Communication
    Li, Ke
    Yao, Yongsheng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 5017 - 5029
  • [10] On communication over an entanglement-assisted quantum channel
    Nayak, A
    Salzman, J
    17TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2002, : 19 - 19