Related papers: Comment on "Matrix Pencils and Entanglement Classi…
We investigate the correspondence between the time and space recognition complexity of languages. For this purpose, we will code the long-continued computations of deterministic two-tape Turing machines by the relatively short-length…
The purpose of the present work is solving the characterization problem for one class of second order operator pencil with complex periodic coefficients, which consists of identification of necessary and sufficient conditions on the…
We study the entanglement classification under stochastic local operations and classical communication (SLOCC) for odd n-qubit pure states. For this purpose, we introduce the rank with respect to qubit i for an odd n-qubit state. The ranks…
We classify the completely-positive maps acting on two $d$-dimensional systems which commute with all $U\otimes U$ unitaries, where $U\in SU(d)$. This set of operations map Werner states to Werner states. We find a simple condition for a…
Covering arrays for words of length $t$ over a $d$ letter alphabet are $k \times n$ arrays with entries from the alphabet so that for each choice of $t$ columns, each of the $d^t$ $t$-letter words appears at least once among the rows of the…
Quantum sequential machines (QSMs) are a quantum version of stochastic sequential machines (SSMs). Recently, we showed that two QSMs M_1 and M_2 with n_1 and n_2 states, respectively, are equivalent iff they are (n_1+n_2)^2--equivalent…
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case,…
Entangling photons is a critical challenge for photonic quantum information processing: entanglement is a crucial resource for quantum communication and computation but can only be performed in a probabilistic manner when using linear…
We propose a new approach to the geometry of the four-qubit entanglement classes depending on parameters. More precisely, we use invariant theory and algebraic geometry to describe various stratifications of the Hilbert space by SLOCC…
The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…
We show that there exist sets of three mutually orthogonal $d$-dimensional maximally entangled states which cannot be perfectly distinguished using one-way local operations and classical communication (LOCC) for arbitrarily large values of…
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement…
We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…
Entanglement is widely considered the cornerstone of quantum information and an essential resource for relevant quantum effects, such as quantum teleportation, quantum cryptography, or the speed-up of quantum computing, as in Shor's…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
We present a complete characterization for the local distinguishability of orthogonal $2\otimes 3$ pure states except for some special cases of three states. Interestingly, we find there is a large class of four or three states that are…
L. Lamata et al. have presented an entanglement classification of four qubits under stochastic local operation and classical communication (SLOCC) based on inductive approach [Phys. Rev. A \textbf{75}, 022318 (2007)]. While it works well…
We show there are at least 28 distinct true SLOCC entanglement classes for four-qubits by means of SLOCC invariant and semi-invariants and derive the number of the degenerated SLOCC classes for n-qubits.
The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we…
We generalize the notion of S-equivalence, previously defined for semistable vector bundles, to points in arbitrary algebraic stacks and use it to describe the identification of points when passing to the moduli space. As applications, we…