Optimal computation with non-unitary quantum walks
Theoretical Computer Science
Entanglement assisted classical capacity of a class of quantum channels with long-term memory
Quantum Information Processing
Amortized Communication Complexity of Distributions
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Entanglement transmission capacity of compound channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
The capacity of quantum channels with side information at the transmitter
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Optimal quantum source coding with quantum side information at the encoder and decoder
IEEE Transactions on Information Theory
Channel simulation with quantum side information
IEEE Transactions on Information Theory
The communication complexity of correlation
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
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
Mutual and coherent information for infinite-dimensional quantum channels
Problems of Information Transmission
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
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
Bidirectional coherent classical communication
Quantum Information & Computation
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities
Quantum Information Processing
Information capacity of a quantum observable
Problems of Information Transmission
The quantum dynamic capacity formula of a quantum channel
Quantum Information Processing
Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Quantum Information Processing
On classical capacities of infinite-dimensional quantum channels
Problems of Information Transmission
Identification via quantum channels
Information Theory, Combinatorics, and Search Theory
Quantum computing and communications - Introduction and challenges
Computers and Electrical Engineering
Hi-index | 755.32 |
The entanglement-assisted classical capacity of a noisy quantum channel (CE) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity CE is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs ρ, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of ρ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.