Related papers: A gap for PPT entanglement
If $X\subset \mathbb{P}^n$ is a projective non degenerate variety, the $X$-rank of a point $P\in \mathbb{P}^n$ is defined to be the minimum integer $r$ such that $P$ belongs to the span of $r$ points of $X$. We describe the complete…
Very often, in the course of uncertainty quantification tasks or data analysis, one has to deal with high-dimensional random variables (RVs). A high-dimensional RV can be described by its probability density (pdf) and/or by the…
This work presents a machine learning approach based on support vector machines (SVMs) for quantum entanglement detection. Particularly, we focus in bipartite systems of dimensions 3x3, 4x4, and 5x5, where the positive partial transpose…
Let $H^{[ N]}=H^{[ d_{1}]}\otimes ... \otimes H^{[ d_{n}]}$ be a tensor product of Hilbert spaces and let $\tau_{0}$ be the closest separable state in the Hilbert-Schmidt norm to an entangled state $\rho_{0}$. Let $\tilde{\tau}_{0}$ denote…
Machine learning and data mining algorithms are becoming increasingly important in analyzing large volume, multi-relational and multi--modal datasets, which are often conveniently represented as multiway arrays or tensors. It is therefore…
In this paper, we provide a complete mathematical theory for the entanglement of mixtures of Dicke states. These quantum states form an important subclass of bosonic states arising in the study of indistinguishable particles. We introduce a…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…
Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on…
The subrank of tensors is a measure of how much a tensor can be ''diagonalized''. This parameter was introduced by Strassen to study fast matrix multiplication algorithms in algebraic complexity theory and is closely related to many central…
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections…
For positive integers $m$ and $s$, let $\mathbf{m}_s$ stand for the $s$-th tuple $(m,\ldots,m)$. We show that, for large enough $s$, the higher topological complexity $TC_s$ of an even dimensional real projective space $RP^m$ is…
Considering a spacetime foliated by co-dimension-2 hypersurfaces, we find the conditions under which lower-dimensional symmetries of a base space can be lifted up to irreducible Killing tensors of the full spacetime. In this construction,…
We provide a new class of indecomposable entanglement witnesses. In 4 x 4 case it reproduces the well know Breuer-Hall witness. We prove that these new witnesses are optimal and atomic, i.e. they are able to detect the "weakest" quantum…
We study symplectic manifolds $(M^{2l},\omega)$ equipped with a symplectic torsion-free affine (also called Fedosov) connection $\nabla$ and admitting a metaplectic structure. Let $\mathcal{S}$ be the so called symplectic spinor bundle and…
The space of the associative commutative hyper complex numbers, H_4, is a 4-dimensional metric Finsler space with the Berwald-Moor metric. It provides the possibility to construct the tensor fields on the base of the analytical functions of…
We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…
Given a graph $G$, the sparsest-cut problem asks to find the set of vertices $S$ which has the least expansion defined as $$\phi_G(S) := \frac{w(E(S,\bar{S}))}{\min \set{w(S), w(\bar{S})}}, $$ where $w$ is the total edge weight of a subset.…
Information is extracted from large and sparse data sets organized as 3-mode tensors. Two methods are described, based on best rank-(2,2,2) and rank-(2,2,1) approximation of the tensor. The first method can be considered as a generalization…
We analyze certain class of linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes separable…