Entanglement-Assisted Capacity of Quantum Multiple-Access Channels

Abstract

We find a regularized formula for the entanglement-assisted (EA) capacity region for quantum multiple access channels (QMAC). We illustrate the capacity region calculation with the example of the collective phase-flip channel which admits a single-letter characterization. On the way, we provide a first-principles proof of the EA coding theorem based on a packing argument. We observe that the Holevo-Schumacher-Westmoreland theorem may be obtained from a modification of our EA protocol. We remark on the existence of a family hierarchy of protocols for multiparty scenarios with a single receiver, in analogy to the two-party case. In this way, we relate several previous results regarding QMACs.

Published version. 13 pages, 3 figures

References in corpus (5)

• Quantum information can be negative
• Coding Theorem and Strong Converse for Quantum Channels
• A family of quantum protocols
• Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
• Simultaneous classical-quantum capacities of quantum multiple access channels

Cited by in corpus (63)

• Quantum channels and memory effects
• A Survey on Quantum Channel Capacities
• A Resource Framework for Quantum Shannon Theory
• Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
• Quantum broadcast channels
• Entanglement-assisted communication of classical and quantum information
• Trade-off capacities of the quantum Hadamard channels
• A father protocol for quantum broadcast channels
• Practical route to entanglement-assisted communication over noisy bosonic channels
• Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
• Strong converse rates for quantum communication
• Playing Games with Multiple Access Channels
• Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity
• The apex of the family tree of protocols: Optimal rates and resource inequalities
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• One-shot entanglement-assisted quantum and classical communication
• Identifying the Information Gain of a Quantum Measurement
• Applications of position-based coding to classical communication over quantum channels
• Classical communication over a quantum interference channel
• Quantum and Super-quantum enhancements to two-sender, two-receiver channels
• Public and private resource trade-offs for a quantum channel
• Quantum Channel Capacities with Passive Environment Assistance
• The conditional entropy power inequality for Gaussian quantum states
• Superadditivity of the Classical Capacity with Limited Entanglement Assistance
• Entanglement-assisted private communication over quantum broadcast channels
• Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
• Hadamard quantum broadcast channels
• Conditional quantum one-time pad
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters
• Public and private communication with a quantum channel and a secret key
• Computation-aided classical-quantum multiple access to boost network communication speeds
• On the near-optimality of one-shot classical communication over quantum channels
• Coding for quantum channels with side information at the transmitter
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Nonlocal quantum information in bipartite quantum error correction
• The Classical-Quantum Channel with Random State Parameters Known to the Sender
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Entanglement-assisted concatenated quantum codes
• Quantum-enabled communication without a phase reference
• Multiple-Access Channel Coding with Non-Signaling Correlations
• Optimal State Merging Without Decoupling
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Fault-tolerant Coding for Entanglement-Assisted Communication
• Universal coding for transmission of private information
• Building Multiple Access Channels with a Single Particle
• Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting
• Restricted Monte Carlo wave function method and Lindblad equation for identifying entangling open-quantum-system dynamics
• New Protocols for Conference Key and Multipartite Entanglement Distillation
• Postselected communication over quantum channels
• The Learnability of Unknown Quantum Measurements
• Computable limits of optical multiple-access communications
• Quantum Wiretap Channel Coding Assisted by Noisy Correlation
• Quantum channel coding: Approximation algorithms and strong converse exponents
• Fully Quantum Source Compression with a Quantum Helper
• Secure communication over generalised quantum multiple access channels
• Entanglement-Assisted Capacity of Quantum Channels with Side Information
• One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC
• Censorship of quantum resources against catalytic account sharing
• Capacity of Summation over a Symmetric Quantum Erasure MAC with Partially Replicated Inputs
• Intersection and union of subspaces with applications to communication over authenticated classical-quantum channels and composite hypothesis testing
• Classical State Masking over a Quantum Channel
• The Quantum Multiple-Access Channel with Cribbing Encoders
• Entanglement Assisted Classical Capacity of a Class of Quantum Channels with Long-Term Memory