Related papers: Fun with replicas: tripartitions in tensor network…
Random tensor networks provide useful models that incorporate various important features of holographic duality. A tensor network is usually defined for a fixed graph geometry specified by the connection of tensors. In this paper, we…
We analyse orthogonal bases in a composite $N\times N$ Hilbert space describing a bipartite quantum system and look for a basis with optimal single-sided mutual state distinguishability. This condition implies that in each subsystem the…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…
To characterize entanglement of tripartite $\mathbb{C}^d\otimes\mathbb{C}^d\otimes\mathbb{C}^d$ systems, we employ algebraic-geometric tools that are invariants under Stochastic Local Operation and Classical Communication (SLOCC), namely…
Quantifying genuine entanglement is a crucial task in quantum information theory. Based on the geometric mean of bipartite $\alpha$-concurrences among all bipartitions, we present a class of well-defined genuine multipartite entanglement…
For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…
The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated…
This work establishes a direct operational connection between the entanglement structures of specific three-qubit states (i.e. multipartite entanglement) and their corresponding topological links. We investigate the symmetric $\wwbar$ state…
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this…
Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…
The geometric measure of entanglement (GME) quantifies how close a multi-partite quantum state is to the set of separable states under the Hilbert-Schmidt inner product. The GME can be non-multiplicative, meaning that the closest product…
In the holographic correspondence of quantum gravity, a global onsite symmetry at the boundary generally translates to a local gauge symmetry in the bulk. We describe one way how the global boundary onsite symmetries can be gauged within…
Although genuine multipartite entanglement (GME), as one quantum resource, is indispensable in quantum information processing, most of the existing measures cannot detect GME faithfully. In this paper, we present a novel GME measure, namely…
We study criteria for and properties of boundary-to-boundary holography in a class of spin network states defined by analogy to projected entangled pair states (PEPS). In particular, we consider superpositions of states corresponding to…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
We introduce a class of generalized geometric measures of entanglement. For pure quantum states of $N$ elementary subsystems, they are defined as the distances from the sets of $K$-separable states ($K=2,...,N$). The entire set of…
Let $G$ be a strongly connected directed graph. We consider the following three problems, where we wish to compute the smallest strongly connected spanning subgraph of $G$ that maintains respectively: the $2$-edge-connected blocks of $G$…
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…
Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\mathcal{A}(G)$ be the adjacency tensor of…
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…