Related papers: Graph-Theoretic Approach to Quantum Correlations
Why do correlations between the results of measurements performed on physical systems violate Bell and non-contextuality inequalities up to some specific limits? The answer may follow from the observation that in quantum theory, unlike in…
The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…
Quantum correlations can be naturally formulated in a classical statistical system of infinitely many degrees of freedom. This realizes the underlying non-commutative structure in a classical statistical setting. We argue that the quantum…
In this paper I demonstrate that the quantum correlations of polarization (or spin) observables used in Bell's argument against local realism have to be interpreted as {\it conditional} quantum correlations. By taking into account…
Bell correlations are among the most exotic phenomena through which quantum mechanics manifests itself. Their presence signals that the system can violate the postulates of local realism, once believed to be the nonnegotiable property of…
We introduce a generalization of the celebrated Lov\'asz theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial…
An essential feature of genuine quantum correlation is the simultaneous existence of correlation in complementary bases. We reveal this feature of quantum correlation by defining measures based on invariance under a basis change. For a…
Quantum mechanics is a nonlocal theory, but not as nonlocal as the no-signalling principle allows. However, there exist quantum correlations that exhibit maximal nonlocality: they are as nonlocal as any non-signalling correlations and thus…
A fruitful way of studying physical theories is via the question whether the possible physical states and different kinds of correlations in each theory can be shared to different parties. Over the past few years it has become clear that…
In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a…
We extend the clique-coclique inequality, previously known to hold for graphs in association schemes and vertex-transitive graphs, to graphs in homogeneous coherent configurations and 1-walk regular graphs. We further generalize it to a…
We show how the Bell correlations can be modelled locally by relaxing the joint probability relation for independent variables $P(a,b)=P(a)P(b)$ outside classical settings, with complex/quaternion generators for the measurement outcomes…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
In the study of quantum nonlocality, one obstacle is that the analytical criterion for identifying the boundaries between quantum and postquantum correlations has not yet been given, even in the simplest Bell scenario. We propose a…
Randomness is a ubiquitous phenomenon that is practically accompanied by physical events described by probability theory. However, probability by definition in the theory is a nonnegative scalar quantity. Here, we propose the concept of…
In a generic hybrid network, classical, quantum, and no-signaling sources emit local hidden variables, stabilizer states, and no-signaling systems, respectively. We investigate the maximal correlation strength as the non-classical feature…
The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…
We describe a new technique for obtaining Tsirelson bounds, or upper bounds on the quantum value of a Bell inequality. Since quantum correlations do not allow signaling, we obtain a Tsirelson bound by maximizing over all no-signaling…
We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…