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...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 67; no. 2; pp. 383 - 412
Main Authors:	Ghosh, Soumik, Watrous, John
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2023
Subjects:	Computer Science Theory of Computation Game theory Quantum computing Complexity theory
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!