Related papers: Fun with replicas: tripartitions in tensor network…

The inference of networks of dependencies by Gaussian Graphical models on high-throughput data is an open issue in modern molecular biology. In this paper we provide a comparative study of three methods to obtain small sample and high…

For an ordered subset $W = \{w_1, w_2,\dots w_k\}$ of vertices and a vertex $u$ in a connected graph $G$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $ r(u|W)=(d(v,w_1), d(v,w_2),\dots,$ $d(v,w_k))$, where…

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

In this paper, we analyze the question of replica symmetry in the bulk for multi-partite entanglement measures in the vacuum state of two dimensional holographic CFTs. We first define a class of multi-partite local unitary invariants,…

In the $\left(1:b\right)$ component game played on a graph $G$, two players, Maker and Breaker, alternately claim~$1$ and~$b$ previously unclaimed edges of $G$, respectively. Maker's aim is to maximise the size of a largest connected…

Biclustering is a problem in machine learning and data mining that seeks to group together rows and columns of a dataset according to certain criteria. In this work, we highlight the natural relation that quantum computing models like boson…

Motivated by properties of tensor networks, we conjecture that an arbitrary gravitating region $a$ can be assigned a generalized entanglement wedge $E\supset a$, such that quasi-local operators in $E$ have a holographic representation in…

We study the quantification of genuine multipartite entanglement (GME) for general multipartite states. A set of inequalities satisfied by the entanglement of $N$-partite pure states is derived by exploiting the restrictions on entanglement…

We give a detailed account of the methods introduced in [1] to calculate holographic four-point correlators in IIB supergravity on $AdS_5 \times S^5$. Our approach relies entirely on general consistency conditions and maximal supersymmetry.…

Here we investigate the connection between topological order and the geometric entanglement, as measured by the logarithm of the overlap between a given state and its closest product state of blocks. We do this for a variety of…

Given a quantum system on many qubits split into a few different parties, how many total correlations are there between these parties? Such a quantity, aimed to measure the deviation of the global quantum state from an uncorrelated state…

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

We compute the capacity of entanglement in the bipartite random pure state model using the replica method. We find the exact expression of the capacity of entanglement which is valid for a finite dimension of the Hilbert space. We argue…

Given $2\le k\le n$, the minimal $(n-1)$-dimensional Gaussian measure of the union of the boundaries of $k$ disjoint sets of equal Gaussian measure in $\R^n$ whose union is $\R^n$ is of order $\sqrt{\log k}$. A similar results holds also…

The separation dimension of a hypergraph $G$ is the smallest natural number $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that any pair of disjoint edges is separated by some hyperplane normal to one of the axes. The…

For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed…

For $S\subseteq V(G)$ and $|S|\geq 2$, $\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\leq k\leq n$, the \emph{generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is then…

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…

A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road networks, and image processing. We consider Balanced Connected…

The Groverian entanglement measure, G(psi), is applied to characterize a variety of pure quantum states |psi> of multiple qubits. The Groverian measure is calculated analytically for certain states of high symmetry, while for arbitrary…