Contextuality in multipartite pseudo-telepathy graph games

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 investigate which scenarios are more multipartite and show that there exist graphs generating scenarios with a linear multipartiteness width.

[1]  Philipp Zahn,et al.  Contextuality and the Weak Axiom in the Theory of Choice , 2015, QI.

[2]  Kiel T. Williams,et al.  Extreme quantum entanglement in a superposition of macroscopically distinct states. , 1990, Physical review letters.

[3]  T. Fritz,et al.  A Combinatorial Approach to Nonlocality and Contextuality , 2012, Communications in Mathematical Physics.

[4]  Mehdi Mhalla,et al.  Graph States, Pivot Minor, and Universality of (X, Z)-Measurements , 2012, Int. J. Unconv. Comput..

[5]  A. Shimony,et al.  Bell’s theorem without inequalities , 1990 .

[6]  E. Kashefi,et al.  Determinism in the one-way model , 2005, quant-ph/0506062.

[7]  Victor Veitch,et al.  Contextuality supplies the ‘magic’ for quantum computation , 2014, Nature.

[8]  Rui Soares Barbosa,et al.  Contextual Fraction as a Measure of Contextuality. , 2017, Physical review letters.

[9]  R. Spekkens,et al.  Preparation contextuality powers parity-oblivious multiplexing. , 2008, Physical review letters.

[10]  E. Kashefi,et al.  Generalized flow and determinism in measurement-based quantum computation , 2007, quant-ph/0702212.

[11]  R. Raussendorf.  Quantum computation, discreteness, and contextuality , 2009 .

[12]  Sylvain Gravier,et al.  Quantum Secret Sharing with Graph States , 2012, MEMICS.

[13]  Mehdi Mhalla,et al.  Resources Required for Preparing Graph States , 2006, ISAAC.

[14]  Samson Abramsky,et al.  The sheaf-theoretic structure of non-locality and contextuality , 2011, 1102.0264.

[15]  L. Hardy,et al.  Nonlocality for two particles without inequalities for almost all entangled states. , 1993, Physical review letters.

[16]  Gilles Brassard,et al.  Multi-party Pseudo-Telepathy , 2003, WADS.

[17]  Rui Soares Barbosa.  Quantifying contextuality via linear programming , 2016 .

[18]  John Langford,et al.  Resourceful Contextual Bandits , 2014, COLT.

[19]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[20]  William Slofstra,et al.  Tsirelson’s problem and an embedding theorem for groups arising from non-local games , 2016, Journal of the American Mathematical Society.

[21]  Mehdi Mhalla,et al.  On the Minimum Degree Up to Local Complementation: Bounds and Complexity , 2012, WG.

[22]  J. Eisert,et al.  Entanglement in Graph States and its Applications , 2006, quant-ph/0602096.

[23]  Nicolas Gisin,et al.  Family of Bell-like Inequalities as Device-Independent Witnesses for Entanglement Depth. , 2014, Physical review letters.

[24]  J. Bell.  On the Einstein-Podolsky-Rosen paradox , 1964 .

[25]  Damian Markham,et al.  Access Structure in Graphs in High Dimension and Application to Secret Sharing , 2013, TQC.

[26]  Simon Perdrix,et al.  Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms , 2015, ISAAC.

[27]  Nathan Pflueger,et al.  Graph reductions, binary rank, and pivots in gene assembly , 2011, Discret. Appl. Math..

[28]  Mehdi Mhalla,et al.  Pseudo-telepathy games and genuine ns k-way nonlocality using graph states , 2012, Quantum Inf. Comput..

[29]  Samson Abramsky,et al.  The Cohomology of Non-Locality and Contextuality , 2011, QPL.

[30]  D. Markham,et al.  Graph states for quantum secret sharing , 2008, 0808.1532.

[31]  Kohei Kishida,et al.  Minimum Quantum Resources for Strong Non-Locality , 2017, TQC.

[32]  Samson Abramsky,et al.  Logical Bell Inequalities , 2012, ArXiv.

[33]  A. Bouchet.  Connectivity of Isotropic Systems , 1989 .

[34]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[35]  Matthew McKague,et al.  Interactive Proofs for BQP via Self-Tested Graph States , 2013, Theory Comput..

[36]  Víctor H. Cervantes,et al.  Contextuality from Quantum Physics to Psychology , 2016 .

[37]  Rui Soares Barbosa,et al.  A complete characterization of all-versus-nothing arguments for stabilizer states , 2017, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[38]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[39]  B. Reichardt,et al.  Test to separate quantum theory from non-signaling theories , 2017, 1706.02008.

[40]  S. Pironio,et al.  Popescu-Rohrlich correlations as a unit of nonlocality. , 2005, Physical review letters.

[41]  Hans J. Briegel,et al.  Multipartite entanglement in spin chains , 2005, quant-ph/0502160.

[42]  Dan E Browne,et al.  Contextuality as a Resource for Models of Quantum Computation with Qubits. , 2016, Physical review letters.

[43]  Barry C. Sanders,et al.  Erratum: Graph states for quantum secret sharing [Phys. Rev. A 78, 042309 (2008)] , 2011 .

[44]  T. Fritz,et al.  Local orthogonality as a multipartite principle for quantum correlations , 2012, Nature Communications.

[45]  K Horodecki,et al.  Quantifying contextuality. , 2012, Physical review letters.

[46]  Bob Coecke,et al.  From Quantum Foundations via Natural Language Meaning to a Theory of Everything , 2016, The Incomputable.

[47]  Elham Kashefi,et al.  Extended Measurement Calculus , 2009 .

[48]  S. Severini,et al.  Linear game non-contextuality and Bell inequalities—a graph-theoretic approach , 2015, 1511.05415.

[49]  Mehdi Mhalla,et al.  Which Graph States are Useful for Quantum Information Processing? , 2010, TQC.

[50]  Simon Perdrix,et al.  Determinism and Computational Power of Real Measurement-Based Quantum Computation , 2016, FCT.

[51]  Anne Broadbent,et al.  On the power of non-local boxes , 2006, Theor. Comput. Sci..