Contextuality in multipartite pseudo-telepathy graph games

September 30, 2016 Β· Declared Dead Β· πŸ› International Symposium on Fundamentals of Computation Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Anurag Anshu, Peter Hoyer, Mehdi Mhalla, Simon Perdrix arXiv ID 1609.09689 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 9 Venue International Symposium on Fundamentals of Computation Theory Last Checked 5 months ago
Abstract
Analyzing pseudo-telepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structures that generate equivalent scenarios. We introduce a new tool called multipartiteness width to investigate which scenarios are harder to decompose and show that there exist graphs generating scenarios with a linear multipartiteness width.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted