We revisit a fundamental open problem in quantum information theory, namely whether it is possible to transmit quantum information at a rate exceeding the channel capacity if we allow for a non-vanishing probability of decoding error. Here we establish that the Rains information of any quantum channel is a strong converse rate for quantum communication: For any code with a rate exceeding the Rains information of the channel, we show that the fidelity vanishes exponentially fast as the number of channel uses increases. This remains true even if we consider codes that perform classical post-processing on the transmitted quantum data. Our result has several applications. Most importantly, for generalized dephasing channels we show that the Rai...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
An upper limit is given to the amount of quantum information that can be transmitted reliably down a...
Transmitting data reliably over noisy communication channels is one of the most important applicatio...
We revisit a fundamental open problem in quantum information theory, namely, whether it is possible ...
© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it ...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
© 2017 IEEE. We investigate the classical communication over quantum channels when assisted by no-si...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
© 2017 IEEE. We study the classical communication over quantum channels when assisted by no-signalli...
We show that the max-Rains information of a quantum channel is an efficiently computable, single-let...
© 2017 IEEE. We study the classical communication over quantum channels when assisted by no-signalli...
We establish the classical capacity of optical quantum channels as a sharp transition between two re...
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of inf...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
An upper limit is given to the amount of quantum information that can be transmitted reliably down a...
Transmitting data reliably over noisy communication channels is one of the most important applicatio...
We revisit a fundamental open problem in quantum information theory, namely, whether it is possible ...
© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it ...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
© 2017 IEEE. We investigate the classical communication over quantum channels when assisted by no-si...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
© 2017 IEEE. We study the classical communication over quantum channels when assisted by no-signalli...
We show that the max-Rains information of a quantum channel is an efficiently computable, single-let...
© 2017 IEEE. We study the classical communication over quantum channels when assisted by no-signalli...
We establish the classical capacity of optical quantum channels as a sharp transition between two re...
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of inf...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
An upper limit is given to the amount of quantum information that can be transmitted reliably down a...
Transmitting data reliably over noisy communication channels is one of the most important applicatio...