arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 0902.3397quant-ph
收藏

关于钻石模逼近的复杂性

On the complexity of approximating the diamond norm

Avraham Ben-Aroya, Amnon Ta-Shma

摘要:

钻石范数是在量子变换空间上定义的范数。这个规范有一个自然的操作解释:它衡量一个人通过将两个变换应用于任意大维度的状态来区分两个变换的程度。这种解释使得这个规范在量子交互证明系统的研究中非常有用。在这篇文章中,我们展示了一个有效的算法计算这个范数使用凸规划。独立于我们,Watrous最近展示了一种不同的算法来计算这个范数。该算法的直接推论是Kitaev和Watrous [STOC 2000]的论点的略微简化,即QIP包含在EXP中。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑