Related papers: Fun with replicas: tripartitions in tensor network…
We prove three new lower bounds for graph connectivity in the $1$-bit broadcast congested clique model, BCC$(1)$. First, in the KT-$0$ version of BCC$(1)$, in which nodes are aware of neighbors only through port numbers, we show an…
In this work we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for…
There is some tension between two well-known ideas in holography. On the one hand, subregion duality asserts that the reduced density matrix associated with a limited region of the boundary theory is dual to a correspondingly limited region…
Negativity is a measure of entanglement that can be used both in pure and mixed states. The negativity spectrum is the spectrum of eigenvalues of the partially transposed density matrix, and characterizes the degree and "phase" of…
We approach multipartite entanglement classification in the symmetric subspace in terms of algebraic geometry, its natural language. We show that the class of symmetric separable states has the structure of a Veronese variety and that its…
The Small-World phenomenon, popularly known as six degrees of separation, has been mathematically formalized by Watts and Strogatz in a study of the topological properties of a network. Small-worlds networks are defined in terms of two…
We study the harmonic measure (i.e. the limit of the hitting distribution of a simple random walk starting from a distant point) on three canonical two-dimensional lattices: the square lattice $\mathbb{Z}^2$, the triangular lattice…
For a subgraph $G$ of the blow-up of a graph $F$, we let $\delta^*(G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspond to edges of $F$. In [Triangle-factors in a balanced…
We define genuine total, classical and quantum correlations in tripartite systems. The measure we propose is based on the idea that genuine tripartite correlation exists if and only if the correlation between any bipartition does not…
Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree…
Symmetry is usually defined via transformations described by a (higher) group. But a symmetry really corresponds to an algebra of local symmetric operators, which directly constrains the properties of the system. In this paper, we point out…
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical…
A catalog of a class of (3,g) graphs for even girth g is introduced in this paper. A (k,g) graph is a regular graph with degree k and girth g. This catalog of (3,g) graphs for even girth g satisfying 6 <= g <= 16, has the following…
For a connected $n$-vertex graph $G$ and a set $\mathcal{F}$ of graphs, let $\iota(G,\mathcal{F})$ denote the size of a smallest set $D$ of vertices of $G$ such that the graph obtained from $G$ by deleting the closed neighbourhood of $D$…
Various reconstructions of finite-dimensional quantum mechanics result in a formally real Jordan algebra A and a last step remains to conclude that A is the self-adjoint part of a C*-algebra. Using a quantum logical setting, it is shown…
A set of vertices of a graph $G$ such that each vertex of $G$ is either in the set or is adjacent to a vertex in the set is called a dominating set of $G$. If additionally, the set of vertices induces a connected subgraph of $G$ then the…
We introduce a purely geometric formulation for two different measures addressed to quantify the entanglement between different parts of a tripartite qubit system. Our approach considers the entanglement-polytope defined by the smallest…
A new method is developed to derive an algebraic equations for the geometric measure of entanglement of three qubit pure states. The equations are derived explicitly and solved in cases of most interest. These equations allow oneself to…
Entanglement cohomology assigns a graded cohomology ring to a multipartite pure state, providing homological invariants that are stable under local unitaries and characterize inequivalent patterns of entanglement. In this work we derive…
We introduce a new approach to evaluating entangled quantum networks using information geometry. Quantum computing is powerful because of the enhanced correlations from quantum entanglement. For example, larger entangled networks can…