SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
From MaRDI portal
Publication:3606560
DOI10.1142/S0129054108006388zbMATH Open1186.81027arXiv1007.2952OpenAlexW1989009779MaRDI QIDQ3606560FDOQ3606560
Authors: Ivan Fialík 
Publication date: 26 February 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1007.2952
Recommendations
- An explicit classical strategy for winning a \(\text{CHSH}_q\) game
- scientific article; zbMATH DE number 7559121
- Quantum Games and Quantum Strategies
- Quantum-over-classical advantage in solving multiplayer games
- Quantum and Classical Game Strategies
- The relationship between quantum and classical correlation in games
- scientific article; zbMATH DE number 1530001
- QUANTUM AND CLASSICAL CORRELATIONS BETWEEN PLAYERS IN GAME THEORY
- Quantum games and quaternionic strategies
Applications of game theory (91A80) 2-person games (91A05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
Cited In (5)
This page was built for publication: SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606560)
