By Topic

Asymptotic redundancies for universal quantum coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Krattenthaler, C. ; Inst. fur Math., Wien Univ., Austria ; Slater, P.B.

Clarke and Barren (1990, 1994, 1995) have shown that the Jeffreys' 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 analog of this result for the two-level quantum systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, qu,-∞<u<1. Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to those derived by naively applying the (nonquantum) counterparts of Clarke and Barren, and find certain common features. Our results are based on formulas we obtain for the eigenvalues and eigenvectors of 2n×2n (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 two-level 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)

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )