• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computational complexity >QUANTUM GENERALIZATIONS OF THE POLYNOMIAL HIERARCHY WITH APPLICATIONS TO QMA(2)
【24h】

QUANTUM GENERALIZATIONS OF THE POLYNOMIAL HIERARCHY WITH APPLICATIONS TO QMA(2)

机译：QUANTUM GENERALIZATIONS OF THE POLYNOMIAL HIERARCHY WITH APPLICATIONS TO QMA(2)

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH do not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma(3), into NEXP using the ellipsoid method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent''), then QMA(2) is in the counting hierarchy (specifically, in P-pppp). Second, because QMA(2)subset of Q Sigma(3), QMA(2) is strictly contained in NEXP unless QMA(2)=Q Sigma(3) (i.e., alternating quantifiers do not help in the presence of "unentanglement'').

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号