首页> 外文会议>IEEE Conference on Computational Complexity >On Physical Problems that are Slightly More Difficult than QMA
【24h】

On Physical Problems that are Slightly More Difficult than QMA

机译:关于稍微困难的身体问题比QMA困难

获取原文

摘要

We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We introduce new complexity classes consisting of problems that are solvable with a small number of queries to a QMA oracle and use these complexity classes to quantify the complexity of several natural computational problems (for example, the complexity of estimating the spectral gap of a Hamiltonian).
机译:我们研究了量子物理学的计算问题的复杂性。通常,使用复杂性QMA(NP的量子对应物)研究它们,但一些自然的计算问题似乎略高于QMA。我们介绍了由QMA Oracle少量查询的问题组成的新复杂性等级,并使用这些复杂性类来量化几种自然计算问题的复杂性(例如,估计Hamiltonian的光谱间隙的复杂性) 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号