Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userClassification of general n-qubit states under stochastic local operations and classical communication in terms of the rank of coefficient matrix
119
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |l,n> with l=1, ..., [n/2] are inequivalent under SLOCC.
rate research
Read More
Recently, several schemes for the experimental creation of Dicke states were described. In this paper, we show that all the $n$-qubit symmetric Dicke states with $l$ ($2leq lleq (n-2)$) excitations are inequivalent to the $% |GHZ>$ state or the $|W>$ state under SLOCC, that the even $n$% -qubit symmetric Dicke state with $n/2$ excitations is inequivalent to any even $n$-qubit symmetric Dicke state with $l eq n/2$ excitations under SLOCC, and that all the $n$-qubit symmetric Dicke states with $l$ ($2leq lleq (n-2)$) excitations satisfy Coffman, Kundu and Wootters generalized monogamy inequality $C_{12}^{2}+...+C_{1n}^{2}<C_{1(2...n)}^{2}<1$.
In a recent paper [Phys. Rev. A 76, 032304(2007)], Li et al. proposed the definition of the residual entanglement for n qubits by means of the Stochastic local operations and classical communication. Here we argue that their definition is not suitable for the case of odd-n qubits.
We construct $ell $-spin-flipping matrices from the coefficient matrices of pure states of $n$ qubits and show that the $ell $-spin-flipping matrices are congruent and unitary congruent whenever two pure states of $n$ qubits are SLOCC and LU equivalent, respectively. The congruence implies the invariance of ranks of the $ell $-spin-flipping matrices under SLOCC and then permits a reduction of SLOCC classification of n qubits to calculation of ranks of the $ell $-spin-flipping matrices. The unitary congruence implies the invariance of singular values of the $ell $-spin-flipping matrices under LU and then permits a reduction of LU classification of n qubits to calculation of singular values of the $ell $-spin-flipping matrices. Furthermore, we show that the invariance of singular values of the $ell $-spin-flipping matrices $Omega _{1}^{(n)}$ implies the invariance of the concurrence for even $n$ qubits and the invariance of the n-tangle for odd $n$ qubits. Thus, the concurrence and the n-tangle can be used for LU classification and computing the concurrence and the n-tangle only performs additions and multiplications of coefficients of states.
We describe a general approach to proving the impossibility of implementing a quantum channel by local operations and classical communication (LOCC), even with an infinite number of rounds, and find that this can often be demonstrated by solving a set of linear equations. The method also allows one to design an LOCC protocol to implement the channel whenever such a protocol exists in any finite number of rounds. Perhaps surprisingly, the computational expense for analyzing LOCC channels is not much greater than that for LOCC measurements. We apply the method to several examples, two of which provide numerical evidence that the set of quantum channels that are not LOCC is not closed and that there exist channels that can be implemented by LOCC either in one round or in three rounds that are on the boundary of the set of all LOCC channels. Although every LOCC protocol must implement a separable quantum channel, it is a very difficult task to determine whether or not a given channel is separable. Fortunately, prior knowledge that the channel is separable is not required for application of our method.
We have reviewed the comment in [3], posted on arXiv.org concerning our recent work in [1]. We reply to the comment in this paper.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
