Pith. sign in

REVIEW

On simultaneous min-entropy smoothing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1312.7642 v1 pith:JDD3AQLF submitted 2013-12-30 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords marginalsprovestateexistencegeneralmultipartypossiblequantum
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the context of network information theory, one often needs a multiparty probability distribution to be typical in several ways simultaneously. When considering quantum states instead of classical ones, it is in general difficult to prove the existence of a state that is jointly typical. Such a difficulty was recently emphasized and conjectures on the existence of such states were formulated. In this paper, we consider a one-shot multiparty typicality conjecture. The question can then be stated easily: is it possible to smooth the largest eigenvalues of all the marginals of a multipartite state {\rho} simultaneously while staying close to {\rho}? We prove the answer is yes whenever the marginals of the state commute. In the general quantum case, we prove that simultaneous smoothing is possible if the number of parties is two or more generally if the marginals to optimize satisfy some non-overlap property.

Discussion (0). Sign in to comment.

Pith tools