量子唯一博弈猜想
A Quantum Unique Games Conjecture
AI总结:
本文提出量子唯一博弈猜想,通过定义Label-Cover和Unique-Label-Cover的量子扩展,证明其在研究量子约束满足问题不可近似性中具有与经典情形同样关键的作用。
摘要:
在3SAT和MaxCut等计算问题的NP困难性被确立之后,一个自然的后续步骤是探索这些问题是否仍然难以近似。虽然其中一些问题的量子扩展已知是困难的——实际上是不可判定的——但它们的不可近似性在很大程度上仍未解决。在这项工作中,我们引入了Label-Cover和Unique-Label-Cover的量子扩展的定义。我们证明这些问题在研究量子约束满足问题的不可近似性方面,与它们在经典环境中所起的作用同样关键。
英文摘要:
After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While the quantum extensions of some of these problems are known to be hard-indeed undecidable-their inapproximability remains largely unresolved. In this work, we introduce definitions for the quantum extensions of Label-Cover and Unique-Label-Cover. We show that these problems play a similarly crucial role in studying the inapproximability of quantum constraint satisfaction problems as they do in the classical setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。