pith. sign in

arxiv: 1107.5460 · v3 · pith:FB6TPAU3new · submitted 2011-07-27 · 🪐 quant-ph · math-ph· math.MP

The Smooth Entropy Formalism for von Neumann Algebras

classification 🪐 quant-ph math-phmath.MP
keywords quantumneumannsmoothalgebrasdiscussentropyfinite-dimensionalformalism
0
0 comments X
read the original abstract

We discuss information-theoretic concepts on infinite-dimensional quantum systems. In particular, we lift the smooth entropy formalism as introduced by Renner and collaborators for finite-dimensional systems to von Neumann algebras. For the smooth conditional min- and max-entropy we recover similar characterizing properties and information-theoretic operational interpretations as in the finite-dimensional case. We generalize the entropic uncertainty relation with quantum side information of Tomamichel and Renner and discuss applications to quantum cryptography. In particular, we prove the possibility to perform privacy amplification and classical data compression with quantum side information modeled by a von Neumann algebra.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization

    quant-ph 2025-11 unverdicted novelty 7.0

    A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.