There has been spectacular progress in the field of quantum information in recent decades. The development of this field highlights the importance of the role of entanglement in quantum computing, quantum teleportation and quantum cryptography. These notes serve to provide a gentle introduction to the entanglement of bipartite states. In these notes, we introduce Bell's theorem in the form derived by Clauser, Horne, Shimony and Holt. We discuss the Schmidt decomposition and the Peres-Horodecki criterion in the entanglement of pure and mixed bipartite states. Finally, we describe a teleportation protocol as an illustration of the use of entangled states.
There has been spectacular progress in the field of quantum information in recent decades. The development of this field highlights the importance of the role of entanglement in quantum computing, quantum teleportation and quantum cryptography. These notes serve to provide a gentle introduction to the entanglement of bipartite states. In these notes, we introduce Bell's theorem in the form derived by Clauser, Horne, Shimony and Holt. We discuss the Schmidt decomposition and the Peres-Horodecki criterion in the entanglement of pure and mixed bipartite states. Finally, we describe a teleportation protocol as an illustration of the use of entangled states.
Abstract This chapter describes entanglement in bipartite systems. We define entanglement for pure states introducing the concept of Schmidt decomposition, and we show that entanglement can be quantified through the von Neumann entropy. We then present dense coding and teleportation, two quantum information protocols that use entanglement as a resource. We present the notions of locality and realism and derive the Clauser-Horne-Shimony-Holt inequality, an extended version of Bell’s inequalities. We then focus on mixed states and we present different techniques to solve the separability problem
Quantum Information Processing (QIP) exploits the principles of quantum mechanics to perform information storage, communication, and computation in ways that are fundamentally impossible within classical frameworks. This article presents a pedagogical overview of the mathematical foundations of quantum information theory, including qubits, Hilbert spaces, linear operators, quantum measurements, tensor products, density operators, and quantum entanglement. Building upon these concepts, we provide a detailed introduction to quantum teleportation, one of the most remarkable protocols in quantum communication. The discussion covers the no cloning theorem, the original teleportation protocol by Bennett et al., experimental realisations of quantum teleportation, and extensions involving probabilistic and multiqubit teleportation schemes. Particular emphasis is placed on the role of entanglement as a communication resource, together with the study of teleportation channels based on bipartite and multipartite quantum states. Various quantitative measures of entanglement, including concurrence, negativity, entanglement of formation, and relative entropy of entanglement, are reviewed alongside teleportation fidelity as a performance metric. Furthermore, the interplay between Bell nonlocality, mixed state entanglement, and teleportation efficiency is examined, followed by a survey of advanced developments such as controlled teleportation, bidirectional teleportation, cluster state teleportation, and recent advances in the Quantum 2.0 era. This review aims to provide students, researchers, and engineers with a coherent introduction to the theoretical foundations and practical significance of quantum teleportation in emerging quantum technologies.
Quantum entangled states play very important roles in quantum information processing,such as quantum teleportation,dense coding,error correction,cryptography,and computation.The theory of entanglement mainly concerns the characterization of quantum entanglement and the classification of quantum states,as well as its applications in quantum information processing.We present some basic concepts and results,including:the relationship between locality and reality in quantum mechanics and Bell inequalities,and that between Bell inequalities and the separability of quantum states;the definition of separability for pure and mixed quantum states,and some separability criteria such as the positive map approach,positive partial transpose,reduction criterion,realignment,entanglement witnesses,and the covariance matrix approach and local uncertainty relations;some entanglement measures such as the entanglement of formation,concurrence,relative entropy,negativity,tangle,entanglement of assistance,and their estimation;the change in entanglement when the physical system evolves or undergoes interaction with the environment.
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
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.
These notes are intended as a simple introduction to the new field of quantum computing, quantum information theory and quantum cryptography.Undergraduate level quantum mechanics and mathematics is required for an understanding of these lectures.After an introduction to qubits and quantum registers, we introduce the key topics of entangled states and quantum logic gates.For two qubit states, we introduce the four Bell states as a change of basis.The essentials of quantum cryptography are then described, although this is just a straightforward application of quantum mechanics.The characters of Alice, Bob and Eve are first introduced here.Two qubit Bell states are used to demonstrate a novel 'dense coding' technique.Finally, in these communication applications, quantum teleportation is explained in detail, again making use of entangled Bell states.The technique of magnetic spin resonance is used as a familiar example to illustrate how qubit operations could in principle be realised.This leads on to the specification of quantum devices that can encode functions.All this is preparatory to a detailed discussion of two of the most significant quantum algorithms discovered to date, namely, Peter Shor's factorization algorithm and Lov Grover's quantum database search algorithm.