相关论文: The Exclusivity Principle Determines the Correlati…
Using very general arguments, we prove that any entanglement measures based on distance must be maximal on pure states. Furthermore, we show that Bures measure of entanglement and geometric measure of entanglement satisfy the monogamy…
We show that for all n-mode Gaussian states of continuous variable systems, the entanglement shared among n parties exhibits the fundamental monogamy property. The monogamy inequality is proven by introducing the Gaussian tangle, an…
We consider three modes $A$, $B$ and $C$ and derive continuous variable monogamy inequalities that constrain the distribution of bipartite entanglement amongst the three modes. The inequalities hold for all such tripartite states, without…
We prove a version of the result in the title that makes use of maximal coactions in the context of discrete groups. Earlier Gauge-Invariant Uniqueness theorems for $C^*$-algebras associated to $P$-graphs and similar $C^*$-algebras…
For a sequence of random graphs, the limit law we refer to is the existence of a limiting probability of any graph property that can be expressed in terms of predicate logic. A zero-one limit law is shown by Shelah and Spencer for…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
We prove new monogamy of entanglement bounds for two-local qudit Hamiltonians of rank-one projectors without one-local terms. In particular, we certify the maximum energy in terms of the maximum matching of the underlying interaction graph…
Let K be an abstract elementary class satisfying the joint embedding and the amalgamation properties. Let m be a cardinal above the the L\"owenheim-Skolem number of the class. Suppose K satisfies the disjoint amalgamation property for limit…
We consider a decision network on an undirected graph in which each node corresponds to a decision variable, and each node and edge of the graph is associated with a reward function whose value depends only on the variables of the…
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…
Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely, with minimal assumptions about the underlying quantum system. It is based on the observation that some extremal points in the…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
The enumeration of independent sets of regular graphs is of interest in statistical mechanics, as it corresponds to the solution of hard-particle models. In 2004, it was conjectured by Fendleyet al. that for some rectangular grids, with…
The entangled multipartite systems, specially in pure states, exhibit the phenomenon entanglement monogamy. Such systems also display the phenomenon of Bell nonlocality. Like entanglement monogamy relations, there are Bell monogamy…
This paper studies $k$-claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight independent set in this graph class. For the extremal…
We introduce the coverage correlation coefficient, a novel nonparametric measure of statistical association designed to quantifies the extent to which two random variables have a joint distribution concentrated on a singular subset with…
This dissertation will serve as an introduction to entanglement quantification, containing highly detailed proofs ensuring solid understanding of the subject. Specifically, we will review the properties of entanglement that should be…
A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…
A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…
In this note we prove an optimal volume growth condition for stochastic completeness of graphs under very mild assumptions. This is realized by proving a uniqueness class criterion for the heat equation which is an analogue to a…