Quantum
Quantum Coloring Games on Complete Graphs
Publication: quant-ph updates on arXiv.org
Author: William Bolduc, Michael Jennings
Source published: 17/11/2026, 05:00:00 UTC
Briefing created: 17/11/2026, 08:45:08 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 17/11/2026, 08:28:25 UTC.
Briefings
A research paper published on arXiv in 2026 analyzes quantum coloring games on complete graphs where players receive inputs from a set of size n and must output results from a smaller set m. The study solves the game for both classical and quantum strategies, determining optimal winning probabilities and providing explicit strategies. Key findings include that quantum strategies outperform classical ones when m does not divide n, with an advantage of O(m/n^2). The research provides explicit strategies that remain optimal when the probability of receiving equal inputs is at least 2/(m+2).
Key points
- The study solves a nonlocal game on complete graphs where players receive inputs from a set of size n and must output results from a smaller set m, determining optimal winning probabilities for both classical and quantum strategies.
- Quantum strategies outperform classical strategies when m does not divide n, with an advantage of O(m/n^2) across a wide range of cases.
Context
This research addresses a specific variant of the nonlocal game where players must produce outputs from a smaller set than their inputs, effectively modeling a graph coloring game on a complete graph. The findings clarify the conditions under which quantum advantage emerges and provide explicit strategies for optimal performance.
Limitations
The evidence is limited to a single arXiv preprint from November 2026, with no additional sources or experimental data provided. The study covers theoretical cases but does not include experimental results or real-world applications.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 17/11/2026, 08:45:08 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeicosqqcse5uoj4rmgwek7eyrdetqx6fwec7qsnlq4uwez7vmvsuze