Universal quantum information compression and degrees of prior knowledge

نویسندگان

  • Richard Jozsa
  • Stuart Presnell
چکیده

We describe a universal information compression scheme that compresses any pure quantum i.i.d. source asymptotically to its von Neumann entropy, with no prior knowledge of the structure of the source. We introduce a diagonalisation procedure that enables any classical compression algorithm to be utilised in a quantum context. Our scheme is then based on the corresponding quantum translation of the classical Lempel– Ziv algorithm. Our methods lead to a conceptually simple way of estimating the entropy of a source in terms of the measurement of an associated length parameter while maintaining high fidelity for long blocks. As a by-product we also estimate the eigenbasis of the source. Since our scheme is based on the Lempel–Ziv method, it can be applied also to target sequences that are not i.i.d.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Quantum Compression with Minimal Prior Knowledge

A Universal Compression scheme is presented, to compress sequences of quantum information from unknown quantum sources (i.e. described by unknown density matrix ρ) asymptotically to S(ρ), with fidelity bounded toward unity. The introduction of a“B-diagonalisation” process allows us to treat the input as if it were diagonal in a known basis B. Applying a version of the Lempel-Ziv algorithm in th...

متن کامل

Asymptotic redundancies for universal quantum coding

Abstract. Clarke and Barron have recently 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 analogue of this result for the two-level quantum systems. We restrict our considerations to prior probability distributions belonging to a certain one-paramet...

متن کامل

Universal coding for classical-quantum channel

We construct a universal code for stationary and memoryless classicalquantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.

متن کامل

ar X iv : m at h - ph / 0 30 50 16 v 1 8 M ay 2 00 3 The von Neumann entropy and information rate for integrable quantum Gibbs ensembles , 2

This paper considers the problem of data compression for dependent quantum systems. It is the second in a series under the same title which began with [6] and continues with [12]. As in [6], we are interested in Lempel–Ziv encoding for quantum Gibbs ensembles. Here, we consider the canonical ideal lattice Boseand Fermi-ensembles. We prove that as in the case of the grand canonical ensemble, the...

متن کامل

Optimal compression for identically prepared qubit states

We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003