REVIEW 1 cited by
On the complexity of approximating the diamond norm
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
read the original abstract
The diamond norm is a norm defined over the space of quantum transformations. This norm has a natural operational interpretation: it measures how well one can distinguish between two transformations by applying them to a state of arbitrarily large dimension. This interpretation makes this norm useful in the study of quantum interactive proof systems. In this note we exhibit an efficient algorithm for computing this norm using convex programming. Independently of us, Watrous recently showed a different algorithm to compute this norm. An immediate corollary of this algorithm is a slight simplification of the argument of Kitaev and Watrous [STOC 2000] that QIP is contained in EXP.
Forward citations
Cited by 1 Pith paper
-
A Unified Blockwise Measurement Design for Learning Quantum Channels and Lindbladians via Low-Rank Matrix Sensing
A blockwise matrix-sensing measurement design recovers low-rank quantum channels and Lindbladians with near-optimal sample counts and large computational speedups.
Discussion (0). Continue with ORCID to comment.