arXiv:2501.09637 · Entropy

Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions

Mladen Pavičić

Published Jan 9, 2025• 1 citation

Abstract

Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. The key tools for this are the Kochen-Specker and non-Kochen-Specker contextual sets. Traditionally, their representation has been predominantly operator-based, mainly focusing on specific constructs in dimensions ranging from three to eight. However, nearly all of these constructs can be represented as low-dimensional hypergraphs. This study demonstrates how to generate contextual hypergraphs in any dimension using various methods, particularly those that do not scale in complexity with increasing dimensions. Furthermore, we introduce innovative examples of hypergraphs extending to dimension 32. Our methodology reveals the intricate structural properties of hypergraphs, enabling precise quantifications of contextuality. Additionally, we investigate several promising applications of hypergraphs in quantum communication and quantum computation, paving the way for future breakthroughs in the field.

DOI: 10.3390/e27010054

Related papers

Non-Kochen–Specker Contextuality

Mladen Pavičić

Quantum contextuality supports quantum computation and communication. One of its main vehicles is hypergraphs. The most elaborated are the Kochen-Specker ones, but there is also another class of contextual sets that are not of this kind. Their representation has been mostly operator-based and limited to special constructs in three- to six-dim spaces, a notable example of which is the Yu-Oh set. Previously, we showed that hypergraphs underlie all of them, and in this paper, we give general methods-whose complexity does not scale up with the dimension-for generating such non-Kochen-Specker hypergraphs in any dimension and give examples in up to 16-dim spaces. Our automated generation is probabilistic and random, but the statistics of accumulated data enable one to filter out sets with the required size and structure.

arXiv:2307.16339EntropyJul 26, 20233 citations

Hypergraph Contextuality

Mladen Pavičić

Quantum contextuality is a source of quantum computational power and a theoretical delimiter between classical and quantum structures. It has been substantiated by numerous experiments and prompted generation of state independent contextual sets, that is, sets of quantum observables capable of revealing quantum contextuality for any quantum state of a given dimension. There are two major classes of state-independent contextual sets—the Kochen-Specker ones and the operator-based ones. In this paper, we present a third, hypergraph-based class of contextual sets. Hypergraph inequalities serve as a measure of contextuality. We limit ourselves to qutrits and obtain thousands of 3-dim contextual sets. The simplest of them involves only 5 quantum observables, thus enabling a straightforward implementation. They also enable establishing new entropic contextualities.

arXiv:1911.06448EntropyNov 12, 20198 citations

Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets

Mladen Pavičić

Quantum contextuality turns out to be a necessary resource for universal quantum computation and important in the field of quantum information processing. It is therefore of interest both for theoretical considerations and for experimental implementation to find new types and instances of contextual sets and develop methods of their optimal generation. We present an arbitrarily exhaustive hypergraph-based generation of the most explored contextual sets [Kochen-Specker (KS) ones] in 4, 6, 8, 16, and 32 dimensions. We consider and analyze 12 KS classes and obtain numerous properties of theirs, which we then compare with the results previously obtained in the literature. We generate several thousand additional types and instances of KS sets, including all KS sets in three of the classes and the upper part of a fourth set. We make use of the McKay-Megill-Pavi\ifmmode \check{c}\else \v{c}\fi{}i\ifmmode \acute{c}\else \'{c}\fi{} (MMP) hypergraph language, algorithms, and programs to generate KS sets strictly following their definition from the Kochen-Specker theorem. This approach proves to be particularly advantageous over the parity-proof-based ones (which prevail in the literature) since it turns out that only a very few KS sets have a parity proof (in six KS classes 0.01% and in one of them 0%). MMP hypergraph formalism enables a translation of an exponentially complex task of solving systems of nonlinear equations, describing KS vector orthogonalities, into a statistically linearly complex task of evaluating vertex states of hypergraph edges, thus exponentially speeding up the generation of KS sets and enabling us to generate billions of novel instances of them. The MMP hypergraph notation also enables us to graphically represent KS sets and to visually discern their features.

arXiv:1709.05430Physical Review AJun 26, 201714 citations

Quantumness via Discrete Structures

Ravi Kunjwal

Quantum theory departs from classical probabilistic theories in foundational ways. These departures--termed quantumness here--power quantum information and computation. This thesis charts the role of discrete structures in assessing quantumness, synthesizing elements of my postdoctoral research through this lens. After an introduction to the necessary background concepts, I present my work under three broad categories. First, I present work on contextuality that extensively relies on (undirected) graphs and hypergraphs as the discrete structures of interest; more specifically, it relies on invariants associated with them. This work includes Kochen-Specker (KS) contextuality and its operationalization to generalized contextuality, expressed via (hyper)graph-theoretic frameworks. I also present work on KS-contextuality in multiqubit systems and an application of generalized contextuality to a one-shot communication task, both of which rely on hypergraphs. Second, I present work on causality, where the discrete structures of interest are directed graphs. This includes work on indefinite causal order, specifically its connections to the gap between local operations and classical communication (LOCC) and separable operations (SEP), and a device-independent notion of nonclassicality--termed antinomicity--that generalizes Bell nonlocality without global causal assumptions. Finally, I present work on the incompatibility of quantum measurements, its connection to Bell nonlocality, and its role in discriminating between quantum and almost quantum correlations in the single-system setting. The discrete structures of interest here are hypergraphs that model joint measurability relations between quantum measurements. I conclude with a summary and an overview of work that is not covered in this thesis.

quant-pharXiv:2512.10063Dec 12, 20250 citations

Vector generation of contextual sets

Mladen Pavičić, Norman D. Megill

As quantum contextuality proves to be a necessary resource for universal quantum computation, we present a general method for vector generation of Kochen-Specker (KS) contextual sets in the form of hypergraphs. The method supersedes all three previous methods: (i) fortuitous discoveries of smallest KS sets, (ii) exhaustive upward hypergraph-generation of sets, and (iii) random downward generation of sets from fortuitously obtained big master sets. In contrast to previous works, we can generate master sets which contain all possible KS sets starting with nothing but a few simple vector components. From them we can readily generate all KS sets obtained in the last half a century and any specified new KS sets. Herewith we can generate sufficiently large sets as well as sets with definite required features and structures to enable varieties of different implementations in quantum computation and communication.

arXiv:1905.01784EPJ Web of ConferencesJan 1, 20193 citations

Quantum Contextuality

Mladen Pavičić

Quantum contextual sets have been recognized as resources for universal quantum computation, quantum steering and quantum communication. Therefore, we focus on engineering the sets that support those resources and on determining their structures and properties. Such engineering and subsequent implementation rely on discrimination between statistics of measurement data of quantum states and those of their classical counterparts. The discriminators considered are inequalities defined for hypergraphs whose structure and generation are determined by their basic properties. The generation is inherently random but with the predetermined quantum probabilities of obtainable data. Two kinds of statistics of the data are defined for the hypergraphs and six kinds of inequalities. One kind of statistics, often applied in the literature, turn out to be inappropriate and two kinds of inequalities turn out not to be noncontextuality inequalities. Results are obtained by making use of universal automated algorithms which generate hypergraphs with both odd and even numbers of hyperedges in any odd and even dimensional space – in this paper, from the smallest contextual set with just three hyperedges and three vertices to arbitrarily many contextual sets in up to 8-dimensional spaces. Higher dimensions are computationally demanding although feasible.

arXiv:2108.00967QuantumMar 17, 202333 citations