arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.05641quant-phcs.CC
收藏

经典非因果模型的计算驯服性

Computational tameness of classical non-causal models

Ämin Baumeler, Stefan Wolf

摘要:

我们表明,计算能力的非因果电路模型,即,用逻辑一致性假设代替全局因果顺序假设的电路模型完全由复杂性类$\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$表征。这类问题的一个例子是因式分解。我们的结果意味着,经典的确定性封闭类时曲线(CTC)不能有效地解决问题,位于该类之外。因此,与其他CTC模型形成鲜明对比的是,这些CTC不能有效地解决~ $\operatorname{\mathsf{NP-complete}}$问题,除非~ $\operatorname{\mathsf{NP}}=\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}=\operatorname{\mathsf{coNP}}$,这使得它们在自然界中的存在显得不那么令人难以置信。该结果给出了~ $\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$的不动点的新刻画。

英文摘要:

We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity class~$\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$. An example of a problem in that class is factorization. Our result implies that classical deterministic closed timelike curves (CTCs) cannot efficiently solve problems that lie outside of that class. Thus, in stark contrast to other CTC models, these CTCs cannot efficiently solve~$\operatorname{\mathsf{NP-complete}}$ problems, unless~$\operatorname{\mathsf{NP}}=\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}=\operatorname{\mathsf{coNP}}$, which lets their existence in nature appear less implausible. This result gives a new characterization of~$\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$ in terms of fixed points.

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

↑