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.
Automata and Quantum Computing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.