Entanglement assisted classical capacity of a class of quantum channels with long-term memory
Quantum Information Processing
A father protocol for quantum broadcast channels
IEEE Transactions on Information Theory
Nonlocal quantum information in bipartite quantum error correction
Quantum Information Processing
Entanglement-assisted communication of classical and quantum information
IEEE Transactions on Information Theory
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
IEEE Transactions on Information Theory
Optimal state merging without decoupling
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states
Quantum Information & Computation
Public and private resource trade-offs for a quantum channel
Quantum Information Processing
Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Quantum Information Processing
| Hi-index | 755.02 |
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.