pith. sign in

arXiv preprint quant-ph/0208131 , year=

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

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 channel coding and rate--distortion theory: in the first two subjects ``inverses'' to established coding theorems can be derived, yielding a new approach to proving converse theorems, in the third we find a new proof of Shannon's rate--distortion theorem. After reviewing the known lower bound for the optimal compression rate, we present a number of approaches to achieve it by code constructions. Our main results are: a better understanding of the known lower bounds on the compression rate by means of a strong version of this statement, a review of a construction achieving the lower bound by using common randomness which we complement by showing the optimal use of the latter within a class of protocols. Then we review another approach, not dependent on common randomness, to minimizing the compression rate, providing some insight into its combinatorial structure, and suggesting an algorithm to optimize it. The second part of the paper is concerned with the generalization of the problem to quantum information theory: the compression of mixed quantum states. Here, after reviewing the known lower bound we contribute a strong version of it, and discuss the relation of the problem to other issues in quantum information theory.

fields

quant-ph 2

years

2026 1 2024 1

verdicts

UNVERDICTED 2

representative citing papers

An Operational Framework for Nonclassicality in Quantum Communication Networks

quant-ph · 2024-03-05 · unverdicted · novelty 7.0

A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sender broadcast networks but not in multi-sender networks.

Toward the Goldilocks blind compression of quantum states

quant-ph · 2026-05-02 · unverdicted · novelty 7.0

For any distribution of pure n-qubit states, a QAE with k encoder ancillas and n decoder ancillas achieves the optimal average fidelity among all CPTP encoder-decoder pairs, with the encoder threshold proven sharp.

citing papers explorer

Showing 2 of 2 citing papers.

  • An Operational Framework for Nonclassicality in Quantum Communication Networks quant-ph · 2024-03-05 · unverdicted · none · ref 8 · internal anchor

    A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sender broadcast networks but not in multi-sender networks.

  • Toward the Goldilocks blind compression of quantum states quant-ph · 2026-05-02 · unverdicted · none · ref 48

    For any distribution of pure n-qubit states, a QAE with k encoder ancillas and n decoder ancillas achieves the optimal average fidelity among all CPTP encoder-decoder pairs, with the encoder threshold proven sharp.