The Quantum Multiple-Access Channel with Cribbing Encoders

Abstract

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.

References in corpus (28)

• Gaussian Quantum Information
• What should 6G be?
• Coding Theorem and Strong Converse for Quantum Channels
• Massive Non-Orthogonal Multiple Access for Cellular IoT: Potentials and Limitations
• Entanglement of assistance and multipartite state distillation
• Quantum Pseudo-Telepathy
• Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
• Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
• The Capacity of the Quantum Multiple Access Channel
• Fundamental Rate Limits of UAV-Enabled Multiple Access Channel with Trajectory Optimization
• Classical capacity of bosonic broadcast communication and a new minimum output entropy conjecture
• Playing Games with Multiple Access Channels
• Nonadditivity effects in classical capacities of quantum multiple-access channels
• Simultaneous classical-quantum capacities of quantum multiple access channels
• Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
• On environment-assisted capacities of quantum channels
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters
• Approximate quantum Markov chains
• Computation-aided classical-quantum multiple access to boost network communication speeds
• Partial decode-forward for quantum relay channels
• A Quantum Multiparty Packing Lemma and the Relay Channel
• Correcting quantum channels by measuring the environment
• Network information theory for classical-quantum channels
• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
• Exponent for classical-quantum multiple access channel
• The Simultaneous Identification Capacity of the Classical--Quantum Multiple Access Channel with Stochastic Encoders for Transmission
• One-shot inner bounds for sending private classical information over a quantum MAC
• Secure communication over generalised quantum multiple access channels