Quantum 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 proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the contextuality property as the absence of solutions to a linear system. Then we explain why subgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We report 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 proofs. The intermediate size property of those proofs is interesting for experimental tests, but could also be interesting in quantum game theory.
Quantum 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 proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the contextuality property as the absence of solutions to a linear system. Then we explain why subgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We report 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 proofs. The intermediate size property of those proofs is interesting for experimental tests, but could also be interesting in quantum game theory.
Quantum 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 proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we first formulate the contextuality property as the absence of solutions to a linear system. Then we explain why subgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We report 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 proofs. This intermediate size property of those proofs is interesting for experimental tests, but could also be interesting in quantum game theory.
Abstract Quantum 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 proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we formulate the contextuality property as the absence of solutions to a linear system and define for a contextual configuration its degree of contextuality. Then we explain why subgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We report the results of a software that generates these subgeometries, decides their contextuality and computes their contextuality degree for some small symplectic polar spaces. We show that quadrics in the symplectic polar space W n are contextual for n = 3 , 4 , 5 . The proofs we consider involve more contexts and observables than the smallest known proofs. This intermediate size property of those proofs is interesting for experimental tests, but could also be interesting in quantum game theory.
Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context ε=2d/∣H∣, where d is the contextuality degree and ∣H∣ the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph G the single hypergram carrying its entire hypergraph support HS(G), so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching ε=0.707, against 0.424 for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.
Contextuality is a key distinguishing feature between classical and quantum physics. It expresses a fundamental obstruction to describing quantum theory using classical concepts. In turn, understood as a resource for quantum computation, it is expected to hold the key to quantum advantage. Yet, despite its long recognised importance in quantum foundations and, more recently, in quantum computation, the structural essence of contextuality has remained somewhat elusive - different frameworks address different aspects of the phenomenon, yet their precise relationship often remains unclear. This issue already looms large at the level of the Bell-Kochen-Specker theorem: while traditional proofs proceed by showing the nonexistence of valuations, the notion of state-independent contextuality in the marginal approach allows to prove contextuality from seemingly weaker assumptions. In the light of this, and at the absence of a unified mathematical framework for Kochen-Specker contextuality, the original algebraic approach has been widely abandoned, in favour of the study of contextual correlations. Here, we reinstate the algebraic perspective on contextuality. Concretely, by building on the novel concept of context connections, we reformulate the algebraic relations between observables originally postulated by Kochen and Specker, and we explicitly demonstrate their consistency with the notion of state-independent contextuality. In the present paper, we focus on the new conceptual ideas and discuss them in the concrete setting of spin-1 observables, specifically those in the example of [S. Yu and C.H. Oh, Phys. Rev. Lett., 108, 030402 (2012)]; in a companion paper, we generalise these ideas, obtain a complete characterisation of Kochen-Specker contextuality and provide a detailed comparison with the related notions of contextuality in the marginal and graph-theoretic approach.
Quantum contextuality, as proved by Kochen and Specker, and also by Bell, should manifest itself in any state in any system with more than two distinguishable states and recently has been experimentally verified. However, for the simplest system capable of exhibiting contextuality, a qutrit, the quantum contextuality is verified only state dependently in experiment because too many (at least 31) observables are involved in all the known state-independent tests. Here we report an experimentally testable inequality involving only 13 observables that is satisfied by all noncontextual realistic models while being violated by all qutrit states. Thus our inequality facilitates a state-independent test of the quantum contextuality for an indivisible quantum system. We also provide a record-breaking state-independent proof of the Kochen-Specker theorem with 13 directions determined by 26 points on the surface of a magic cube.
Abstract We present algorithms and a C code to reveal quantum contextuality and evaluate the contextuality degree (a way to quantify contextuality) for a variety of point-line geometries located in binary symplectic polar spaces of small rank. With this code we were not only able to recover, in a more efficient way, all the results of a recent paper by de Boutray et al. [(2022). Journal of Physics A: Mathematical and Theoretical55 475301], but also arrived at a bunch of new noteworthy results. The paper first describes the algorithms and the C code. Then it illustrates its power on a number of subspaces of symplectic polar spaces whose rank ranges from 2 to 7. The most interesting new results include: (i) non-contextuality of configurations whose contexts are subspaces of dimension 2 and higher, (ii) non-existence of negative subspaces of dimension 3 and higher, (iii) considerably improved bounds for the contextuality degree of both elliptic and hyperbolic quadrics for rank 4, as well as for a particular subgeometry of the three-qubit space whose contexts are the lines of this space, (iv) proof for the non-contextuality of perpsets and, last but not least, (v) contextual nature of a distinguished subgeometry of a multi-qubit doily, called a two-spread, and computation of its contextuality degree. Finally, in the three-qubit polar space we correct and improve the contextuality degree of the full configuration and also describe finite geometric configurations formed by unsatisfiable/invalid constraints for both types of quadrics as well as for the geometry whose contexts are all 315 lines of the space.