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

量子NP与量子体系

Quantum NP and a Quantum Hierarchy

Tomoyuki Yamakami

摘要:

复杂性类NP在理论计算机科学中是典型的和普遍存在的。有两种不同的方法来定义“量子NP”,NP的量子类似物:Adleman,DeMarrais和Huang的NQP,以及Knill,Kitaev和Watrous的QMA。从算子的角度来看,NP可以被看作是存在算子应用于P的结果。最近,Green,Homer,Moore和Pollett提出了它的量子版本,称为N-算子,这是NQP的抽象。本文介绍了QMA的一个抽象形式--存在^{Q}-算子及其补充形式--全体^{Q}-算子。这些算子不仅定义了量子NP,而且还建立了一个量子层次,类似于Meyer-Stockmeyer多项式层次,基于双边有界误差量子计算。

英文摘要:

The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill, Kitaev, and Watrous. From an operator point of view, NP can be viewed as the result of the exists-operator applied to P. Recently, Green, Homer, Moore, and Pollett proposed its quantum version, called the N-operator, which is an abstraction of NQP. This paper introduces the exists^{Q}-operator, which is an abstraction of QMA, and its complement, the forall^{Q}-operator. These operators not only define Quantum NP but also build a quantum hierarchy, similar to the Meyer-Stockmeyer polynomial hierarchy, based on two-sided bounded-error quantum computation.

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

↑