5 papers · 1 filter
Optimal entanglement-assisted source coding under a balanced-difference promise
Julius A. Zeiss
Entanglement can reduce the communication required for coding tasks, but establishing the minimum achievable cost is essential to understanding its limits. We address this question…
Sharp continuity of quantum conditional entropy
Mario Berta, Pablo Costa Rico, Gereon Kossmann +2
We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most and , the optimal dimension-only mo…
Fixed points in de Finetti hierarchies
Gereon Kossmann, Julius A. Zeiss
De Finetti theorems convert permutation symmetry into approximate mixtures of product states and thereby justify a wide range of reductions in classical and quantum statistics. In…
On approximate quantum error correction for symmetric noise
Gereon Koßmann, Julius A. Zeiss, Omar Fawzi +1
We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds…
Approximating fixed size quantum correlations in polynomial time
Julius A. Zeiss, Gereon Koßmann, Omar Fawzi +1
We show that -additive approximations of the optimal value of fixed-size two-player free games with fixed-dimensional entanglement assistance can be computed in time $…