Related papers: Graph-Theoretic Approach to Quantum Correlations
We consider the problem of representation of quantum states and observables in the framework of classical probability theory (Kolmogorov's measure-theoretic axiomatics, 1933). Our aim is to show that, in spite of the common opinion,…
We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast…
Bell's theorem is typically understood as the proof that quantum theory is incompatible with local-hidden-variable models. More generally, we can see the violation of a Bell inequality as witnessing the impossibility of explaining quantum…
The phenomenon of quantum entanglement is explained in a way which is fully consistent with Einstein's Special Theory of Relativity. A subtle flaw is identified in the logic supporting the view that Bell's Inequality precludes all local…
One of the main technical obstacles in constructing a consistent theory of quantum gravity is that the metric itself defines the causal structure required for quantization. This motivates implementing quantum aspects of gravity through an…
We show that there are Bell-type inequalities for noncontextual theories that are violated by any quantum state. One of these inequalities between the correlations of compatible measurements is particularly suitable for testing this…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
Recently, Chatterjee has introduced a new coefficient of correlation which has several natural properties. In particular, the coefficient attains its maximal value if and only if one variable is a measurable function of the other variable.…
As a consequence of Bell's theorem, the statistics of measurements on some entangled states cannot be simulated with local hidden variables alone. The amount of communication that must be supplied is an intuitive quantifier of…
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…
For systems of an arbitrary dimension, a theory of geometric chained Bell inequalities is presented. The approach is based on chained inequalities derived by Pykacz and Santos. For maximally entangled states the inequalities lead to a…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
A locally causal hidden-variable theory of quantum physics need not be constrained by the Bell inequalities if this theory also partially violates the measurement independence condition. However, such violation can appear unphysical,…
There are increasingly suggestions for computer simulations of quantum statistics which try to violate Bell type inequalities via classical, common cause correlations. The Clauser-Horne-Shimony-Holt (CHSH) inequality is very robust.…
Bell inequalities reveal the fundamentally nonlocal character of quantum mechanics. In this regard, one of the interesting problems is to explore all possible Bell inequalities that demonstrate a gap between local and nonlocal quantum…
We introduce and study a new combinatorial invariant the theta-number $\theta(X)$ of simplicial complexes, and prove that the inequality $\mathcal{C}(X)\leq \theta(X)$ holds for every simplicial complex $X$, where $\mathcal{C}(X)$ denotes…
A simple minimalist argument is given for why some correlations between quantum systems boggle our classical intuition. The argument relies on two elementary physical assumptions, and recovers the standard experimentally-testable Bell…
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A set $I_0(G) \subseteq V(G)$ is a vertex independent set if no two vertices in $I_0(G)$ are adjacent in $G$. We study $\alpha_1(G)$, which is the maximum cardinality of a set…