Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
From MaRDI portal
Publication:3604433
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.
Recommendations
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- On entanglement-assisted classical capacity
- Entanglement-Assisted Capacities of Constrained Quantum Channels
- The classical capacity achievable by a quantum channel assisted by limited entanglement
- Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
Cited in
(23)- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
- Hadamard quantum broadcast channels
- Nonlocal quantum information in bipartite quantum error correction
- The conditional entropy power inequality for Gaussian quantum states
- Quantum information theory in infinite dimensions with application to optical channels
- Theory behind quantum error correcting codes: an overview
- On the second-order asymptotics for entanglement-assisted communication
- Entanglement assisted classical capacity of a class of quantum channels with long-term memory
- Universal coding for transmission of private information
- Entanglement-Assisted Capacities of Constrained Quantum Channels
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- The capacity of the quantum multiple-access channel
- Postselected communication over quantum channels
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- Entanglement-assisted private communication over quantum broadcast channels
- Applications of position-based coding to classical communication over quantum channels
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- Nonadditivity of quantum capacities of quantum multiple-access channels and the butterfly network
- Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
- Public and private resource trade-offs for a quantum channel
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
- On the near-optimality of one-shot classical communication over quantum channels
- The apex of the family tree of protocols: optimal rates and resource inequalities
This page was built for publication: Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604433)