Abstract This chapter gives a detailed overview of entanglement for pure and mixed states. We begin with the Schmidt-decomposition theorem, which allows us to associate the subsystem mixedness of pure state with entanglement. We discuss the purification of mixed quantum states, the convexity of the set of separable states, and entanglement as a form of correlation. As an example we examine the Bloch decomposition for two qubits. For the detection of entanglement the Peres-Horodecki criterion is introduced, before we analyse the relation between entanglement and non-locality via the CHSH-Operator Criterion and the family of Werner states. We further consider Tsirelson’s bound and hidden non-locality. We then discuss important mathematical tools for entanglement detection, including the positive-map theorem, the Størmer-Woronowicz theorem, and the reduction criterion. In this context we examine the family of isotropic states. Finally, the Weyl states provide an example for which we study the geometry of two-qubit entanglement
Abstract This chapter gives a detailed overview of entanglement for pure and mixed states. We begin with the Schmidt-decomposition theorem, which allows us to associate the subsystem mixedness of pure state with entanglement. We discuss the purification of mixed quantum states, the convexity of the set of separable states, and entanglement as a form of correlation. As an example we examine the Bloch decomposition for two qubits. For the detection of entanglement the Peres-Horodecki criterion is introduced, before we analyse the relation between entanglement and non-locality via the CHSH-Operator Criterion and the family of Werner states. We further consider Tsirelson’s bound and hidden non-locality. We then discuss important mathematical tools for entanglement detection, including the positive-map theorem, the Størmer-Woronowicz theorem, and the reduction criterion. In this context we examine the family of isotropic states. Finally, the Weyl states provide an example for which we study the geometry of two-qubit entanglement
Hilbert–Schmidt (HS) decompositions are employed for analyzing systems of [Formula: see text]-qubit, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary (PTU) transformations for one qubit from the whole system, are used for indicating entanglement/separability. A sufficient criterion for full separability of the [Formula: see text]-qubit and qubit–qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and [Formula: see text]-qubit systems, with emphasis on maximally disordered subsystems (MDS) (i.e. density matrices for which tracing over any subsystem gives the unit density matrix). A sufficient condition that [Formula: see text] (MDS) is not separable is that it has an eigenvalue larger than [Formula: see text] for a qubit and a qudit, and larger than [Formula: see text] for [Formula: see text]-qubit system. The PTU transformation does not change the eigenvalues of the [Formula: see text]-qubit MDS density matrices for odd [Formula: see text]. Thus, the Peres–Horodecki (PH) criterion does not give any information about entanglement of these density matrices. The PH criterion may be useful for indicating inseparability for even [Formula: see text]. The changes of the entanglement and separability properties of the GHZ state, the Braid entangled state and the [Formula: see text] state by mixing them with white noise are analyzed by the use of the present methods. The entanglement and separability properties of the GHZ-diagonal density matrices, composed of mixture of 8[Formula: see text]GHZ density matrices with probabilities [Formula: see text], is analyzed as function of these probabilities. In some cases, we show that the PH criterion is both sufficient and necessary.
Abstract Chapter 17 deals with the description of high-dimensional quantum systems and entanglement between them. We start with the generalized Bloch decomposition and present several useful options for the choice of operator bases, including the generalized Gell-Mann basis, the polarization-operator basis, and the Weyl-operator basis. We apply these bases for the example of isotropic two-qudit states and for the detection of bound entanglement for systems of two qutrits. We then turn to the problem of detecting entanglement in high-dimensional systems. For this purpose we review mutually unbiased bases and employ them for entanglement detection. We then discuss entanglement detection using entropic uncertainty relations, before we show how to obtain lower bounds on pure-state fidelities, on the entanglement of formation, and on the Schmidt number from measurement in pairs of mutually unbiased bases
Summary: \nEntanglement is a strange feature contained in the quantum mechanical framework, first observed theoretically by Erwin Schrödinger and Albert Einstein. An inherent attribute of entanglement is non-locality, and in the continuation of this, several non-reductionist features, which are conceptually challenging and philosophically interesting. \n \nA considerable growth of the interest in quantum entanglement has occurred since the early 1990s, and much of the reason for this is that the tools of quantum optics and modern instrumentation have made it possible to measure and manipulate entangled quantum systems. Today, several applications of entanglement exist, including quantum computers and several areas in quantum communications. \n \nA quantum state is either separable or entangled, it cannot be none or both. A separable state do not exhibit the non-local features found in entangled states, and are in this sense comparable to classic states. An important issue here is the separability problem, which is the problem of determining whether a given state is entangled or not. \n \nWe study these quantum states as Hermitian matrices with positive eigenvalues in convex spaces. The PPT criterion is based on the partial transposition operation, which essentially transposes one of the two subsystems in the quantum system. For some states the result is another quantum (positive) state, and these are PPT (Positive Partial Transpose) states, while others that gain negative eigenvalues are called NPT states. \n \nFor systems of dimensions 2 × 2 and 2 × 3, the PPT states are identical to the separable states, and the NPT states are identical to the entangled states, so the PPT criterion is always conclusive. But for larger dimensions, such as for instance the 3 × 3 system, there always exist PPT states that are entangled, so for this case the PPT criterion can only be used in a contrapositive way. Since entangled PPT states in this sense seem to have great significance, their characteristics are worth studying. \nAs mentioned, the PPT criterion uses the transposition map on one of the two subsystems of a composite quantum system. Transposition is an example of a positive map, in that it maps all quantum states into quantum states. It is possible to use positive maps to formulate a much more general criterion for the separability problem.There is a link (an isomorphism) between positive maps and a subset of Hermitian operators called entanglement witnesses. \n \nThe so-called Horodecki criterion states that a quantum state is separable if and only if the expectation value of all entanglement witnesses in the state are non-negative. If the expectation value of one (or possibly several) entanglement witnesses in a given quantum state is negative, then the state is always entangled. This criterion is both necessary and sufficient, but demands that we can characterize the entire set of entanglement witnesses. \n \nThe approach in this thesis is through geometry. Of fundamental importance is the convex nature of the sets in question. The knowledge and understanding of the extremal points in these sets is very relevant, since they describe the sets completely. Undertaking completely analytic studies of the geometry at hand is in general very hard, especially as the dimension of the systems grow. The development and use of numerical tools is therefore essential.
Chapter devoted to the basic quantum properties of entanglement and separability. Introduces the Schmidt decomposition for pure states and the positive partial transpose criterion for mixed states as entanglement witnesses. Introduces the famous Einstein–Podolsky–Rosen paradox and its implementation in terms of qubits, then the Bell inequality, quickly reviewing the experimental demonstrations that quantum mechanics violates this inequality. Gives examples of the use of entanglement in a quantum algorithm to accelerate an information task, namely a database search (Grover algorithm) and the possibility of teleportation of a quantum state.
A complete chapter on quantum entanglement measures and detection of entanglement is given because there are a wide variety of entanglement measures for pure and mixed states which are used very often. The interesting feature of these routines is the fact that, these operations can be done between any random set of qubits not necessarily contiguous qubits. Key recipes to perform operations like partial tracing and partial transpose are disscussed in detail. After that, it was decided to devote several routines to calculate the entanglement measures like concurrence and its variants, von Neumann entropy, block entropy, Renyi entropy, Q measure, negativity and log negativity, entanglement spectrum and residual entanglement (three tangle). Last but not least, certain entanglement detection procedures like Positive Partial Transpose (the Peres-Horodecki criteria) and the reduction criteria are also explained via examples.
Hilbert-Schmidt (HS) decompositions are employed for analyzing systems of n-qubits, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary transformations (PTU) for one qubit from the whole system, are used for indicating inseparability. A sufficient criterion for full separability of the n-qubits and qubit-qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and n-qubits systems, with emphasis on maximally disordered subsystems (MDS) (i.e., density matrices rho(MDS) for which tracing over any subsystem gives the unit density matrix). A sufficient condition that rho(MDS) is not separable is that it has an eigenvalue larger than 1/d for a qubit and a qudit, and larger than 1/2^(n-1) for n-qubits system. The PTU transformation does not change the eigenvalues of the n-qubits MDS density matrices for odd n. Thus the Peres-Horodecki criterion does not give any information about entanglement of these density matrices, but this criterion is useful for indicating inseparability for even n. The changes of the entanglement and separability properties of the GHZ state, the Braid entangled state and the W state by mixing them with white noise are analyzed by the use of the present methods. The entanglement and separability properties of the GHZ-diagonal density matrices, composed of mixture of 8 GHZ density matrices with probabilities p(i), is analyzed as function of these probabilities. In some cases we show that the Peres-Horodecki criterion is both sufficient and necessary.