IBM Journal of Research and Development
Quantum privacy and quantum wiretap channels
Problems of Information Transmission
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Entanglement assisted classical capacity of a class of quantum channels with long-term memory
Quantum Information Processing
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
Entanglement-assisted communication of classical and quantum information
IEEE Transactions on Information Theory
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory
IEEE Transactions on Information Theory
The quantum capacity of channels with arbitrarily correlated noise
IEEE Transactions on Information Theory
A conceptually simple proof of the quantum reverse Shannon theorem
TQC'10 Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography
Classical capacity of a noiseless quantum channel assisted by noisy entanglement
Quantum Information & Computation
Between entropy and subentropy
Quantum Information & Computation
A resource-based view of quantum information
Quantum Information & Computation
Toward implementation of coding for quantum sources and channels
Quantum Information & Computation
The classical capacity achievable by a quantum channel assisted by a limited entanglement
Quantum Information & Computation
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Quantum Information & Computation
Quantum measurements for hidden subgroup problems with optimal sample complexity
Quantum Information & Computation
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
Quantum Information Processing
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
Optimal state merging without decoupling
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Optimal trading of classical communication, quantum communication, and entanglement
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
The quantum dynamic capacity formula of a quantum channel
Quantum Information Processing
Public and private resource trade-offs for a quantum channel
Quantum Information Processing
Superactivation of quantum channels is limited by the quantum relative entropy function
Quantum Information Processing
Entanglement and output entropy of the diagonal map
Quantum Information & Computation
Robust device independent quantum key distribution
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 755.20 |
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 the recent result of Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters (1996), who proved the equality for the pure state channel