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 that QIP \subseteq \EXP.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
