Quick Navigation
Topics
Quantum Machine Learning
An explicit classical strategy for winning a CHSHq game
arXiv
Authors: Matej Pivoluska, Martin Plesch
Year
2015
Paper ID
26501
Status
Preprint
Abstract Read
~2 min
Abstract Words
92
Citations
N/A
Abstract
A CHSHq game is a generalization of the standard two player CHSH game, having q different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a CHSHq game, with q being a prime. Our construction achieves a winning probability better than frac{1}{22}q^{-frac{2}{3}}, which is in contrast with the previously known constructive strategies achieving only the winning probability of O\(q-1\).
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2015 reference point for readers tracking recent quantum research.
- A CHSHq game is a generalization of the standard two player CHSH game, having q different input and output options.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.