Related papers: Computing Entanglement Polytopes
Entanglement is a central resource in quantum information and quantum technologies, yet its characterization remains challenging due to both theoretical complexity and measurement requirements. Machine learning has emerged as a promising…
In this paper, we initiate a systematic study of entanglements of division fields from a group theoretic perspective. For a positive integer $n$ and a subgroup $G\subseteq \text{GL}_2(\mathbb{Z}/{n}\mathbb{Z})$ with surjective determinant,…
We study the entanglement entropy between the two outgoing particles in an elastic scattering process. It is formulated within an S-matrix formalism using the partial wave expansion of two-body states, which plays a significant role in our…
We introduce algebriac sets in the products of complex projective spaces for multipartite mixed states, which are independent of their eigenvalues and only measure the "position" of their eigenvectors, as their non-local invariants (ie.…
Entanglement entropy appears as a central property of quantum systems in broad areas of physics. However, its precise value is often sensitive to unknown microphysics, rendering it incalculable. By considering parametric dependence on…
We investigate entanglement properties of a recently introduced class of macroscopic quantum superpositions in two-mode mixed states. One of the tools we use in order to infer the entanglement in this non-Gaussian class of states is the…
We compute the holographic entanglement entropy for the anomaly polynomial $\mathrm{Tr} R^2$ in 3+1 dimensions. Using the perturbative method developed for computing entanglement entropy for quantum field theories, we also compute the…
We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor…
We introduce and study a class of entanglement criteria based on the idea of applying local contractions to an input multipartite state, and then computing the projective tensor norm of the output. More precisely, we apply to a mixed…
We analyze the problem of high-order polynomial approximation from a many-body physics perspective, and demonstrate the descriptive power of entanglement entropy in capturing model capacity and task complexity. Instantiated with a…
We derive a set of algebraic equations, the so-called multipartite separability eigenvalue equations. Based on their solutions, we introduce a universal method for the construction of multipartite entanglement witnesses. We witness…
In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…
Thermodynamics as a fundamental branch of physics examines the relationships between heat, work, and energy. The maximum energy extraction can be characterized by using the passive states that has no extracted energy under any cyclic…
Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case…
Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several…
The problem of finding elliptical shapes in an image will be considered. We discuss the solution which uses cross-entropy clustering. The proposed method allows the search for ellipses with predefined sizes and position in the space.…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case,…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…