Complexity Limitations on One-turn Quantum Refereed Games

This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two states to determine which of the player wins. The complexity...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 67; číslo 2; s. 383 - 412
Hlavní autori:	Ghosh, Soumik, Watrous, John
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2023
Predmet:	Computer Science Theory of Computation Game theory Quantum computing Complexity theory
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!