Related papers: Visible compression of commuting mixed states
We study classical source coding with quantum side-information where the quantum side-information is observed by a helper and sent to the decoder via a classical channel. We derive a single-letter characterization of the achievable rate…
We study exact local compression of a quantum bipartite state; that is, applying local quantum operations to reduce the dimensions of the Hilbert spaces while perfectly preserving the correlation. We provide a closed-form expression for the…
We derive an uncertainty relation for two unitary operators which obey a commutation relation of the form UV=exp[i phi] VU. Its most important application is to constrain how much a quantum state can be localised simultaneously in two…
We study the problem of separating the data produced by a given quantum measurement (on states from a memoryless source which is unknown except for its average state), described by a positive operator valued measure (POVM), into a…
Visual data compression is shifting from human-centered reconstruction to machine-oriented representation coding. In this setting, an image is often mapped to a compact semantic embedding, which is then compressed and transmitted for…
Communicating information, like gradient vectors, between computing nodes in distributed and federated learning is typically an unavoidable burden, resulting in scalability issues. Indeed, communication might be slow and costly. Recent…
We present mathematical techniques for addressing two closely related questions in quantum communication theory. In particular, we give a statistically motivated derivation of the Bures-Uhlmann measure of distinguishability for density…
We analyze the ultimate quantum limit on the accessible information for an optical communication scheme when time bins carry coherent light pulses prepared in one of several orthogonal modes and the phase undergoes diffusion after each…
We consider iterative (`turbo') algorithms for compressed sensing. First, a unified exposition of the different approaches available in the literature is given, thereby enlightening the general principles and main differences. In particular…
An important practical open question has been to design explicit, structured optical receivers that achieve the Holevo limit in the contexts of optical communication and "quantum reading." The Holevo limit is an achievable rate that is…
This paper studies the joint data and semantics lossy compression problem, i.e., an extension of the hidden lossy source coding problem that entails recovering both the hidden and observable sources. We aim to study the nonasymptotic and…
The quantum states of two laser pulses---coherent states---are never mutually orthogonal, making perfect discrimination impossible. Even so, coherent states can achieve the ultimate quantum limit for capacity of a classical channel, the…
It is well known that lossless compression of a discrete memoryless source with near-uniform encoder output is possible at a rate above its entropy if and only if the encoder is randomized. This work focuses on deriving conditions for…
In a distributed information application an encoder compresses an arbitrary vector while a similar reference vector is available to the decoder as side information. For the Hamming-distance similarity measure, and when guaranteed perfect…
Recent advances in distributed optimization and learning have shown that communication compression is one of the most effective means of reducing communication. While there have been many results on convergence rates under communication…
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information…
Contraction coefficients give a quantitative strengthening of the data processing inequality. As such, they have many natural applications whenever closer analysis of information processing is required. However, it is often challenging to…
We study measures of quantum information when the space spanned by the set of accessible observables is not closed under products, i.e., we consider systems where an observer may be able to measure the expectation values of two operators,…
Inspired by mobile satellite communication systems and the important and prevalent applications of computational tasks, we consider a distributed source coding model for compressing vector-linear functions, which consists of multiple…
The Holevo bound is a keystone in many applications of quantum information theory. We propose "weak maximal Holevo quantity" with weak measurements as the generalization of the standard Holevo quantity which is defined as the optimal…