Exploring the graph approach, we restate the extended definition of noncontextuality provided by the contextuality-by-default framework. This extended definition avoids the assumption of nondisturbance, which states that whenever two contexts overlap, the marginal distribution obtained for the intersection must be the same. We show how standard tools for characterizing contextuality can also be used in this extended framework for any set of measurements and, in addition, we also provide several conditions that can be tested directly in any contextuality experiment. Our conditions reduce to traditional ones for noncontextuality if the nondisturbance assumption is satisfied.
The connection between contextuality and graph theory has led to many developments in the field. In particular, the sets of probability distributions in many contextuality scenarios can be described using well known convex sets from graph theory, leading to a beautiful geometric characterization of such sets. This geometry can also be explored in the definition of contextuality quantifiers based on geometric distances, which is important for the resource theory of contextuality, developed after the recognition of contextuality as a potential resource for quantum computation. In this paper we r…
Cabello-Severini-Winter and Abramsky-Hardy (building on the framework of Abramsky-Brandenburger) both provide classes of Bell and contextuality inequalities for very general experimental scenarios using vastly different mathematical techniques. We review both approaches, carefully detail the links between them, and give simple, graph-theoretic methods for finding inequality-free proofs of nonlocality and contextuality and for finding states exhibiting strong nonlocality and/or contextuality. Finally, we apply these methods to concrete examples in stabilizer quantum mechanics relevant to unders…
We report a method that exploits a connection between quantum contextuality and graph theory to reveal any form of quantum contextuality in high-precision experiments. We use this technique to identify a graph which corresponds to an extreme form of quantum contextuality unnoticed before and test it using high-dimensional quantum states encoded in the linear transverse momentum of single photons. Our results open the door to the experimental exploration of quantum contextuality in all its forms, including those needed for quantum computation.
The contextuality problem connected with existence of joint probability distribution creating all the given marginals is studied. It is shown for several examples considered previously in literature that there exist some new solutions for the joint probability distributions providing the given marginals and numerical example of the new solution is demonstrated.
We show that the main idea behind contextuality-by-default (CbD), i.e., the assumption that a physical measurement has to be understood as a contextual collection of random variables, is implicit in the compatibility-hypergraph approach to contextuality (CA) and use this result to develop in the latter important concepts which were introduced in the former. We introduce in CA the non-degeneracy condition, which is the analogous of consistent connectedness, and prove that this condition is, in general, weaker than non-disturbance condition. The set of non-degenerate behaviours defines a polytop…
This paper introduces an extension of the de Broglie-Bohm-Bell formulation of quantum mechanics, which includes intrinsic particle degrees of freedom, such as spin, as elements of reality. To evade constraints from the Kochen-Specker theorem the discrete spin values refer to a specific basis -- i.e., a single spin vector orientation for each particle; these spin orientations are, however, not predetermined, but dynamic and guided by the (reduced, spin-only) wave function of the system, which is conditional on the realized location values of the particles. In this way, the unavoidable contextua…
We show that the perfect commutation graph is the sufficient tight condition for admitting the noncontextual description of each observable set satisfying it in the yes-no question scenario. With this condition, we propose a method for proving the monogamy relation between two informationtheoretic contextuality inequalities by decomposing the total commutation graph into perfect subgraphs. The results offer a powerful tool to investigate the contextuality and to understand quantum information theory. This theoretical work can be experimentally verified in current laboratorial technology.
In this work we present a generalization of the recently developed Hardy-like logical proof of contextuality and of the so-called KCBS contextuality inequality for any qudit of dimension greater than three. Our approach uses compatibility graphs that can only be satisfied by qudits. We find a construction for states and measurements that satisfy these graphs and demonstrate both logical and inequality based contextuality for qudits. Interestingly, the quantum violation of the inequality is constant as dimension increases. We also discuss the issue of imprecision in experimental implementations…
Measurement incompatibility is the most basic resource that distinguishes quantum from classical physics. Contextuality is the critical resource behind the power of some models of quantum computation and is also a necessary ingredient for many applications in quantum information. A fundamental problem is thus identifying when incompatibility produces contextuality. Here, we show that, given a structure of incompatibility characterized by a graph in which nonadjacent vertices represent incompatible ideal measurements, the necessary and sufficient condition for the existence of a quantum realiza…
We solve the problem of whether a set of quantum tests reveals state-independent contextuality and use this result to identify the simplest set of the minimal dimension. We also show that identifying state-independent contextuality graphs [R. Ramanathan and P. Horodecki, Phys. Rev. Lett. 112, 040404 (2014)] is not sufficient for revealing state-independent contextuality.
The Quad-$C_5$ Graph: Maximum Contextuality Gap on Eight Vertices
Koç University（科奇大学）；University of Istanbul（伊斯坦布尔大学）；Sabancı University（萨班奇大学）；TÜBİTAK Research Institute for Fundamental Sciences (TBAE)（土耳其科学技术研究基金会基础科学研究所（TBAE））
Analyzing pseudo-telepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structures that generate equivalent scenarios. We introduce a new tool called multipartiteness width to investigate which scenarios are harder to decompose and show that there exist graphs generating scenarios with a linear multipartiteness width.
We explore the graph approach to contextuality to restate the extended definition of noncontextuality as given by J. Kujala et. al. [Phys. Rev. Lett. 115, 150401 (2015)] using graph-theoretical terms. This extended definition avoids the assumption of the pre-sheaf or non-disturbance condition, which states that if two contexts overlap, then the marginal distribution obtained for the intersection must be the same, a restriction that will never be perfectly satisfied in real experiments. With this we are able to derive necessary conditions for extended noncontextuality for any set of random vari…
The problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension $d$ and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes of contextual behavior, and that (ii) state-independent contextuality is equivalent to the contextuality of the maximally mixed state up to a global unitary transformat…
So far, most of the literature on (quantum) contextuality and the Kochen-Specker theorem seems either to concern particular examples of contextuality, or be considered as quantum logic. Here, we develop a general formalism for contextuality scenarios based on the combinatorics of hypergraphs which significantly refines a similar recent approach by Cabello, Severini and Winter (CSW). In contrast to CSW, we explicitly include the normalization of probabilities, which gives us a much finer control over the various sets of probabilistic models like classical, quantum and generalized probabilistic.…
Recently, Yu and Oh [Phys. Rev. Lett. 108, 030402 (2012)] have conjectured that the simplest set of vectors needed to prove state-independent contextuality on a qutrit requires 13 vectors. Here we first prove that a necessary and sufficient condition for a set of vectors in any dimension $d \ge 3$ to prove contextuality for a system prepared in a maximally mixed state is that the graph $G_C$ in which vertices represent vectors and edges link orthogonal ones has chromatic number $χ(G_G)$ larger than $d$. Then, we prove Yu and Oh's conjecture. Finally, we prove that any set satisfying $χ(G_G)>d$…
Dzhafarov, Zhang, and Kujala (Phil. Trans. Roy. Soc. A 374, 20150099) reviewed several behavioral data sets imitating the formal design of the quantum-mechanical contextuality experiments. The conclusion was that none of these data sets exhibited contextuality if understood in the generalized sense proposed in Dzhafarov, Kujala, and Larsson (Found. Phys. 7, 762-782, 2015), while the traditional definition of contextuality does not apply to these data because they violate the condition of consistent connectedness (also known as marginal selectivity, no-signaling condition, no-disturbance princi…
We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation …
We show that the noncontextual inequality proposed by Klyachko et al. [Phys. Rev. Lett. 101, 020403 (2008)] belongs to a broader family of inequalities, one associated to each compatibility structure of a set of events (a graph), and its independence number. These have the surprising property that the maximum quantum violation is given by the Lovasz theta-function of the graph, which was originally proposed as an upper bound on its Shannon capacity. Furthermore, probabilistic theories beyond quantum mechanics may have an even larger violation, which is given by the so-called fractional packing…
Characterising unknown quantum states and measurements is a fundamental problem in quantum information processing. In this Letter, we provide a novel scheme to self-test local quantum systems using non-contextuality inequalities. Our work leverages the graph-theoretic framework for contextuality introduced by Cabello, Severini, and Winter, combined with tools from mathematical optimisation that guarantee the unicity of optimal solutions. As an application, we show that the celebrated Klyachko-Can-Biniciogglu-Shumovsky inequality and its generalisation to contextuality scenarios with odd n-cycl…
Cyclic systems of dichotomous random variables have played a prominent role in contextuality research, describing such experimental paradigms as the Klyachko-Can-Binicoglu-Shumovky, Einstein-Podolsky-Rosen-Bell, and Leggett-Garg ones in physics, as well as conjoint binary choices in human decision making. Here, we understand contextuality within the framework of the Contextuality-by-Default (CbD) theory, based on the notion of probabilistic couplings satisfying certain constraints. CbD allows us to drop the commonly made assumption that systems of random variables are consistently connected. C…
Kochen-Specker (KS) theorem reveals the inconsistency between quantum theory and any putative underlying model of it satisfying the constraint of KS-noncontextuality. A logical proof of the KS theorem is one that relies only on the compatibility relations amongst a set of projectors (a KS set) to witness this inconsistency. These compatibility relations can be represented by a hypergraph, referred to as a contextuality scenario. Here we consider contextuality scenarios that we term KS-uncolourable, e.g., those which appear in logical proofs of the KS theorem. We introduce a hypergraph framewor…
In this paper we demonstrate that the property of monogamy of Bell violations seen for no-signaling correlations in composite systems can be generalized to the monogamy of contextuality in single systems obeying the Gleason property of no-disturbance. We show how one can construct monogamies for contextual inequalities by using the graph-theoretic technique of vertex decomposition of a graph representing a set of measurements into subgraphs of suitable independence numbers that themselves admit a joint probability distribution. After establishing that all the subgraphs that are chordal graphs …
We address the problem of deriving the set of quantum correlations for every Bell and Kochen-Specker (KS) contextuality scenario from simple assumptions. We show that the correlations that are possible according to quantum theory are equal to those possible under the assumptions that there is a nonempty set of correlations for every KS scenario and a statistically independent realization of any two KS experiments. The proof uses tools of the graph-theoretic approach to correlations and deals with Bell nonlocality and KS contextuality in a unified way.
The notion of (non)contextuality pertains to sets of properties measured one subset (context) at a time. We extend this notion to include so-called inconsistently connected systems, in which the measurements of a given property in different contexts may have different distributions, due to contextual biases in experimental design or physical interactions (signaling): a system of measurements has a maximally noncontextual description if they can be imposed a joint distribution on in which the measurements of any one property in different contexts are equal to each other with the maximal probabi…
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial number of quantum provers, each of which, in the honest case, performs only a single measurement. Our techniques use self-tested graph states which allow us to test the provers for honesty, establishing that they hold onto a particular graph state and measure it in specified bases. In this extended abstract we give an overview of the construction and proofs.
!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have previously been limited by an inability to express families of diagrams involving non-commutative structures which play a central role in algebraic quantum information and the theory of quantum groups. In this paper, we fix this shortcoming by offering a new semantics for non-commutative !-graphs using an enriched version of Penrose's abstract tensor notation.
