Related papers: A Gap Between the Hypergraph and Stabilizer Entrop…
Entanglement of the two scattered particles is expected to occur in elastic collisions, even at high energy where they are in competition with inelastic ones. We study how to evaluate quantitatively the corresponding entanglement entropy…
The entanglement entropy of various geometries is calculated for the boundary theory dual to a stack of N Dp-branes. The entanglement entropies are readily expressed in terms of the effective coupling at the appropriate energy scales. The…
Copositivity of tensors plays an important role in vacuum stability of a general scalar potential, polynomial optimization, tensor complementarity problem and tensor generalized eigenvalue complementarity problem. In this paper, we propose…
We demonstrate that absolutely maximally entangled (AME) states consisting of $N=4n$ qudits with $n\in\{1,2,3,...\}$, each of even local dimension, cannot be realized as graph states. This result imposes strong constraints on AME states in…
We single out a class of states possessing only threetangle but distributed all over four qubits. This is a three-site analogue of states from the $W$-class, which only possess globally distributed pairwise entanglement as measured by the…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…
We introduce a simple geometrical construction similar to covariant holographic entanglement entropy but with the addition of a new term proportional to boundary region volume. This new procedure has properties strongly resembling classical…
Entanglement entropy plays a variety of roles in quantum field theory, including the connections between quantum states and gravitation through the holographic principle. This article provides a review of entanglement entropy from a mixed…
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…
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…
We evaluate reflected entropy in certain anisotropic boundary theories dual to nonrelativistic geometries using holography. It is proposed that this quantity is proportional to the minimal area of the entanglement wedge cross section. Using…
We investigate entanglement in two-qubit systems using a geometric representation based on the minimum of essential parameters. The latter is achieved by requiring subsystems with the same entropy, regardless of whether the state of the…
We propose a new kind of invariant of multi-party stabilizer states with respect to local Clifford equivalence. These homological invariants are discrete entities defined in terms of the entanglement a state enjoys with respect to arbitrary…
We consider two measures of entanglement, the logarithmic negativity and the entanglement entropy, between regions of space in excited states of many-body systems formed by a finite number of particle excitations. In parts I and II of the…
We study entanglement entropy of unusual $\mathbb{Z}_N$ topological stabilizer codes which admit fractional excitations with restricted mobility constraint in a manner akin to fracton topological phases. It is widely known that the…
We study the entanglement entropy as a probe of the proximity effect of a superconducting system by using the gauge/gravity duality in a fully back-reacted gravity system. While the entanglement entropy in the superconducting phase is less…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
Systems of four nonbinary particles, each having three or more internal states, exhibit maximally entangled states that are inaccessible to four qubits. This breaks the pattern of two- and three-particle systems, in which the existing graph…
One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…