Related papers: A Gap Between the Hypergraph and Stabilizer Entrop…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
We continue our study of entanglement entropy in the holographic superconducting phase transitions. In this paper we consider the holographic p-wave superconductor/insulator model, where as the back reaction increases, the transition is…
We interpret holographic entropy inequalities in terms of erasure correction. The non-saturation of an inequality is a necessary condition for certain schemes of holographic erasure correction, manifested in the bulk as non-empty overlaps…
An entanglement Renyi entropy for a spatial partition of a system is studied in conformal theories which admit a dual description in terms of an anti-de Sitter gravity. The divergent part of the Renyi entropy is computed in 4D conformal N=4…
We study a number of (3+1)- and (2+1)-dimensional defect and boundary conformal field theories holographically dual to supergravity theories. In all cases the defects or boundaries are planar, and the defects are codimension-one. Using…
Topological excitations or defects such as solitons are ubiquitous throughout physics, supporting numerous interesting phenomena like zero energy modes with exotic statistics and fractionalized charges. In this paper, we study such objects…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
We study pseudo entropy for a particular linear combination of entangled states in qubit systems, two-dimensional free conformal field theories (CFT), and two-dimensional holographic CFT. We observe phenomena that the pseudo entropy can be…
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…
We investigate entropy minimization problems for quantum states subject to convex block-separable constraints. Our principal result is a quantitative stability theorem: under a natural confining (fixed-support) hypothesis, if a state has…
In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…
We present the generalized state-dependent entropic uncertainty relations in multiple measurements setting, and the optimal lower bound is obtained by considering different measurement sequences. We then apply this uncertainty relation to…
Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…
A hypergraph is \textit{bipartite with bipartition $(A, B)$} if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number…
In this work, we develop a systematic formalism to evaluate the upper bound of a large family of holographic entanglement entropy combinations when fixing $n$ subsystems and fine-tuning one other subsystem. The upper bound configurations…
Lieb and Solovej proved that, for the symmetric $SU(N)$ representations, the corresponding Wehrl-type entropy is minimized by symmetric coherent states. However, the uniqueness of the minimizers remained an open problem when $N\geq 3$. In…
In this note we show that the holographic entanglement entropy inequalities that hold for constant time slices are also valid for large regions and times in covariant spacetimes containing collapsing black branes, where the leading part of…
The entanglement entropy is a fundamental quantity which characterizes the correlations between sub-systems in a larger quantum-mechanical system. For two sub-systems separated by a surface the entanglement entropy is proportional to the…
In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…
Given a graph $F$, a hypergraph is called a Berge-$F$ if it can be obtained by expanding each edge of $F$ into a hyperedge containing it. Let $M_{k}$ denote the matching of size $k$. Kang, Ni, and Shan [12] determined the Tur\'an number of…