A unitary interaction coupling two parties enables quantum or classical communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and backward communication. Our first result shows that for any bipartite unitary gate, bidirectional coherent classical communication is no more difficult than bidirectional classical communication — they have the same achievable rate regions. Previously this result was known only for the unidirectional capacities (i.e., the boundaries of the tradeoff). We then relate the tradeoff for two-way coherent communication to the tradeoff for two-way quantum communication and the tradeoff for coherent...
We present a communication protocol for the erasure channel assisted by backward classical communica...
Nonlocal operations underpin both classical communication and entanglement generation. By considerin...
Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules o...
A unitary interaction coupling two parties enables quantum communication in both the forward and bac...
We consider communication between two parties using a bipartite quantum operation, which constitutes...
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communi...
We consider interactions as bidirectional channels. We investigate the capacities for interaction Ha...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
In this paper, we give tradeoffs between classical communication, quantum communication, and entangl...
We introduce various measures of forward classical communication for bipartite quantum channels. Sin...
We study and solve the problem of classical channel simulation with quantum side information at the ...
We demonstrate a two-player communication problem that can be solved in the one-way quantum model by...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
In this paper, we consider quantum channels with two senders and one receiver. For an arbitrary such...
Calculating the capacity of interference channels is a notorious open problem in classical informati...
We present a communication protocol for the erasure channel assisted by backward classical communica...
Nonlocal operations underpin both classical communication and entanglement generation. By considerin...
Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules o...
A unitary interaction coupling two parties enables quantum communication in both the forward and bac...
We consider communication between two parties using a bipartite quantum operation, which constitutes...
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communi...
We consider interactions as bidirectional channels. We investigate the capacities for interaction Ha...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
In this paper, we give tradeoffs between classical communication, quantum communication, and entangl...
We introduce various measures of forward classical communication for bipartite quantum channels. Sin...
We study and solve the problem of classical channel simulation with quantum side information at the ...
We demonstrate a two-player communication problem that can be solved in the one-way quantum model by...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
In this paper, we consider quantum channels with two senders and one receiver. For an arbitrary such...
Calculating the capacity of interference channels is a notorious open problem in classical informati...
We present a communication protocol for the erasure channel assisted by backward classical communica...
Nonlocal operations underpin both classical communication and entanglement generation. By considerin...
Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules o...