2000 character limit reached
QMA(2) with postselection equals to NEXP
Published 25 Jun 2018 in quant-ph | (1806.09732v1)
Abstract: We study the power of QMA(2) with postselection and show that the power is equal to NEXP. Our method for showing this equality can be also used to prove that other classes with exponentially small completeness-soundness gap equals to the corresponding postselection versions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.