A.S. Holevo, "Coding theorems for Quantum Channels," Tamagawa University Research Review, No.4, 1998. (quant-ph/9809023). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Channels and Simultaneous ID Coding - Löber (1999) (Correct)
....coding schemes that use measurements which may be used to identify every message. This means that the measurement the receiver has to perform to access the information is not allowed to depend on the message he s actually interested in. Investigation in quantum channels started in the 1960 s (see [10] for a list of references) leading to Holevo s famous upper bound ( 7] which implies immediately a weak converse for the transmission problem of the memoryless quantum channel. Even though it was undoubted that the appropriate coding theorem holds it was not before 1996 when people were able to ....
A. S. Holevo, "Coding Theorems for Quantum Channels," LANL Report no. quant-ph/9809023.
Quantum Information Theory - an Invitation - Werner (2001) (2 citations) (Correct)
....entropy is convex jointly in both arguments. For more precise definitions, and many further results, I recommend the book of Petz and Ohya [21] The strongest coding theorem for quantum channels known so far is the following expression for the one shot classical capacity, proved by Holevo [23] C c,1 (T) max # S ## i p i T # [# i ] # # i p i S(T # [# i ] # (6.28) Whether or not this is equal to the classical capacity depends on whether the conjectured equality in equation (6.21) holds or not. In any case, it is known to hold for channels with classical input, so ....
A.S. Holevo, "Coding theorems for Quantum Channels," Tamagawa University Research Review, No.4, 1998. (quant-ph/9809023).
Coding Theorem and Strong Converse for Nonstationary Quantum.. - Winter (1999) (2 citations) (Correct)
.... years after his bound on the classical information capacity of quantum channels [6] Holevo succeeded to prove the corresponding coding theorem [10] making the previous bound the weak converse (this was independently done by Schumacher and Westmoreland [16] For a history of the problem see [9], for a modern account of the Holevo bound as a weak converse see [18] The present work will extend these results in several ways: first, we will consider nonstationary discrete memoryless quantum channels, second, we will use a different method for proving the coding theorem, and third, we will ....
A. S. Holevo, "Coding Theorems for Quantum Channels", Tamagawa University Research Review no.4, 1998 (an extended version as LANL eprint quant-ph/9809023)
Rate and Error Estimates for Quantum Channels - Winter (Correct)
.... upper and lower bounds on e min (n; R) which lead to nontrivial lower and upper bounds on the reliability function of the channel (section IV) This extends results of Burnashev, Holevo [1] from pure state to general channels, and thus gives (partial) answers to two problems posed by Holevo in [4]. II. Types and typical subspaces To begin with define the type of a sequence x n 2 X n to be the empirical distribution of its letters. Further define for a p.d. P on X the set of typical (or generated) sequences in the sense of Wolfowitz [10] T n V;P;ffi = fx n : 8x jN(xjx n ) Gamma ....
A. S. Holevo, "Coding Theorems for Quantum Channels", Tamagawa University Research Review no.4, 1998 (an extended version as LANL eprint quant-ph/9809023)
Quantum Channels and Simultaneous ID Coding - Löber (1999) (Correct)
....coding schemes that use measurements which may be used to identify every message. This means that the measurement the receiver has to perform to access the information is not allowed to depend on the message he s actually interested in. Investigation in quantum channels started in the 1960 s (see [8] for a list of references) leading to Holevo s famous upper bound ( 5] which implies immediately a weak converse for the transmission problem of the memoryless quantum channel. Even though it was undoubted that the appropriate coding theorem holds it was not before 1996 when people were able to ....
A. S. Holevo, "Coding Theorems for Quantum Channels," LANL Report no. quant-ph/9809023.
Quantum Information Theory - an Invitation - Werner (2001) (2 citations) (Correct)
No context found.
A.S. Holevo, "Coding theorems for Quantum Channels," Tamagawa University Research Review, No.4, 1998. (quant-ph/9809023).
On The Number of Elements Needed in a Povmattaining the Accessible .. - Shor (Correct)
No context found.
A. S. Holevo, "Coding theorems for quantum channels," Russian Math Surveys, vol. 53, pp. 1295--1331, 1998; LANL e-print quantph /9809023.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC