Další formáty:
BibTeX
LaTeX
RIS
@article{800139,
author = {Fialík, Ivan},
article_location = {Singapur},
article_number = {6},
keywords = {Quantum pseudo-telepathy; classical and quantum winning strategies; the matching game; local realism},
language = {eng},
issn = {0129-0541},
journal = {International Journal of Foundations of Computer Science},
title = {Separation between Classical and Quantum Winning Strategies for the Matching Game},
url = {http://www.cs.ucsb.edu/~ijfcs/},
volume = {19},
year = {2008}
}
TY - JOUR
ID - 800139
AU - Fialík, Ivan
PY - 2008
TI - Separation between Classical and Quantum Winning Strategies for the Matching Game
JF - International Journal of Foundations of Computer Science
VL - 19
IS - 6
SP - 1449-1459
EP - 1449-1459
PB - World Scientific
SN - 01290541
KW - Quantum pseudo-telepathy
KW - classical and quantum winning strategies
KW - the matching game
KW - local realism
UR - http://www.cs.ucsb.edu/~ijfcs/
N2 - Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. The matching game is the newest member of the family of pseudo-telepathy games. After introducing a general model for pseudo-telepathy games, we focus on the question what the smallest size of inputs is for which the matching game is a pseudo-telepathy game.
ER -
FIALÍK, Ivan. Separation between Classical and Quantum Winning Strategies for the Matching Game. \textit{International Journal of Foundations of Computer Science}. Singapur: World Scientific, 2008, roč.~19, č.~6, s.~1449-1459. ISSN~0129-0541.
|
