Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information communication, is the ultimate limit of communication over that channel. Indeed, the strong converse theorem for a channel states that coding at a rate above the capacity of the channel results in the convergence of the error to its maximum value 1 and that there is no trade-off between communication rate and decoding error. Here we prove that the strong converse theorem holds for the product-state capacity of quantum channels with ergodic Markovian correlated memory
We establish the classical capacity of optical quantum channels as a sharp transition between two re...
© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it ...
A fully general strong converse for channel coding states that when the rate of sending classical in...
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of inf...
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...
We revisit a fundamental open problem in quantum information theory, namely, whether it is possible ...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
We revisit a fundamental open problem in quantum information theory, namely whether it is possible t...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bo...
© 2017 IEEE. We investigate the classical communication over quantum channels when assisted by no-si...
We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bo...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
We determine the exact strong converse exponent of classical-quantum channel coding, for every rate ...
We establish the classical capacity of optical quantum channels as a sharp transition between two re...
© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it ...
A fully general strong converse for channel coding states that when the rate of sending classical in...
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of inf...
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...
We revisit a fundamental open problem in quantum information theory, namely, whether it is possible ...
A strong converse theorem for channel capacity establishes that the error probability in any communi...
We revisit a fundamental open problem in quantum information theory, namely whether it is possible t...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bo...
© 2017 IEEE. We investigate the classical communication over quantum channels when assisted by no-si...
We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bo...
Quantum entanglement can be used in a communication scheme to establish a correlation between succes...
We determine the exact strong converse exponent of classical-quantum channel coding, for every rate ...
We establish the classical capacity of optical quantum channels as a sharp transition between two re...
© 2015 IEEE. We revisit a fundamental open problem in quantum information theory, namely whether it ...
A fully general strong converse for channel coding states that when the rate of sending classical in...