Rank-one quantum games (Q2353189): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59474322, #quickstatements; #temporary_batch_1712111774907 |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1112.3563 / rank | |||
Normal rank |
Revision as of 04:43, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rank-one quantum games |
scientific article |
Statements
Rank-one quantum games (English)
0 references
8 July 2015
0 references
The study of two-players one round games is a central topic in both theoretical computer science and quantum information theory (QIT). In theoretical computer science, they play a key role in analyzing the complexity of approximating some combinatorial optimization problems. As for quantum information theory, two-player one-round games are a natural setting in which to understand Bell inequalities. Quantum games are those in which the communication between the referee and players (the questions and answers) is transmitted using quantum states. A subclass of quantum games called rank-one quantum games. In this paper, the authors deal with one rank-one quantum games in which the projective measurements of the referee is defined by a rank-one projection. The authors introduce some examples of rank-one quantum games that have some interesting properties. They introduce also an approach to study those games via operator spaces. Operator space theory can be understood as a non-commutative version of Banach space theory and has been shown to be a natural mathematical tool in quantum information theory. There is a section devoted to the basic definitions and results from this theory (Section 2). The paper is well organized; in Section 1 we find summary of results, in Section 2 one finds operator spaces and in Section 3 we find the connections of rank-one quantum games to operator spaces. In Section 4 we find three different models of the entangled value of the game. The authors in Section 5 give computing and approximating the different values of rank-one games. In Section 6 the authors study the behavior of the different values of a rank-one quantum game with respect to the perfect parallel repetition theorem. Two families of games from operator space theory are given in Section 7.
0 references
quantum games
0 references
quantum informations
0 references
parallel repetition
0 references
operator spaces
0 references
models for rank one game
0 references
combinatorial optimization
0 references
efficient approximation
0 references