arXiv:math/9705212 · IEEE Transactions on Information Theory

Asymptotic redundancies for universal quantum coding

Christian Krattenthaler, Paul B. Slater

Published May 1, 2000• 22 citations

Abstract

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, q/sub u/,-/spl infin/<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 2/sup n//spl times/2/sup n/ (Bayesian density) matrices, /spl zeta//sub n/(u). These matrices are the weighted averages (with respect to q/sub u/) of all possible tensor products of n identical 2/spl times/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 /spl zeta//sub n/(u).

DOI: 10.1109/18.841164

Related papers

Asymptotic Redundancies for Universal Quantum Coding

Christian Krattenthaler, Paul B. Slater

We investigate the question of whether or not there exists a noncommutative/ quantum extension of a recent (commutative probabilistic) result of Clarke and Barron. They demonstrated that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy - the excess of the encoding cost over the source entropy - of universal data compression in a parametric setting. We study certain probability distributions for the two-level quantum systems. We are able to compute exact formulas for the corresponding redundancies, for which we find the asymptotic limits. These results are very suggestive and do indeed point towards a possible quantum extension of the result of Clarke and Barron.

arXiv:quant-ph/9612043Dec 18, 19962 citations

Applications of quantum and classical Fisher information to two-level complex and quaternionic and three-level complex systems

Paul B. Slater

In the Bayesian theory of statistical inference, as first suggested by Harold Jeffreys in highly influential work, one can employ the square root of the determinant of an n×n Fisher information matrix as a reparametrization-invariant prior (generally unnormalized) measure over an n-dimensional family (Riemannian manifold) of probability distributions. Jeffreys’ ansatz is adopted here to the quantum context, that is, with regard to density matrices rather than probability distributions, by computing the quantum Fisher information matrices (associated with Helstrom and Holevo) for the three-, five-, and eight-dimensional convex sets of two-level complex, two-level quaternionic, and three-level complex systems, respectively. In both the two-level cases, the priors have been normalized to probability distributions over the 2×2 density matrices, while, in the much more computationally demanding three-level situation, no such normalization has been accomplished. An argument is made for the general form, in terms of eigenvalues, that the (unnormalized) prior should assume over the (n2−1)-dimensional convex set of n×n density matrices.

Journal of Mathematical PhysicsJun 1, 199617 citations

The quantum Jeffreys' prior/Bures metric volume element for squeezed thermal states and a universal coding conjecture

Paul B. Slater

Clarke and Barron have recently established that the (classical) Jeffreys' prior yields universal codes - ones which do relatively well (in the sense of relative entropy) no matter what the true state. Twamley has recently computed the Bures metric - proportional to the quantum Fisher information (statistical distinguishability) metric, as shown by Braunstein and Caves - for squeezed thermal states. The volume elements of these metrics - that is, the quantum Jeffreys' prior - are found to be simply the product of a function of the squeeze factor and a function of the inverse temperature, the phase being irrelevant in this regard. A computational strategy to find a universal coding using the quantum Jeffreys' prior - previously implemented for the two-level quantum systems - is then discussed.

Journal of Physics A Mathematical and GeneralDec 7, 199618 citations

Numerical Bayesian quantum-state assignment for a three-level quantum system. II. Average-value data with a constant, a Gaussian-like, and a Slater prior

Anders Månsson, PierGianLuca Porta Mana, Gunnar G. Bjork

This paper offers examples of concrete numerical applications of Bayesian quantum-state assignment methods to a three-level quantum system. The statistical operator assigned on the evidence of various measurement data and kinds of prior knowledge is computed partly analytically, partly through numerical integration (in eight dimensions) on a computer. The measurement data consist in the average of outcome values of N identical von Neumann projective measurements performed on N identically prepared three-level systems. In particular the large-N limit will be considered. Three kinds of prior knowledge are used: one represented by a plausibility distribution constant in respect of the convex structure of the set of statistical operators; another one represented by a prior studied by Slater, which has been proposed as the natural measure on the set of statistical operators; the last prior is represented by a Gaussian-like distribution centred on a pure statistical operator, and thus reflecting a situation in which one has useful prior knowledge about the likely preparation of the system. The assigned statistical operators obtained with the first two kinds of priors are compared with the one obtained by Jaynes' maximum entropy method for the same measurement situation. In the companion paper the case of measurement data consisting in absolute frequencies is considered.

arXiv:quant-ph/0701087Jan 15, 20071 citation

Aspects of Quantum Information Compression for Pure States

Richard Jozsa

Consider a source of pure quantum states with density matrix ρ and von Neumann entropy S . It is known that the quantum information of the source may be faithfully compressed to 5 qubits/signal (asymptotically for long sequences) and that this limit is optimal if we demand high fidelity for long strings of signals. The usual method for achieving this compression, based on the typical subspace of the source, requires knowledge of the density matrix. We describe a new “universal” compression scheme which does not even require knowledge of ρ. More precisely, suppose that the source is known to have von Neumann entropy less than some given bound S 0 but is otherwise completely unspecified. Our method will faithfully compress the quantum information of any such source to S 0 qubits/signal. It is known that S is always less than or equal to the Shannon entropy H of the prior distribution of the source. According to Shannon’s theorem, H provides the limit for compression of classical signals, so one may ask the question: what is the physical origin of the extra compression available in the quantum case compared to the classical case (where the prior probabilities are the same)? One may suggest that this effect is a consequence of possible non-orthogonality of signal states. However we demonstrate that it is possible to make each pair of signal states of a source more parallel (keeping the prior probabilities the same) while increasing the von Neumann entropy. This casts doubt on the conventional wisdom that overlap of quantum states is a measure of their (non-)distinguishability. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooksDec 19, 20051 citation

Numerical Bayesian state assignment for a three-level quantum system. I. Absolute-frequency data; constant and Gaussian-like priors

Anders Månsson, PierGianLuca Porta Mana, Gunnar G. Bjork

This paper offers examples of concrete numerical applications of Bayesian quantum-state-assignment methods to a three-level quantum system. The statistical operator assigned on the evidence of various measurement data and kinds of prior knowledge is computed partly analytically, partly through numerical integration (in eight dimensions) on a computer. The measurement data consist in absolute frequencies of the outcomes of N identical von Neumann projective measurements performed on N identically prepared three-level systems. Various small values of N as well as the large-N limit are considered. Two kinds of prior knowledge are used: one represented by a plausibility distribution constant in respect of the convex structure of the set of statistical operators; the other represented by a Gaussian-like distribution centred on a pure statistical operator, and thus reflecting a situation in which one has useful prior knowledge about the likely preparation of the system. In a companion paper the case of measurement data consisting in average values, and an additional prior studied by Slater, are considered.

arXiv:quant-ph/0612105Dec 13, 20063 citations