Quantum privacy and quantum wiretap channels
Problems of Information Transmission
Smooth entropies and the quantum information spectrum
IEEE Transactions on Information Theory
Min- and max-relative entropies and a new entanglement monotone
IEEE Transactions on Information Theory
Classical capacities of compound and averaged quantum channels
IEEE Transactions on Information Theory
Channel simulation with quantum side information
IEEE Transactions on Information Theory
Time reversal and exchange symmetries of unitary gate capacities
IEEE Transactions on Information Theory
A father protocol for quantum broadcast channels
IEEE Transactions on Information Theory
Entanglement-assisted communication of classical and quantum information
IEEE Transactions on Information Theory
The quantum capacity of channels with arbitrarily correlated noise
IEEE Transactions on Information Theory
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
A strong converse theorem for quantum multiple access channels
General Theory of Information Transfer and Combinatorics
Identification via quantum channels in the presence of prior correlation and feedback
General Theory of Information Transfer and Combinatorics
Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Quantum Information Processing
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
Journal of the ACM (JACM)
Building one-time memories from isolated qubits: (extended abstract)
Proceedings of the 5th conference on Innovations in theoretical computer science
Classical-Quantum arbitrarily varying wiretap channel
Information Theory, Combinatorics, and Search Theory
Information Theory, Combinatorics, and Search Theory
| Hi-index | 755.32 |
We present a new proof of Holevo's (1973, 1977) coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfwitz's (1964) combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound