arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.18010quant-phcs.CC
收藏

量子 NP 的 7 副面孔

The 7 faces of quantum NP

Sevag Gharibian

AI总结:

本文面向理论计算机科学读者,综述了QMA、QCMA等量子NP的多种定义及其优缺点,探讨它们在复杂性动物园中的自然定位。

摘要:

谈到 NP,其自然定义、跨学科适用性和持久相关性已成定论:只能有一个。然而,量子 NP 显然与 NP 大相径庭。自首批量子 NP 定义提出二十年来,量子复杂性理论家面临严峻现实:存在 QMA、QCMA、QMA1、QMA(2)、StoqMA 和 NQP。在本文中,面向一般理论计算机科学读者,我调查了量子 NP 的这些不同定义、优缺点,以及为何其中大多数无论好坏都自然融入复杂性动物园。

英文摘要:

When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo.

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

↑