Related papers: Computing Entanglement Polytopes
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
The geometric entanglement per lattice site, as a holistic measure of the multipartite entanglement, serves as a universal marker to detect quantum phase transitions in quantum many-body systems. However, it is very difficult to compute the…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of…
We propose a general method for introducing extensive characteristics of quantum entanglement. The method relies on polynomials of nilpotent raising operators that create entangled states acting on a reference vacuum state. By introducing…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
In this paper, we systematically study the measures of multi-partite entanglement with the aim of constructing those measures that can be computed in probe approximation in the holographic dual. We classify and count general measures as…
Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of…
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…
The aim of this thesis is to investigate quantum entanglement and quantum nonlocality of bipartite finite-dimensional systems (bipartite qudits). Entanglement is one of the most fascinating non-classical features of quantum theory, and…
The work that we present in this thesis tries to be at the crossover of quantum information science, quantum many-body physics, and quantum field theory. We use tools from these three fields to analyze problems that arise in the…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description - few…
We show that a single polynomial entanglement measure is enough to verify equivalence between generic $n$-qubit states under Stochastic Local Operations with Classical Communication (SLOCC). SLOCC operations may be represented geometrically…
We explore the method of entanglement entropy applied to 2d black holes. We introduce a solvable model of a real scalar field with finite volume and lattice spacing in terms of $N$ coupled mechanical oscillators and compute its entanglement…