Related papers: Computing Entanglement Polytopes
We propose a new geometric method for measuring the quality of representations obtained from deep learning. Our approach, called Random Polytope Descriptor, provides an efficient description of data points based on the construction of…
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…
We compute the entanglement entropy for some quantum field theories on de Sitter space. We consider a superhorizon size spherical surface that divides the spatial slice into two regions, with the field theory in the standard vacuum state.…
The polytope containment problem is deciding whether a polytope is a contained within another polytope. This problem is rooted in computational convexity, and arises in applications such as verification and control of dynamical systems. The…
In this paper, we find the invariant for $n$-qubits and propose the residual entanglement for $n$-qubits by means of the invariant. Thus, we establish a relation between SLOCC entanglement and the residual entanglement. The invariant and…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
We propose an inductive procedure to classify N-partite entanglement under stochastic local operations and classical communication (SLOCC) provided such a classification is known for N-1 qubits. The method is based upon the analysis of the…
In open quantum systems, we directly relate anomalies of higher-form symmetries to the long-range entanglement of any mixed state with such symmetries. First, we define equivalence classes of long-range entanglement in mixed states via…
The entanglement properties of a class of topological stabilizer states, the so called \emph{topological color codes} defined on a two-dimensional lattice or \emph{2-colex}, are calculated. The topological entropy is used to measure the…
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
We define a polynomial measure of multiparticle entanglement which is scalable, i.e., which applies to any number of spin-1/2 particles. By evaluating it for three particle states, for eigenstates of the one dimensional Heisenberg…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
We propose a technique to investigate multipartite entanglement in the symmetric subspace. Our approach is to map an $N$-qubit symmetric state onto a bipartite symmetric state of higher local dimension. We show that this mapping preserves…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
The entanglement among scattering particles in an exemplary quantum electrodynamics (QED) process is studied perturbatively. To increase the computational accuracy, we need to consider virtual photon loop diagrams, which lead to infrared…
Multipartite entanglement is an indispensable resource in quantum communication and computation, however, it is a challenging task to faithfully quantify this global property of multipartite quantum systems. In this work, we study the…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
We provide an in-depth study of tripartite entanglement of qudits. We start with a short review of tripartite entanglement invariants, prove a theorem about the complete list of all allowed values of three (out of the total of four) such…