Debates with Small Transparent Quantum Verifiers

DOI10.1142/S0129054116400104zbMath1344.68133OpenAlexW2952260275MaRDI QIDQ5890816

A. C. Cem Say, H. Gökalp Demirci, Abuzer Yakaryılmaz

Publication date: 23 June 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116400104

zbMATH Keywords

quantum computingquantum finite automataprobabilistic finite automatazero-errorArthur-Merlin gamesdebate systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68)

Related Items (3)

Quantum alternation ⋮ Modeling of RNA secondary structures using two-way quantum finite automata ⋮ Constant-space, constant-randomness verifiers with arbitrarily small error

Cites Work

• The complexity of debate checking
• Unbounded-error quantum computation with small space bounds
• A new family of nonstochastic languages
• On nonstochastic languages and homomorphic images of stochastic languages
• Probabilistic game automata
• Two-way finite automata with quantum and classical states.
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
• Quantum Finite Automata: A Modern Introduction
• The Knowledge Complexity of Interactive Proof Systems
• Alternation
• Finite state verifiers I
• Quantum Computability
• On the Power of Finite Automata with both Nondeterministic and Probabilistic States
• Quantum Alternation
• Probabilistic automata

This page was built for publication: Debates with Small Transparent Quantum Verifiers