Related papers: Computing Entanglement Polytopes
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
Based on the idea of measuring the factorizability of a given density matrix, we propose a pairwise analysis strategy for quantifying and understanding multipartite entanglement. The methodology proves very effective as it immediately…
Entanglement polytopes result in finitely many types of entanglement that can be detected by only measuring single-particle spectra. With high probability, however, the local spectra lie in more than one polytope, hence providing no…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
We show that the quantification of entanglement of any rank-2 state with any polynomial entanglement measure can be recast as a geometric problem on the corresponding Bloch sphere. This approach provides novel insight into the properties of…
Within the framework of constructions for quantifying entanglement, we build a natural scenario for the assembly of multipartite entanglement measures based on Hopf bundle-like mappings obtained through Clifford algebra representations.…
In this paper we present the novel qualities of entanglement of formation for general (so also infinite dimensional) quantum systems. A major benefit of our presentation is a rigorous description of entanglement of formation. In particular,…
This article proposes an efficient way of calculating the geometric measure of entanglement using tensor decomposition methods. The connection between these two concepts is explored using the tensor representation of the wavefunction.…
Covariance matrices are a useful tool to investigate correlations and entanglement in quantum systems. They are widely used in continuous variable systems, but recently also for finite dimensional systems powerful entanglement criteria in…
Wedge product of post-measurement vectors leading to an `area' measure of the parallelogram has been shown to give the generalized I-concurrence measure of entanglement. Extending the wedge product formalism to multi qudit systems, we have…
We introduce a novel geometric approach to characterize entanglement relations in large quantum systems. Our approach is inspired by Schumacher's singlet state triangle inequality, which used an entropic-based distance to capture the…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
In this work, multipartite entanglement is classified by polynomials. I show that the operator size is closely related to the entanglement structure. Given a generic quantum state, I define a series of subspaces generated by operators of…
Characterization and quantification of multipartite entanglement is one of the challenges in state-of-the-art experiments in quantum information processing. According to theory, this is achieved via entanglement monotones, that is,…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
We present an analytical approach to evaluate the geometric measure of multiparticle entanglement for mixed quantum states. Our method allows the computation of this measure for a family of multiparticle states with a certain symmetry and…
Quantum states that are symmetric with respect to permutations of their subsystems appear in a wide range of physical settings, and they have a variety of promising applications in quantum information science. In this thesis the…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
We introduce a characterization of topological order based on bulk oscillations of the entanglement entropy and the definition of an `entanglement gap', showing that it is generally applicable to pure and disordered quantum systems. Using…
Analyzing the properties of entanglement in many-particle spin-1/2 systems is generally difficult because the system's Hilbert space grows exponentially with the number of constituent particles, $N$. Fortunately, it is still possible to…