Related papers: Multigraph approach to quantum non-locality
In multi-task learning (MTL) with each task involving graph-dependent data, existing generalization analyses yield a \emph{sub-optimal} risk bound of $O(\frac{1}{\sqrt{n}})$, where $n$ is the number of training samples of each task.…
We have determined the maximum quantum violation of 241 tight bipartite Bell inequalities with up to five two-outcome measurement settings per party by constructing the appropriate measurement operators in up to six-dimensional complex and…
Homogenization proposed in [Y.-C Wu and M. \.Zukowski, Phys. Rev. A 85, 022119 (2012)] is a procedure to transform a tight Bell inequality with partial correlations into a full-correlation form that is also tight. In this paper, we check…
We construct models of many-particle quantum graphs with singular two-particle contact interactions, which can be either hardcore- or delta-interactions. Self-adjoint realisations of the two-particle Laplacian including such interactions…
We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph $G$ is called the…
We develop a theoretical framework based on a graph theoretic approach to analyze monogamous relationships of entropic non-contextuality (ENC) inequalities. While ENC inequalities are important in quantum information theory and are well…
We perform an exhaustive semidefinite-programming search over all 11{,}117 connected non-isomorphic simple graphs on eight vertices to maximize the quantum contextuality gap $\Delta(G)=\vartheta(G)-\alpha(G)$, where $\vartheta(G)$ is the…
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion,…
In recent decades, a great variety of researches and applications concerning Bell nonlocality have been developed with the advent of quantum information science. Providing that Bell nonlocality can be revealed by the violation of a family…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
It is not generally known, that the inequality that Bell derived using three random variables must be identically satisfied by any three corresponding data sets of plus and minus 1s that are writable on paper.This surprising fact is not…
For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the…
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…
We propose an efficient $\epsilon$-differentially private algorithm, that given a simple {\em weighted} $n$-vertex, $m$-edge graph $G$ with a \emph{maximum unweighted} degree $\Delta(G) \leq n-1$, outputs a synthetic graph which…
The predictions of quantum theory are incompatible with local-causal explanations. This phenomenon is called Bell non-locality and is witnessed by violation of Bell-inequalities. The maximal violation of certain Bell-inequalities can only…
Local measurements acting on entangled quantum states give rise to a rich correlation structure in the multipartite scenario. We introduce a versatile technique to build families of Bell inequalities witnessing different notions of…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
A Bell inequality is a constraint on a set of correlations whose violation can be used to certify non-locality. They are instrumental for device-independent tasks such as key distribution or randomness expansion. In this work we consider…
Bell's theorem shows that correlations created by a single entangled quantum state cannot be reproduced classically. Such correlations are called Nonlocal. They are the elementary manifestation of a broader phenomenon called Network…