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 generating 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.
CITATION STYLE
Anshu, A., Høyer, P., Mhalla, M., & Perdrix, S. (2017). Contextuality in multipartite pseudo-telepathy graph games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10472 LNCS, pp. 41–55). Springer Verlag. https://doi.org/10.1007/978-3-662-55751-8_5
Mendeley helps you to discover research relevant for your work.