The exact memory cost for simulating the contextuality of Mermin's pentagram is log2(5) bits, and the cost for all 15 two-qubit Pauli observables is at least log2(6) bits.
An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This article delves into the concept of quantum contextuality, specifically focusing on proofs of the Kochen-Specker theorem obtained by assigning Pauli observables to hypergraph vertices satisfying a given commutation relation. The abstract structure composed of this hypergraph and the graph of anticommutations is named a hypergram. Its labelings with Pauli observables generalize the well-known magic sets. A first result is that all these correct quantum labelings of a given hypergram inherently possess the same degree of contextuality. Then we provide a necessary and sufficient condition for the existence of such quantum labelings and an efficient algorithm to find one of them. We finally attach to each assignable hypergram an abstract notion of contextuality degree. By presenting the study of observable-based Kochen-Specker proofs from the perspectives of graphs and matrices, this abstraction opens the way to new methods to search for original contextual configurations.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Memory cost of quantum contextuality with Pauli observables
The exact memory cost for simulating the contextuality of Mermin's pentagram is log2(5) bits, and the cost for all 15 two-qubit Pauli observables is at least log2(6) bits.