Debates with small transparent quantum verifiers

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of de...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Yakaryilmaz, Abuzer, Say, A. C. Cem, Demirci, H. Gökalp
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Formal Languages and Automata Theory Physics - Quantum Physics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!