We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(\overline{\rho}_p), tend to 0. If H(\overline{\rho}_p) is estimated, we can compress the coding rate to the admissible rate H(\overline{\rho}_p) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(\overline{\rho}_p), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(\overline{\rho}_p) and the non-demolition of the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.
This paper describes the construction of a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate H(/spl rho/~/sub p/), tend to 0. If H(/spl rho/~/sub p/) is estimated, and compress the coding rate to the admissible rate H(/spl rho/~/sub p/) with a probability close to 1. However, when we perform a naive measurement for the estimation of H(/spl rho/~/sub p/), the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of H(/spl rho/~/sub p/) and the nondemolition of the input state. Our protocol can be used not only for the Schumacher's compression but also for the compression of entangled states.
Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers
m and
l. We encode any tensor product of
m many states emitted by the quantum stochastic source by breaking the tensor product into
m many blocks where each block has length
l, and considering sequences of
m many isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call \lq\lq special block codes\rq\rq\ in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers
m,
l, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e.\ for
m=1. Lastly, we give a simplified non-adaptive compression technique based on constrained special block codes for general quantum stochastic sources. For quantum stationary sources in particular, we show that the minimum average codeword length per symbol computed over all constrained special block codes is equal to the von-Neumann entropy rate of the source for an asymptotically long block size.
Consider a general quantum stochastic source that emits at discrete time steps quantum pure states which are chosen from a finite alphabet according to some probability distribution which may depend on the whole history. Also, fix two positive integers
mand l. We encode any tensor product of ml many states emitted by the given quantum source by breaking it into
mmany blocks where each block has length l, and considering sequences of
mmany isometries so that each isometry encodes one of these blocks into the Fock space, followed by the concatenation of their images. We only consider certain sequences of such isometries that we call “special block codes” in order to ensure that the string of encoded states is uniquely decodable. We compute the minimum average codeword length of these encodings which depends on the quantum source and the integers m, l, among all possible special block codes. Our result extends the result of [Bellomo, Bosyk, Holik and Zozor, Scientific Reports 7.1 (2017): 14765] where the minimum was computed for one block, i.e. for m = 1.
Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some known ensemble and needs to transmit them to the receiver Bob with average error below some specified bound. We consider the case in which the message can have a variable length and the goal is to minimize its expected length. For classical messages this problem has a well-known solution given by Huffman coding. In this scheme, the expected length of the message is equal to the Shannon entropy of the source (with a constant additive factor) and the scheme succeeds with zero error. This is a single-shot result which implies the asymptotic result, viz. Shannon's source coding theorem, by encoding each state sequentially. For the quantum case, the asymptotic compression rate is given by the von-Neumann entropy. However, we show that there is no one-shot scheme which is able to match this rate, even if interactive communication is allowed. This is a relatively rare case in quantum information theory when the cost of a quantum task is significantly different than the classical analogue. Our result has implications for direct sum theorems in quantum communication complexity and one-shot formulations of Quantum Reverse Shannon theorem.