Contextuality in multipartite pseudo-telepathy graph games
arXiv:1609.09689 · doi:10.1016/j.jcss.2019.06.005
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.
References in corpus (8)
- Multipartite entanglement in spin chains
- Preparation contextuality powers parity-oblivious multiplexing
- The contextual fraction as a measure of contextuality
- Contextuality as a resource for models of quantum computation on qubits
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Logical Bell Inequalities
- Linear game non-contextuality and Bell inequalities - a graph-theoretic approach
- From quantum foundations via natural language meaning to a theory of everything