Physical Review A · 1998 · 134 citations · 21 references
Natural SciencesComputer SciencePhysicsInformation TheoryProbability TheoryQuantum MechanicsChannel CapacityChannel CodingCoding TheoryQuantum CommunicationQuantum Information TheoryQuantum StatesBlock CodingChannelsCodingQuantum CapacityQuantum Channel CapacityQuantum Channel CodingQuantum ChannelsQuantum Error-correcting Codes
We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length $n$ can exceed $n$ times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.
21
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
Quantum detection and estimation theory
Carl W. Helstrom · Journal of Statistical Physics · 1969 · 3.9K citations · Full text
Experimental realization of any discrete unitary operator
Michael Reck, Anton Zeilinger, H. J. Bernstein et al. · Physical Review Letters · 1994 · 2.1K citations · Full text
Natural Sciences, Physics, Optics +15
Measurement of Conditional Phase Shifts for Quantum Logic
Q. A. Turchette, C. J. Hood, W. Lange et al. · Physical Review Letters · 1995 · 1.4K citations · Full text
Natural Sciences, Physics, Optics +14