Capacity-approaching quantum repeaters for quantum communications

被引:17
|
作者
Ghalaii, Masoud [1 ]
Pirandola, Stefano [1 ]
机构
[1] Univ York, Dept Comp Sci, York YO10 5GH, N Yorkshire, England
基金
英国工程与自然科学研究理事会;
关键词
INFORMATION;
D O I
10.1103/PhysRevA.102.062412
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network, encompassing the case of a quantum repeater chain. However, whether or not a physical design exists to approach such end-to-end capacities remains a challenging objective. Driven by this motivation, in this work we put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat. We also show that even in a noisy regime, our rates surpass the Pirandola-Laurenza-Ottaviani-Banchi bound. Our repeater setup is developed upon using noiseless linear amplifiers, quantum memories, and continuous-variable Bell measurements. Furthermore, we propose a nonideal model for continuous-variable quantum memories that we make use of in our design. We then show that potential quantum communication rates would deviate from the theoretical capacities, as one would expect, if the quantum link is too noisy, and/or if low-quality quantum memories and amplifiers are employed.
引用
收藏
页数:9
相关论文
共 50 条
  • [31] Capacity-approaching block-based transceivers with reduced redundancy
    Vega, Leonardo Rey
    Galarza, Cecilia G.
    DIGITAL SIGNAL PROCESSING, 2009, 19 (02) : 340 - 359
  • [32] An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing
    Scarlett, Jonathan
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2679 - 2683
  • [33] Capacity-Approaching Irregular Turbo Codes for the Binary Erasure Channel
    Kraidy, Ghassan M.
    Savin, Valentin
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (09) : 2516 - 2524
  • [34] On the Design of Capacity-Approaching Iterative Soft Cancellation for Coded OTFS
    Li, Xu
    Yang, Tao
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 4104 - 4109
  • [35] Finite-Support Capacity-Approaching Distributions for AWGN Channels
    Xiao, Derek
    Wang, Linfang
    Song, Dan
    Wesel, Richard D.
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [36] Layered LDGM codes:: a capacity-approaching structure for arbitrary rates
    Gonzalez-Lopez, A.
    Vazquez-Araujo, F. J.
    Castedo, L.
    Garcia-Frias, J.
    2007 FOURTH INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS, VOLS 1 AND 2, 2007, : 357 - 361
  • [37] A capacity-approaching hybrid ARQ scheme using turbo codes
    Mantha, R
    Kschischang, FR
    GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 2341 - 2345
  • [38] Binary Modeling and Capacity-Approaching Coding for the IM/DD Channel
    Bahanshal, Sarah
    Abdel-Qader, Ahmad
    Chaaban, Anas
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (05) : 2670 - 2684
  • [39] Capacity-approaching turbo coding for half-duplex relaying
    Zhang, Zheng
    Duman, Tolga M.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (10) : 1895 - 1906
  • [40] Design of a capacity-approaching chaos-based multiaccess transmission system
    Chen P.
    Fang Y.
    Su K.
    Chen G.
    Fang, Yi (fangyi@gdut.edu.cn), 1600, Institute of Electrical and Electronics Engineers Inc., United States (66): : 10806 - 10816