Contextuality in multipartite pseudo-telepathy graph games

TL;DR

This paper explores the use of graph states to demonstrate quantum contextuality and supremacy, introducing a new measure called multipartiteness width to analyze the complexity of these scenarios.

Contribution

It presents a novel approach to constructing and analyzing pseudo-telepathy graph games using multipartiteness width, revealing graphs with highly complex scenarios.

Findings

Existence of graphs with linear multipartiteness width

New tool for analyzing scenario complexity

Framework for building quantum supremacy scenarios

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.