文章基本信息

标题：Quantum Interactive Proofs and the Complexity of Separability Testing
本地全文：下载
作者：Gus Gutoski ; Patrick Hayden ; Kevin Milner 等
期刊名称：Theory of Computing
印刷版ISSN：1557-2862
电子版ISSN：1557-2862
出版年度：2015
卷号：11
页码：59-103
出版社：University of Chicago
摘要：We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum interactive proof complexity class (including $\mathsf{BQP}$, $\mathsf{QMA}$, $\mathsf{QMA}(2)$, and $\mathsf{QSZK}$), there corresponds a natural separability testing problem that is complete for that class. Of particular interest is the fact that the problem of determining whether an isometry can be made to produce a separable state is either $\mathsf{QMA}$-complete or $\mathsf{QMA}(2)$-complete, depending upon whether the distance between quantum states is measured by the one-way LOCC norm or the trace norm. We obtain strong hardness results by employing prior work on entanglement purification protocols to prove that for each $n$-qubit maximally entangled state there exists a fixed one-way LOCC measurement that distinguishes it from any separable state with error probability that decays exponentially in $n$.
关键词：quantum entanglement; quantum complexity theory; quantum interactive proofs; quantum statistical zero knowledge; BQP; QMA; QSZK; QIP; separability testing