Entanglement as a vital resource for information processing can be described by special properties of the quantum state. Using the well-known Weyl basis we propose a new Bloch decomposition of the quantum state and study its separability problem. This decomposition enables us to find an alternative characterization of the separability based on the correlation matrix. We show that the criterion is effective in detecting entanglement for the isotropic states, Bell-diagonal states and some PPT entangled states. We also use the Weyl operators to construct an detecting operator for quantum teleportation.
We present a scheme for teleporting an unknown, two-particle entangled state with a message from a sender (Alice) to a receiver (Bob) via a six-particle entangled channel. We also present another scheme for teleporting an unknown one-particle entangled state with a message transmitted in a two-way form between the same sender and receiver via a five-qubit cluster state. One-way hash functions, Bell-state measurements, and unitary operations are adopted in these two schemes. Our schemes use the physical characteristics of quantum mechanics to implement delegation, signature, and verification processes. Moreover, a quantum key distribution protocol and a one-time pad are adopted in these schemes.
We study the nonlocality of arbitrary dimensional bipartite quantum states. By computing the maximal violation of a set of multi-setting Bell inequalities, an analytical and computable lower bound has been derived for general two-qubit states. This bound gives the necessary condition that a two-qubit state admits no local hidden variable models. The lower bound is shown to be better than that from the CHSH inequality in judging the nonlocality of some quantum states. The results are generalized to the case of high dimensional quantum states, and a sufficient condition for detecting the non-locality has been presented.
