Related papers: Note on the decomposition of states
We prove for any pure three-quantum-bit state the existence of local bases which allow to build a set of five orthogonal product states in terms of which the state can be written in a unique form. This leads to a canonical form which…
In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…
In this paper we study the index of reducibility of powers of a standard parameter ideal. An explicit formula is proved for the extremely case. We apply the main result to compute Hilbert polynomials of socle ideals of standard parameter…
With any state of a multipartite quantum system its separability polytope is associated. This is an algebro-topological object (non-trivial only for mixed states) which captures the localisation of entanglement of the state. Particular…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
We prove that every symmetric separable state admits a convex decomposition into symmetric pure product states. While the result is not new in itself, here we focus on convex geometry. We discuss the decomposition in the context of…
We study geometrical aspects of entanglement, with the Hilbert--Schmidt norm defining the metric on the set of density matrices. We focus first on the simplest case of two two-level systems and show that a ``relativistic'' formulation leads…
We study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…
We propose a new 2D shape decomposition method based on the short-cut rule. The short-cut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible…
We investigate conditions on a finite set of multi-partite product vectors for which separable states with corresponding product states have unique decomposition, and show that this is true in most cases if the number of product vectors is…
Inspired by decomposition problems in rule-based formalisms in Computational Systems Biology and recent work on compositionality in graph transformation, this paper proposes to use arbitrary colimits to "deconstruct" models of reactions in…
In the paper, we show that when a quantum state can be decomposed as a convex combination of locally orthogonal mixed states, its entanglement can be decomposed into the entanglement of these mixed states without losing them. The obtained…
Let $X\subseteq G\slash B$ be a Schubert variety in a flag manifold and let $\pi: \tilde X \rightarrow X$ be a Bott-Samelson resolution of $X$. In this paper we prove an effective version of the decomposition theorem for the derived…
Explicitly separable density matrices are constructed for all separable two-qubits states based on Hilbert-Schmidt (HS) decompositions. For density matrices which include only two-qubits correlations the number of HS parameters is reduced…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
We develop a new general method for computing the decomposition type of the normal bundle to a projective rational curve. This method is then used to detect and explain an example of a Hilbert scheme that parametrizes all the rational…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…