P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. K. Wootters, "Classical information capacity of a quantum channel," Phys. Rev. A, vol. 54, no. 3, pp. 1869-1876, 1996.  Home/Search   Document Details and Download   Summary   APS   Related Articles   Check

....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 prove this direct part of the coding theorem ([6], 9] 14] Today it s also known that the strong converse holds ( 13] 16] and that things work for non stationary quantum channels, too ( 17] The contents of this thesis essentially coincides with the contents of my preprint [12] 5 2 Basic Definitions and Main Results Definition 2.1 ....

.... ( 1 ; 2 ) C : Here as usual, C fulfills the formula C = max P PD on A H( PW ) Gamma X x2A P (x)H( W x ) with H( W x ) Gamma tr ( W x Delta log W x ) where for a state oe 2 S(H) we wrote oe 2 L(H) for the uniquely defined operator with oe = tr (oe Delta ) See [6], or for general input states [9] or [14] for a proof of C 0 C, and [13] or [16] for C 1 C. Of course, our theorems apply to other quantum channels, too, e.g. to the non stationary quantum channels (cf. 17] 10 We shall prove Coding Theorem 2.11 in the next section. At the end of Section ....

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. K. Wootters, "Classical information capacity of a quantum channel," Phys. Rev. A, vol. 54, no. 3, pp. 1869-1876, 1996.

....to him) Moreover, entanglement cannot even be used to compress the information in x: for Alice to convey x to Bob, she must in general send n bits any smaller number will not su#ce. The proof of this is based on a fundamental theorem in quantum information theory due to Holevo [17] see also [16, 10]) Similar results apply to communication involving more than two parties. Now consider the communication complexity scenario introduced by Yao [33] Alice obtains an n bit string x and Bob obtains an n bit string y, and the goal is for them to determine f(x, y) for some function f : 0, 1 ....

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, and W.K. Wootters, Classical information capacity of a quantum channel, Phys. Rev. A (3), 54 (1996), pp. 1869-- 1876.

....created: 1996##CITEEND##.11.15) The Capacity of Quantum Channel with General Signal States A.S.Holevo Steklov Mathematical Institute, Vavilova 42, 117966 Moscow, Russia (e mail: HOLEVO CLASS.MI.RAS.RU) Abstract It is shown that the capacity of a classical quantum channel with arbitrary (possibly mixed) states equals ....

....created: 1996.11. 15) The Capacity of Quantum Channel with General Signal States A.S.Holevo Steklov Mathematical Institute, Vavilova 42, 117966 Moscow, Russia (e mail: HOLEVO CLASS.MI.RAS.RU) Abstract It is shown that the capacity of a classical quantum channel with arbitrary (possibly mixed) states equals to the ....

[Article contains additional citation context not shown here]

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. Wooters, Classical information capacity of a quantum channel, Phys. Rev. A 54, 1869-1876 (1996).

....noncommutativity. Keywords Quantum channel coding theorem, average error probability, strong converse, operator monotone 1 Introduction Recently, the quantum channel coding theorem was established by Holevo [9] and by Schumacher and Westmoreland [15] after the breakthrough of Hausladen et al. [7]. Furthermore, a upper bound on the probability of decoding error, in case rate below capacity, was derived by Burnashev and Holevo [2] It is limited in pure signal state. They conjectured on a upper bound in general signal state, which corresponds to Gallager s bound [5] in classical information ....

P. Hausladen, R. Jozsa, B. Schumacher, M. D. Westmoreland, and W. K. Wootters, \Classical information capacity of a quantum channel," Phys. Rev. A, vol. 54, pp. 1869-1876, 1996.

....disentangled states. The inequality C 6= C 1 raised the problem of the actual value of the capacity C. A possible conjecture was C = C, but the proof for it came only recently, first for the pure state (noiseless) channels in the paper of Hausladen, Jozsa, Schumacher, Westmoreland and Wootters [Hausladen et al. 1996], and then for the case of arbitrary signal states in [Holevo 1996] and in [Schumacher and Westmoreland 1997] Since the entropy bound (2) and the classical weak converse provide the converse of the quantum coding theorem, the main problem was the proof of the direct coding theorem, i.e. of the ....

.... Osaki and Suzuki [Kato et al. 1996] The quantity C was discussed in [Holevo 1979] Stratonovich and Vantsjan 1978] but its real information theoretic meaning is elucidated only in connection with the quantum reliability function (see (15) below) The proof of the inequality C C given in [Hausladen et al. 1996] achieves the goal by using the approximate maximum likelihood improved with projection onto the typical subspace of the density operator S Omega n and the correspondingly modified coarse bound for the error probability. The coarseness of the bound is thus compensated by eliminating ....

[Article contains additional citation context not shown here]

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. Wootters, "Classical information capacity of a quantum channel," Phys. Rev. A, vol. 54, no. 3, pp. 1869-1876 1996.

....cf. e.g. opinion uttered by Adami and Cerf [5] We take the view that classical quantum problems are those in which classical information has to be stored in or sent trough some quantum system. Examples from recent work are the determination of the quantum channel capacity for fixed input states [6 8], quantum cryptographic protocols [9,10] and entanglement enhanced transmission (superdense coding) 11] Our approach is somewhat reminiscent of quantum probability through its formulation in terms of C algebras and its emphasis on observable operators (which reflects our dwelling in the ....

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. K. Wootters, "Classical information capacity of a quantum channel", Phys. Rev. A 54,3(1997), 1869--1876

....efficiency of the optimal measurement is calculated in the large deviation sense. 1 Introduction Recently, relating to researches of optical communications, quantum optics and quantum computer, there has been more and more necessity of researches for statistical estimation of quantum states [1] [3] However, we have few mathematical rigorous formulations about a statistical estimation for quantum states. Helstrom developed a general local estimation theory for one parameter families [4] 5] To the author s knowledge, there are only three models of multi parameter family whose attainable ....

P. Hausladen, R. Josa, B. Schumacher, M. Westmoreland, W. Wooters, "Classical information capacity of a quantum channel," Phys. Rev. A 54, 1869-1876 (1996).

....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 prove this direct part of the coding theorem ([4], 7] 10] Today it s also known that the strong converse holds ( 9] 12] and that things work for non stationary quantum channels, too ( 13] II. Basic Definitions and Main Results Definition 2.1: Let A = f1; ag a finite set and H a finite dimensional (complex) Hilbert space with ....

.... ; 2 ) C : Here C is given by the usual formula C = max P PD on A H( PW ) Gamma X x2A P (x)H( W x ) 4 with H( W x ) Gamma tr ( W x Delta log W x ) where for a state oe 2 S(H) we wrote oe 2 L(H) for the uniquely defined operator with oe = tr (oe Delta ) See [4], or for general input states [7] or [10] for a proof of C 0 C, and [9] or [12] for C 1 C. Of course our theorems apply to other quantum channels, too, e.g. to the non stationary quantum channels (cf. 13] We will prove Coding Theorem 2.11 in the next section. At the end of the fourth ....

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. K. Wootters, "Classical information capacity of a quantum channel," Phys. Rev. A, vol. 54, no. 3, pp. 1869-1876, 1996.

....There is a simple argument that the Holevo quantity for an ensemble E = fp i ; i g of mixed states is a lower bound on the rate at which such an ensemble can be coded. This argument uses the result, shown for pure state ensembles by Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters [21] and for general mixed state ensembles by Holevo [22] and by Schumacher and Westmoreland [23] that the Holevo quantity for an ensemble E is the capacity for classical information transmission using the states in the ensemble E as an alphabet. The gist of the argument is that if an ensemble of ....

Paul Hausladen, Richard Jozsa, Benjamin Schumacher, Michael Westmoreland, and William K. Wootters, \Classical information capacity of a quantum channel," Physical Review A, vol. 54, no. 3, pp. 1869-1876, 1996.

....states is a lower bound on the rate at which such an ensemble can be coded. Here we use 14 the global fidelity criterion (GLOBAL FID) and encoding may be blind or visible. This argument uses the result, shown for pure state ensembles by Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters [21] and for general mixed state ensembles by Holevo [22] and by Schumacher and Westmoreland [23] that the Holevo quantity for an ensemble E is the capacity for classical information transmission using the states in the ensemble E as an alphabet. The gist of the argument is that if an ensemble of ....

P. Hausladen, R. Jozsa, B. W. Schumacher, M. Westmoreland, and W. K. Wootters, "Classical information capacity of a quantum channel," Physical Review A, vol. 54, pp. 1869--1876, 1996.

No context found.

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. Wooters, Classical information capacity of a quantum channel, Phys. Rev. A 54, 1869-1876 (1996).

No context found.

P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, W. Wooters, Classical information capacity of a quantum channel, Phys. Rev. A 54, 1869-1876 (1996).

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