Related papers: Simple construction of quantum universal variable-…
We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate…
Suppose that a quantum source is known to have von Neumann entropy less than or equal to S but is otherwise completely unspecified. We describe a method of universal quantum data compression which will faithfully compress the quantum…
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…
The general scheme of data compression using the quantum noiseless coding theorem of Schumacher is dicussed for general quantum sources. When the Hilbert space of the quantum source is decomposable into orthogonal subspaces, one can first…
We consider the most general (finite-dimensional) quantum mechanical information source, which is given by a quantum system $A$ that is correlated with a reference system $R$. The task is to compress $A$ in such a way as to reproduce the…
Quantum state tomography--the practice of estimating a quantum state by performing measurements on it--is useful in a variety of contexts. We introduce "gentle tomography" as a version of tomography that preserves the measured quantum data.…
A classical random variable can be faithfully compressed into a sequence of bits with its expected length lies within one bit of Shannon entropy. We generalize this variable-length and faithful scenario to the general quantum source…
We report an experimental demonstration of Schumacher's quantum noiseless coding theorem. Our experiment employs a sequence of single photons each of which represents three qubits. We initially prepare each photon in one of a set of 8…
We show how universal codes can be used for solving some of the most important statistical problems for time series. By definition, a universal code (or a universal lossless data compressor) can compress any sequence generated by a…
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…
We introduce a universal quantization scheme based on random coding, and we analyze its performance. This scheme consists of a source-independent random codebook (typically_mismatched_ to the source distribution), followed by optimal…
Consider a source E of pure quantum states with von Neumann entropy S. By the quantum source coding theorem, arbitrarily long strings of signals may be encoded asymptotically into S qubits/signal (the Schumacher limit) in such a way that…
A generic approach for compiling any classical block compression algorithm into a quantum block compression algorithm is presented. Using this technique, compression asymptoticaly approaching the von Neumann entropy of a qubit source can be…
The quantum entropy-typical subspace theory is specified. It is shown that any mixed state with von Neumann entropy less than h can be preserved approximately by the entropy-typical subspace with entropy= h. This result implies an universal…
We derive the optimal exponent of the error probability of the quantum fixed-length pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al. (PRL, 81, 1714…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…
In the quantum compression scheme proposed by Schumacher, Alice compresses a message that Bob decompresses. In that approach, there is some probability of failure and, even when successful, some distortion of the state. For sufficiently…
Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…
This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper…