Related papers: Rank-based SLOCC classification for odd n qubits
A non-local quantum computation (NLQC) replaces an interaction between two quantum systems with a single simultaneous round of communication and shared entanglement. We study two classes of NLQC, $f$-routing and $f$-BB84, which are of…
The multi-qubit GHZ state possesses tangles with elegant transformation properties under stochastic local operations and classical communication. Since almost all pure 3-qubit states are connected to the GHZ state via SLOCC, we derive a…
The coefficient matrix is an efficient tool in entanglement classification under stochastic local operation and classical communication. In this work, we take all the ranks of the coefficient matrices into account in the method of…
A necessary and sufficient condition of the possibility of a deterministic local operations and classical communication (LOCC) transformation of three-qubit pure states is given. The condition shows that the three-qubit pure states are a…
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…
We presented a general classification scheme for the tripartite $L\times N\times N$ entangled system under stochastic local operation and classical communication. The whole classification procedure consists of two correlated parts: the…
A set of necessary and sufficient conditions are derived for the equivalence of an arbitrary pure state and a graph state on n qubits under stochastic local operations and classical communication (SLOCC), using the stabilizer formalism.…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
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…
In order to cope with the fact that there exists no single maximally entangled state (up to local unitaries) in the multipartite setting, we introduced in [J. I. de Vicente, C. Spee and B. Kraus, Phys. Rev. Lett. 111, 110502 (2013)] the…
We show that the pure entangled three-qubit symmetric states which are inequivalent under stochastic local operations and classcial communication (SLOCC) exhibit distinct geometric representation in terms of a spheroid inscribed within the…
The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically…
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…
In this paper we classify the four-qubit states that commute with $U\otimes{U}\otimes{V}\otimes{V}$, where $U$ and $V$ are arbitrary members of the Pauli group. We characterize the set of separable states for this class, in terms of a…
It is a recent observation that entanglement classification for qubits is closely related to local $SL(2,\CC)$-invariants including the invariance under qubit permutations, which has been termed $SL^*$ invariance. In order to single out the…
Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by…
The stabilizer group of an n-qubit state \psi is the set of all matrices of the form g=g_1\otimes\cdots\otimes g_n, with g_1,...,g_n being any 2x2 invertible complex matrices, that satisfy g\psi=\psi. We show that for 5 or more qubits,…
Let S = <s_1, s_2, s_3, ..., s_n> be a given vector of n real numbers. The rank of a real z with respect to S is defined as the number of elements s_i in S such that s_i is less than or equal to z. We consider the following decision…
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…
We address the problem of entanglement protection against surrounding noise by a procedure suitably exploiting spatial indistinguishability of identical subsystems. To this purpose, we take two initially separated and entangled identical…