PSPACE, hence QIP, is contained in the class of languages verifiable by Arthur-Merlin proof systems whose verifier is a two-way automaton with a constant-size quantum memory.
Trading group theory for randomness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
QIP $ \subseteq $ AM(2QCFA)
PSPACE, hence QIP, is contained in the class of languages verifiable by Arthur-Merlin proof systems whose verifier is a two-way automaton with a constant-size quantum memory.