Related papers: Visible compression of commuting mixed states
We provide a rate distortion interpretation of the problem of quantum data compression of ensembles of mixed states with commuting density operators. There are two versions of this problem. In the visible case the sequence of states is…
We consider the problem of compression of the quantum information carried by ensemble of mixed states. We prove that for arbitrary coding schemes the least number of qubits needed to convey the signal states asymptotically faithfully is…
We consider the problem of the optimal compression rate in the case of the source producing mixed signal states within the {\it visible} scheme (where Alice, who is to compress the signal, can know the identities of the produced states). We…
We consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob knows the source statistics, and that Alice and Bob have identical…
We give a direct tensor decomposition for any density matrix into Hermitian operators. Based upon the decomposition we study when the mixed states are separable and generalize the separability indicators to multi-partite states and show…
In blind compression of quantum states, a sender Alice is given a specimen of a quantum state $\rho$ drawn from a known ensemble (but without knowing what $\rho$ is), and she transmits sufficient quantum data to a receiver Bob so that he…
In this paper, we derived Lorentz covariant quantum Liouville equation for the density operator which describes the relativistic quantum information processing from Tomonaga-Schwinger equation and an exact formal solution for the…
We present a formula that determines the optimal number of qubits per message that allows asymptotically faithful compression of the quantum information carried by an ensemble of mixed states. The set of mixed states determines a…
Suppose we want to benchmark a quantum device held by a remote party, e.g. by testing its ability to carry out challenging quantum measurements outside of a free set of measurements $\mathcal{M}$. A very simple way to do so is to set up a…
We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon's source coding problem. It has relation to the theory of common randomness, as well as to…
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…
In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical…
According to Popescu's recent analysis [Phys. Rev. Lett. {\bf72}, 797 (1994)], {\it nonideal} measurements, rather than ideal ones, may be more sensitive to reveal nonlocal correlations between distant parts of composite quantum systems.…
We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the…
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a…
Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This work treats and solves the…
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…
We present a universal Holevo-like upper bound on the locally accessible information for arbitrary multipartite ensembles. This bound allows us to analyze the indistinguishability of a set of orthogonal states under LOCC. We also derive the…
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…
This paper deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator $\rho_0$. It is well-known that the minimal error probability is given by…