Matrix Pencils and Entanglement Classification

In this paper, we study pure state entanglement in systems of dimension $2\otimes m\otimes n$. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. All previous attempts to study general SLOCC equivalence in such systems have relied on somewhat contrived techniques which fail to reveal the elegant structure of the problem that can be seen from the matrix pencil approach. Based on this method, we report the first polynomial-time algorithm for deciding when two $2\otimes m\otimes n$ states are SLOCC equivalent. Besides recovering the previously known 26 distinct SLOCC equivalence classes in $2\otimes 3\otimes n$ systems, we also determine the hierarchy between these classes

Multipartite quantum correlations: symplectic and algebraic geometry approach

We review a geometric approach to classification and examination of quantum correlations in composite systems. Since quantum information tasks are usually achieved by manipulating spin and alike systems or, in general, systems with a finite number of energy levels, classification problems are usually treated in frames of linear algebra. We proposed to shift the attention to a geometric description. Treating consistently quantum states as points of a projective space rather than as vectors in a Hilbert space we were able to apply powerful methods of differential, symplectic and algebraic geometry to attack the problem of equivalence of states with respect to the strength of correlations, or, in other words, to classify them from this point of view. Such classifications are interpreted as identification of states with `the same correlations properties' i.e. ones that can be used for the same information purposes, or, from yet another point of view, states that can be mutually transformed one to another by specific, experimentally accessible operations. It is clear that the latter characterization answers the fundamental question `what can be transformed into what \textit{via} available means?'. Exactly such an interpretations, i.e, in terms of mutual transformability can be clearly formulated in terms of actions of specific groups on the space of states and is the starting point for the proposed methods.Comment: 29 pages, 9 figures, 2 tables, final form submitted to the journa

Partial separability revisited: Necessary and sufficient criteria

We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial separability classes in the tripartite case contrary to a former 1+8+1. Then we give necessary and sufficient criteria for these classes, which make it possible to determine to which class a mixed state belongs. These criteria are given by convex roof extensions of functions defined on pure states. In the special case of three-qubit systems, we define a different set of such functions with the help of the Freudenthal triple system approach of three-qubit entanglement.Comment: v3: 22 pages, 5 tables, 1 figure, minor corrections (typos), clarification in the Introduction. Accepted in Phys. Rev. A. Comments are welcom

A Non-Commuting Stabilizer Formalism

We propose a non-commutative extension of the Pauli stabilizer formalism. The aim is to describe a class of many-body quantum states which is richer than the standard Pauli stabilizer states. In our framework, stabilizer operators are tensor products of single-qubit operators drawn from the group $\langle \alpha I, X,S\rangle$, where $\alpha=e^{i\pi/4}$ and $S=\operatorname{diag}(1,i)$. We provide techniques to efficiently compute various properties related to bipartite entanglement, expectation values of local observables, preparation by means of quantum circuits, parent Hamiltonians etc. We also highlight significant differences compared to the Pauli stabilizer formalism. In particular, we give examples of states in our formalism which cannot arise in the Pauli stabilizer formalism, such as topological models that support non-Abelian anyons.Comment: 52 page

How many invariant polynomials are needed to decide local unitary equivalence of qubit states?

Given L-qubit states with the fixed spectra of reduced one-qubit density matrices, we find a formula for the minimal number of invariant polynomials needed for solving local unitary (LU) equivalence problem, that is, problem of deciding if two states can be connected by local unitary operations. Interestingly, this number is not the same for every collection of the spectra. Some spectra require less polynomials to solve LU equivalence problem than others. The result is obtained using geometric methods, i.e. by calculating the dimensions of reduced spaces, stemming from the symplectic reduction procedure.Comment: 22 page

Finite-Function-Encoding Quantum States

We investigate the encoding of higher-dimensional logic into quantum states. To that end we introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions and investigate their structure as an algebra over the ring of integers modulo $d$. We point out that the polynomiality of the function is the deciding property for associating hypergraphs to states. Given a polynomial, we map it to a tensor-edge hypergraph, where each edge of the hypergraph is associated with a tensor. We observe how these states generalize the previously defined qudit hypergraph states, especially through the study of a group of finite-function-encoding Pauli stabilizers. Finally, we investigate the structure of FFE states under local unitary operations, with a focus on the bipartite scenario and its connections to the theory of complex Hadamard matrices.Comment: Comments welcom