Related papers: Quantum Rate-Distortion Theory for I.I.D. Sources
Realism constraints (or constraints on perceptual quality) have received considerable recent attention within the context of lossy compression, particularly of images. Theoretical studies of lossy compression indicate that high-rate common…
We look into multipartite quantum states on which quantum cryptographic protocols including quantum key distribution and quantum secret sharing can be perfectly performed, and define the quantum cryptographic resource distillable rate as…
The recently proposed set-up of source coding with a side information "vending machine" allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the…
We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…
Advancing over up-to-date information theoretic results that assume symmetric correlation models, in this work we consider the problem of lossy binary source coding with side information, where the correlation is expressed by a generic…
We consider the problem of correcting the errors incurred from sending quantum information through a noisy quantum environment by using classical information obtained from a measurement on the environment. For discrete time Markovian…
The quantum dichotomies problem asks at what rate one pair of quantum states can be approximately mapped into another pair of quantum states. In the many copy limit and for vanishing error, the optimal rate is known to be given by the ratio…
The distortion-rate function of output-constrained lossy source coding with limited common randomness is analyzed for the special case of squared error distortion measure. An explicit expression is obtained when both source and…
In this paper we present a new proof technique for semi-quantum key distribution protocols which makes use of a quantum entropic uncertainty relation to bound an adversary's information. Our new technique provides a more optimistic key-rate…
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…
We improve the existing achievable rate regions for causal and for zero-delay source coding of stationary Gaussian sources under an average mean squared error (MSE) distortion measure. To begin with, we find a closed-form expression for the…
The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…
We discuss how to calculate genuine multipartite quantum and classical correlations in symmetric, spatially invariant, mixed $n$-qubit density matrices. We show that the existence of symmetries greatly reduces the amount of free parameters…
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent…
The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state.…
We introduce a theory of quantum resource degradation grounded in a decomposition of observational entropy, which partitions the total resource into inter-block coherence ($\mathcal{C}_{\text{rel}}$) and intra-block noise…
We consider the problem of lossy source coding with side information under a privacy constraint that the reconstruction sequence at a decoder should be kept secret to a certain extent from another terminal such as an eavesdropper, a sender,…
We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis techniques for deriving upper bounds for the expected…
We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…
We present an analytical solution for classical correlation, defined in terms of linear entropy, in an arbitrary $d\otimes 2$ system when the second subsystem is measured. We show that the optimal measurements used in the maximization of…