For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.
The talk presents finite geometries, named N-qubit doily doilies (N≥2) related to operator-based proofs of quantum contextuality. We first show closed formulas for the numbers of linear and quadratic doilies for N>2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N=4 and N=5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.
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.
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.
In the intriguing realm of quantum physics, the concept of contextuality raises interesting questions about the nature of quantum systems. Since the commutation relation in the N-qubits Pauli group corresponds to the colinearity relation in the symplectic polar space W(2N − 1, 2), we study subgeometries of this space in order to discover new contextual quantum configurations. We have developed algorithms and a corresponding software in C language, that can effectively determine quantum contextuality and quantify it, by charting these symplectic polar spaces of various ranks. This tool allowed us to uncover new insights that go beyond the achievements of earlier work, such as that of de Boutray et al (J. Phys. A: Math. Theor. 55 475301, 2022). Our study spans across these geometric structures of ranks from two to seven, offering significant findings.In my talk I will explicitly illustrate the concept of quantum contextuality on certain wellknown finite-geometric configurations living in W(5,2), like the doily (and its two-spread), an elliptic quadric (and its spread of lines) and a hyperbolic quadric (and its associated Heawoodgraph); I will also consider configurations whose contexts are all the subspaces with a given dimension k < N.
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.
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.