2015/04/01 by Piotr Frąckiewicz, Piotr Fra̧ckiewicz
Computer Science · Physics and Astronomy · #Combinatorial game theory #Game theory #Projector #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum pseudo-telepathy #Quantum state #Scheme (mathematics) #State (computer science) #cs.GT
paper · pdf · doi:10.1007/s11128-015-0979-z
published as Quantum Information Processing 14, 1809 (2015)
openalex publication_date 2015/04/01 · openalex created_date 2016/06/24 · arxiv created 2017/01/24 · arxiv updated 2017/01/26 · openalex updated_date 2026/08/05
We give a strict mathematical description for a refinement of the Marinatto–Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game induced by the scheme generalizes finite strategic-form game. In particular, it covers normal representations of extensive games, i.e., strategic games generated by extensive ones. We illustrate our idea with an example of extensive game and prove that rational choices in the classical game and its quantum counterpart may lead to significantly different outcomes.