相关论文: The Exclusivity Principle Determines the Correlati…
A particularly interesting feature of nonrelativistic quantum mechanics is the monogamy laws of entanglement. Although the monogamy relation has been explored extensively in the last decade, it is still not clear to what extent a given…
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…
We derive a monogamy inequality for any local quantum resource and entanglement. It results from the fact that there is always a convex measure for a quantum resource, as shown here, and from the relation between entanglement and local…
Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…
Quantum coherence plays an important role in quantum information protocols that provide an advantage over classical information processing. The amount of coherence that can exist between two orthogonal subspaces is limited by the positivity…
We show that the no-disturbance principle imposes a tradeoff between locally contextual correlations violating the Klyachko-Can-Binicioglu-Shumovski inequality and spatially separated correlations violating the Clauser-Horne-Shimony-Holt…
It is well known that any well-defined bipartite entanglement measure $\mathcal{E}$ obeys $\gamma$th-monogamy relations Eq. (1.1) and assisted measure $\mathcal{E}_{a}$ obeys $\delta$th-polygamy relations Eq. (1.2). Recently, we presented a…
The celebrated Bell-Kochen-Specker no-go theorem asserts that quantum mechanics does not present the property of realism, the essence of the theorem is the lack of a joint probability distributions for some experiment settings. In this…
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…
We explore a connection between monogamy of non-locality and a weak macroscopic locality condition: the locality of the average behaviour. These are revealed by our analysis as being two sides of the same coin. Moreover, we exhibit a…
We investigate the problem of detecting correlation between two Erd\H{o}s-R\'enyi graphs $G(n,p)$, formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are independent, while under the alternative…
We study the data-driven selection of causal graphical models using constraint-based algorithms, which determine the existence or non-existence of edges (causal connections) in a graph based on testing a series of conditional independence…
Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…
Monogamy and Polygamy are important properties of entanglement, which characterize the entanglement distribution of multipartite systems. We study general monogamy and polygamy relations based on the $\alpha$th $(0\leq\alpha\leq \gamma)$…
We introduce a new feature of no-signaling (Bell) non-local theories, namely, when a system of multiple parties manifests genuine non-local correlation, then there cannot be arbitrarily high non-local correlation among any subset of the…
Given a hypergraph $H$ and a weight function $w: V \rightarrow \{1, \dots, M\}$ on its vertices, we say that $w$ is isolating if there is exactly one edge of minimum weight $w(e) = \sum_{i \in e} w(i)$. The Isolation Lemma is a…
Monogamy is a non-classical property that restricts the sharability of quantum correlation among the constituents of a multipartite quantum system. Quantum correlations may satisfy or violate monogamy for quantum states. Here we provide…
We give a detailed and refined proof of the Dobrushin-Pechersky uniqueness criterion extended to the case of Gibbs fields on general graphs and single-spin spaces, which in particular need not be locally compact. The exponential decay of…
A connected r-regular graph, where $r \geq 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participates in some perfect matching. We set out to: (i) characterize…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…