Related papers: Comment on "Matrix Pencils and Entanglement Classi…

Quantum states are represented by positive semidefinite Hermitian operators with unit trace, known as density matrices. An important subset of quantum states is that of separable states, the complement of which is the subset of…

We provide quantitative bounds on the characterisation of multiparticle separable states by states that have locally symmetric extensions. The bounds are derived from two-particle bounds and relate to recent studies on quantum versions of…

We propose the task of local state marking (LSM), where some multipartite quantum states chosen randomly from a known set of states are distributed among spatially separated parties without revealing the identities of the individual states.…

In this brief report, we consider the equivalence between two sets of $m+1$ bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree $m$…

We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…

We present in the work two intriguing results in the entanglement classification of pure and true tripartite entangled state of $2\times M\times N$ under stochastic local operation and classical communication. (i) the internal symmetric…

Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…

In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices $S_1$, $S_2$ is a matrix whose columns are the concatenation of each…

We prove that the vast majority of symmetric states of qubits can be decomposed in a unique way into a superposition of spin 1/2 coherent states. For the case of two qubits, the proposed decomposition reproduces the Schmidt decomposition…

We review two general criteria for deciding whether a pure bipartite quantum state describing a system of two identical particles is entangled or not. The first one considers the possibility of attributing a complete set of objective…

We have devised an artificial intelligence algorithm with machine reinforcement learning (Q-learning) to construct remarkable entangled states with 4 qubits. This way, the algorithm is able to generate representative states for some of the…

Absolutely Maximally Entangled (AME) states are maximally entangled for every bipartition of the system. They are crucial resources for various quantum information protocols. We present techniques for verifying either two AME states are…

In this paper, we introduce a new family of equations for matrix pencils that may be utilized for the construction of strong linearizations for any square or rectangluar matrix polynomial. We provide a comprehensive characterization of the…

We consider the Minkowskian norm of the n-photon Stokes tensor, a scalar invariant under the group realized by the transformations of stochastic local quantum operations and classical communications (SLOCC). This invariant is offered as a…

When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…

We present a fine-structure entanglement classification under stochastic local operation and classical communication (SLOCC) for multiqubit pure states. To this end, we employ specific algebraic-geometry tools that are SLOCC invariants,…

Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class. This has various applications…

We propose a range criterion which is a sufficient and necessary condition satisfied by two pure states transformable with each other under reversible stochastic local operations assisted with classical communication. We also provide a…

Consider the spaces of pseudodifferential operators between tensor density modules over the line as modules of the Lie algebra of vector fields on the line. We compute the equivalence classes of various subquotients of these modules. There…

The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…