BQP以上复杂性类的Merlinization
Merlinization of complexity classes above BQP
摘要:
我们研究了BQP之上的复杂性类,如postBQP、${\rm postBQP}_{\rm FP}$和SBQP,如果我们“Merlinize”它们,即,如果我们允许一个额外输入量子态(或经典比特串),由Merlin给出作为见证。主要结果有以下三个:第一,Merlinized版本的postBQP等于PSPACE。第二,如果梅林化后BQP被限制在这样一种方式,即后选择概率等于所有的见证状态,那么类等于PP。最后,Merlinization不会更改类SBQP。
英文摘要:
We study how complexity classes above BQP, such as postBQP, ${\rm postBQP}_{\rm FP}$, and SBQP, change if we "Merlinize" them, i.e., if we allow an extra input quantum state (or classical bit string) given by Merlin as witness. Main results are the following three: First, the Merlinized version of postBQP is equal to PSPACE. Second, if the Merlinized postBQP is restricted in such a way that the postselection probability is equal to all witness states, then the class is equal to PP. Finally, the Merlinization does not change the class SBQP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。