Related papers: Comment on "Matrix Pencils and Entanglement Classi…
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho…
Employing the Pauli matrices, we have constructed a set of operators, which can be used to distinguish six inequivalent classes of entanglement under SLOCC (stochastic local operation and classical communication) for three-qubit pure…
Characterizing the transformation and classification of multipartite entangled states is a basic problem in quantum information. We study the problem under two most common environments, local operations and classical communications (LOCC),…
We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are equivalent under the full state feedback group. This result…
P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van…
For quantum systems with a total dimension greater than six, the positive partial transposition (PPT) criterion is sufficient but not necessary to decide the non-separability of quantum states. Here, we present an Automated Machine Learning…
We classify, up to local unitary equivalence, local unitary stabilizer Lie algebras for symmetric mixed states into six classes. These include the stabilizer types of the Werner states, the GHZ state and its generalizations, and Dicke…
A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center…
Incomparability of pure bipartite entangled states under deterministic LOCC is a very strange phenomena. We find two possible ways of getting our desired pure entangled state which is incomparable with the given input state, by collective…
It was recently suggested that a solution to the separability problem for states that remain positive under partial transpose composed with realignment (the so-called symmetric with positive coefficients states or simply SPC states) could…
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor variation on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
Our aim in this paper is two-fold: First, for computing zeros of a linear time-invariant (LTI) system $\Sigma$ in {\em state-space form}, we introduce a "trimmed structured linearization", which we refer to as {\em Rosenbrock…
This paper proposes a machine learning method to characterize photonic states via a simple optical circuit and data processing of photon number distributions, such as photonic patterns. The input states consist of two coherent states used…
Given a PPT state $A=\sum_{i=1}^nA_i\otimes B_i \in M_k\otimes M_k$ and a vector $v\in\Im(A)\subset\mathbb{C}^k\otimes\mathbb{C}^k$ with tensor rank $k$, we provide an algorithm that checks whether the positive map $G_A:M_k\rightarrow M_k$,…
In this paper, we study SLOCC determinant invariants of order 2^{n/2} for any even n qubits which satisfy the SLOCC determinant equations. The determinant invariants can be constructed by a simple method and the set of all these determinant…
The correspondence between local unitary equivalence of bipartite quantum states and simultaneous orthogonal equivalence is thoroughly investigated and strengthened. It is proved that local unitary equivalence can be studied through…
In $2 \otimes 2$, more than 2 orthogonal Bell states with single copy can never be discriminated with certainty if only local operations and classical communication (LOCC) are allowed. More than $d$ orthogonal maximally entangled states in…
In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…
We prove that, given two matrix pencils $L$ and $M$, if $M$ belongs to the closure of the orbit of $L$ under strict equivalence, then the dimension of the orbit of $M$ is smaller than or equal to the dimension of the orbit of $L$, and the…