The Quantum Multiple-Access Channel With Cribbing Encoders

被引:3
|
作者
Pereg, Uzi [1 ,2 ]
Deppe, Christian [1 ]
Boche, Holger [2 ,3 ,4 ]
机构
[1] Tech Univ Munich, Inst Commun Engn, D-80333 Munich, Germany
[2] Munich Ctr Quantum Sci & Technol MCQST, D-80799 Munich, Germany
[3] Tech Univ Munich, Inst Theoret Informat Technol, D-80333 Munich, Germany
[4] Ruhr Univ Bochum, Excellence Cluster Cyber Secur Age Large Scale Ad, D-44801 Bochum, Germany
关键词
Radio transmitters; Relays; Noise measurement; Quantum mechanics; Receivers; Quantum computing; Quantum communication; Shannon theory; multiple-access channel; cribbing; relay channel; CLASSICAL-QUANTUM; CAPACITY; INFORMATION; COOPERATION;
D O I
10.1109/TIT.2022.3149827
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Communication over a quantum multiple-access channel (MAC) with cribbing encoders is considered, whereby Transmitter 2 performs a measurement on a system that is entangled with Transmitter 1. Based on the no-cloning theorem, perfect cribbing is impossible. This leads to the introduction of a MAC model with noisy cribbing. In the causal and non-causal cribbing scenarios, Transmitter 2 performs the measurement before the input of Transmitter 1 is sent through the channel. Hence, Transmitter 2's cribbing may inflict a "state collapse" for Transmitter 1. Achievable regions are derived for each setting. Furthermore, a regularized capacity characterization is established for robust cribbing, i.e. when the cribbing system contains all the information of the channel input. Building on the analogy between the noisy cribbing model and the relay channel, a partial decode-forward region is derived for a quantum MAC with non-robust cribbing. For the classical-quantum MAC with cribbing encoders, the capacity region is determined with perfect cribbing of the classical input, and a cutset region is derived for noisy cribbing. In the special case of a classical-quantum MAC with a deterministic cribbing channel, the inner and outer bounds coincide.
引用
收藏
页码:3965 / 3988
页数:24
相关论文
共 50 条
  • [1] THE DISCRETE MEMORYLESS MULTIPLE-ACCESS CHANNEL WITH CRIBBING ENCODERS
    WILLEMS, FMJ
    VANDERMEULEN, EC
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) : 313 - 327
  • [2] Multiple-Access Channel With Partial and Controlled Cribbing Encoders
    Asnani, Himanshu
    Permuter, Haim H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2252 - 2266
  • [3] DISCRETE MEMORYLESS MULTIPLE-ACCESS CHANNEL WITH CRIBBING ENCODERS.
    Willems, Frans M.J.
    van der Meulen, Edward C.
    1600, (IT-31):
  • [4] Multiple-Access Channel Resolvability with Cribbing
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2052 - 2056
  • [5] Multiple Access Channel with Partial and Controlled Cribbing Encoders
    Asnani, Himanshu
    Permuter, Haim H.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
  • [6] State-Dependent Multiple-Access Channels with Partially Cribbing Encoders
    Kolte, Ritesh
    Ozgur, Ayfer
    Permuter, Haim
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 21 - 25
  • [7] Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel
    Helal, Noha
    Bloch, Matthieu
    Nosratinia, Aria
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (09) : 5429 - 5447
  • [8] Feedback, Cribbing, and Causal State Information on the Multiple-Access Channel
    Bracher, Annina
    Lapidoth, Amos
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (12) : 7627 - 7654
  • [9] The Arbitrarily Varying Multiple-Access Channel with Conferencing Encoders
    Wiese, Moritz
    Boche, Holger
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 993 - 997
  • [10] On Feedback, Cribbing, and Causal State-Information on the Multiple-Access Channel
    Bracher, Annina
    Lapidoth, Amos
    Steinberg, Yossef
    2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 134 - 138