Results 1  10
of
17
Quantum information theory
, 1998
"... We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum errorcorrecting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography. ..."
Abstract

Cited by 99 (3 self)
 Add to MetaCart
We survey the field of quantum information theory. In particular, we discuss the fundamentals of the field, source coding, quantum errorcorrecting codes, capacities of quantum channels, measures of entanglement, and quantum cryptography.
Quantum Information Theory and the Foundations of Quantum Mechanics
, 2004
"... This thesis is a contribution to the debate on the implications of quantum information theory for the foundational problems of quantum mechanics. In Part I an attempt is made to shed some light on the nature of information and quantum information theory. It is emphasized that the everyday notion of ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
This thesis is a contribution to the debate on the implications of quantum information theory for the foundational problems of quantum mechanics. In Part I an attempt is made to shed some light on the nature of information and quantum information theory. It is emphasized that the everyday notion of information is to be firmly distinguished from the technical notions arising in information theory; noun, hence does not refer to a particular or substance. The popular claim ‘Information is Physical ’ is assessed and it is argued that this proposition faces a destructive dilemma. Accordingly, the slogan may not be understood as an ontological claim, but at best, as a methodological one. A novel argument is provided against Dretske’s (1981) attempt to base a semantic notion of information on ideas from information theory. The function of various measures of information content for quantum systems is explored and the applicability of the Shannon information in the quantum context maintained against the challenge of Brukner and Zeilinger (2001). The phenomenon of quantum teleportation is then explored as a case study serving to emphasize the value of
On Quantum Coding for Ensembles of Mixed States
"... We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.
Introduction to quantum error correction
, 1998
"... An introduction to quantum error correction (QEC) is given, and some recent developments ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
An introduction to quantum error correction (QEC) is given, and some recent developments
Asymptotic Redundancies for Universal Quantum Coding
"... Clarke and Barron have recently shown that the Jereys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the twolevel quantum systems. We restri ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Clarke and Barron have recently shown that the Jereys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of this result for the twolevel quantum systems. We restrict our considerations to prior probability distributions belonging to a certain oneparameter family, qu , 1 < u < 1. Within this setting, we are able to compute exact redundancy formulas, for which we nd the asymptotic limits. We compare our quantum asymptotic redundancy formulas to those derived by naively applying the (nonquantum) counterparts of Clarke and Barron, and nd certain common features. Our results are based on formulas we obtain for the eigenvalues and eigenvectors of 2 n 2 n (Bayesian density) matrices, n (u). These matrices are the weighted averages (with respect to qu) of all possible tensor products of n identical 2 2 density matrices, representing the twolevel quantum systems. We propose a form of universal coding for the situation in which the density matrix describing an ensemble of quantum signal states is unknown. A sequence of n signals would be projected onto the dominant eigenspaces of n (u).
Quantum information and computation
 arXiv:quantph/0512125. Forthcoming in Butterfield and Earman (eds.) Handbook of Philosophy of Physics
, 2005
"... This Chapter deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum communication, quantum cryptography, and quantum computation, ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This Chapter deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum communication, quantum cryptography, and quantum computation, and concludes by considering whether a perspective in terms of quantum information