6533b7ddfe1ef96bd127447f

RESEARCH PRODUCT

Automated detection of contextuality proofs with intermediate numbers of observables

subject

description

<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtQuantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality&nbsp;</span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtproofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the</span&gt</div&gt<div style=""&gt<font face="arial, helvetica"&gt<span style="font-size: 13px;"&gtcontextuality property as the absence of solutions to a linear system. Then we explain why&nbsp;</span&gt</font&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtsubgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtreport first results of a software that generates these subgeometries and decides their contextuality. The proofs we consider involve more contexts and observables than the smallest known&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtproofs. The intermediate size property of those proofs is interesting for experimental tests, but&nbsp;</span&gt<span style="font-size: 13px; font-family: arial, helvetica;"&gtcould also be interesting in quantum game theory.</span&gt</div&gt