# Capacity theorems for quantum multiple access channels

@article{Yard2005CapacityTF, title={Capacity theorems for quantum multiple access channels}, author={Jon T. Yard and Igor Devetak and Patrick M. Hayden}, journal={Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.}, year={2005}, pages={884-888} }

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letterâ€¦Â

## 15 Citations

Ja n 20 05 Capacity Theorems for Quantum Multiple Access Channels Part I : Classical-Quantum and Quantum-Quantum Capacity Regions

- Computer Science
- 2005

This work considers quantum channels with two senders and one receiver and gives multi-letter characterizations of two different two-dimensional capacity regions that characterizes the rates at which each sender can send quantum information.

Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions

- Computer ScienceIEEE Transactions on Information Theory
- 2008

This paper gives multiletter characterizations of two different two-dimensional capacity regions for an arbitrary quantum channels with two senders and one receiver, and states that the coherent information over any degradable channel is concave in the input density operator.

Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

- Computer ScienceQuantum Inf. Process.
- 2019

Combining powerful universal random coding results for classical and quantum information transmission over point-to-point channels, this work establishes universal codes for the mentioned two-sender task and proves that the two-dimensional rate region achievable with these codes is optimal.

Additive extensions of a quantum channel

- Physics2008 IEEE Information Theory Workshop
- 2008

This work studies extensions of a quantum channel whose one-way capacities are described by a single-letter formula and demonstrates that the key rate of BB84 with one- way post-processing and quantum bit error rate q cannot exceed H(1/2-2q(1-q).

A Survey on Quantum Channel Capacities

- PhysicsIEEE Communications Surveys & Tutorials
- 2018

The properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels are reviewed.

Network information theory for classical-quantum channels

- Computer ScienceArXiv
- 2012

The purpose of this thesis is to extend the main ideas of classical network information theory to the study of classical-quantum channels, and proves coding theorems for quantum multiple access channels, quantum interference channels,quantum broadcast channels and quantum relay channels.

Properties of the Quantum Channel

- PhysicsArXiv
- 2012

This paper overviews the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.

Quantum communication under channel uncertainty

- Computer Science
- 2012

Coding theorems are proven, as well as a quantum analogue of the Ahlswede-dichotomy, for the CQC and the AVQC, and the notion of symmetrisability is defined and used for both classes of channels.

Applications of coherent classical communication and the schur transform to quantum information theory

- Computer Science
- 2005

It is found that coherent classical communication can be used to derive several new quantum protocols and unify them both conceptually and operationally with old ones, and these new protocols are used to prove optimal trade-off curves for a wide variety of coding problems.

One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC

- Computer ScienceArXiv
- 2021

This work is the first one to obtain a non-trivial simultaneous decoder for the QMAC with limited entanglement assistance in both one-shot and asymptotic iid settings; previous works used unlimited entanglements assistance.

## References

SHOWING 1-10 OF 30 REFERENCES

Simultaneous classical-quantum capacities of quantum multiple access channels

- Computer Science
- 2005

The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized.â€¦

The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information

- Physics
- 2003

An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both theâ€¦

The private classical capacity and quantum capacity of a quantum channel

- Physics, Computer ScienceIEEE Transactions on Information Theory
- 2005

Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement.

The private classical information capacity and quantum information capacity of a quantum channel

- Computer Science, Physics
- 2003

The capacity of the quantum multiple-access channel

- Computer ScienceIEEE Trans. Inf. Theory
- 2001

A second issue of this work is the presentation of a calculus of quantum information quantities, based on the algebraic formulation of quantum theory, which is applied to the case of noisy channels, with arbitrary input signal states.

Capacities of Quantum Erasure Channels

- Physics
- 1997

The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without theâ€¦

Quantum information can be negative

- Computer Science, Physics
- 2005

A primitive quantum state merging which optimally transfers partial information is introduced, and it is shown how it enables a systematic understanding of quantum network theory, and several important applications including distributed compression, multiple access channels and multipartite assisted entanglement distillation (localizableEntanglement).

The Capacity of the Quantum Channel with General Signal States

- Computer ScienceIEEE Trans. Inf. Theory
- 1998

It is shown that the capacity of a classical-quantum channel with arbitrary (possibly mixed) states equals the maximum of the entropy bound with respect to all a priori distributions. This completesâ€¦

Quantum data processing and error correction.

- Computer SciencePhysical review. A, Atomic, molecular, and optical physics
- 1996

A quantity called {ital coherent} {ital information}, which measures the amount of quantum information conveyed in the noisy channel, can never be increased by quantum information processing, and it yields a simple necessary and sufficient condition for the existence of perfect quantum error correction.

Distilling common randomness from bipartite quantum states

- Computer ScienceIEEE Transactions on Information Theory
- 2004

A single-letter formula for the optimal tradeoff between the extracted common randomness and classical communication rate is obtained for the special case of classical-quantum correlations.