Quantum information and computation has been a rapidly evolving field. As Landauer pointed out, information is physical , so it should not look strange to try to bring together quantum mechanics and information theory. Indeed, it was soon realized that it was possible to use the laws of quantum physics to perform tasks which are unconceivable within the framework of classical physics like quantum teleportation, superdense coding, quantum cryptography, Shor’s factorization algorithm or Grover’s searching algorithm. Here, quantum teleportation has been discussed in a different way for two qubit pure state. It is a well-known fact that any two qubit pure states can be decomposed into two parts – pure entangled part and factorizable part. The square of the weightage of entangled part ( p ) gives the amount of entanglement in the state. It has been shown that the fidelity of quantum teleportation is a function of p and its variation with p has been plotted for all the possible outcomes. Keywords: quantum mechanics, teleportation, Fidelity
Quantum information and computation has been a rapidly evolving field. As Landauer pointed out, information is physical , so it should not look strange to try to bring together quantum mechanics and information theory. Indeed, it was soon realized that it was possible to use the laws of quantum physics to perform tasks which are unconceivable within the framework of classical physics like quantum teleportation, superdense coding, quantum cryptography, Shor’s factorization algorithm or Grover’s searching algorithm. Here, quantum teleportation has been discussed in a different way for two qubit pure state. It is a well-known fact that any two qubit pure states can be decomposed into two parts – pure entangled part and factorizable part. The square of the weightage of entangled part ( p ) gives the amount of entanglement in the state. It has been shown that the fidelity of quantum teleportation is a function of p and its variation with p has been plotted for all the possible outcomes. Keywords: quantum mechanics, teleportation, Fidelity
Quantum teleportation with additional a priori information about the input state achieves higher fidelity than teleportation of a completely unknown state. However, perfect teleporation of two nonorthogonal input states requires the same amount of entanglement as perfect teleportation of an unknown state, namely one ebit. We analyze how well two-state teleportation can be achieved using every degree of pure-state entanglement. We find the highest fidelity of ``teleportation'' that can be achieved with only classical communication but no shared entanglement. A two-state telecloning scheme is constructed.
Through the process of quantum teleportation, a transfer of quantum information takes place from one particle to another while maintaining zero physical movement between the two. Quantum teleportation requires two entangled particles along with projective measurements followed by exchanging two bits of classical information. The process requires quantum mechanics principles which combine superposition with entanglement. Quantum entanglement occurs when two or more particles create an inseparable relationship that cuts off a separate description of an individual particle. Experimental realizations of quantum teleportation continue to operate on different physical platforms which include photons as well as atoms and superconducting circuits. Applications of Quantum teleportation includes quantum computing, secure communication, and cryptography. In future Scientists believe that a breakthrough in quantum computing technology could make teleportation a reality, including the ability to teleport a whole human. This paper provides the present research in quantum teleportation, including the theoretical framework, experimental implementations, and potential applications. We also discuss the challenges and limitations of quantum teleportation and propose future directions for research.
Abstract The superposition principle provides us the opportunity to unfold many surprising facts. One such fact leads to the generation of entanglement which may allow one to teleport an unknown quantum state from one location to another. We try to understand the role of superposition in the process of quantum teleportation, as a question of potentially fundamental importance. We consider, within the scenario of quantum teleportation, a set-up where the sender and the receiver are in a superposed situation of using a maximally entangled state and not using any entangled state in the teleportation protocol, controlled by a qubit. We address two distinct protocols: in the first case, the sender and the receiver do nothing when they do not have the authority to use entanglement, while in the second case, they still use classical communication even if they do not use entanglement. After accomplishing the protocols, we operate a Hadamard gate on the control qubit, measure the control qubit’s state, and consider the outcome corresponding to a particular state of the control. We compare the protocol’s fidelity with the maximum fidelity achievable through classical resources only. In particular, we provide conditions to achieve nonclassical fidelity in teleportation, in the presence of the control qubit. To explore if there is any quantum advantage (advantage of superposition present in the control qubit), we compare the fidelities of the control qubit-based protocols with the fidelity achieved in a situation where the two parties are in a classical mixture of using and not using the maximally entangled state. We observe that there exists a wide range of parameters defining the initial state of the control qubit for which our protocols provide quantum advantage. To analyse the role of superposition quantitatively, we discuss whether the amount of quantum advantage can be expressed in terms of quantum coherence present in the state of the control qubit.
This chapter is concerned with the measure of information contained in qubits . This can be done only through quantum measurement , an operation that has no counterpart in the classical domain. I shall first describe in detail the case of single qubit measurements, which shows under which measurement conditions “classical” bits can be retrieved. Next, we consider the measurements of higher-order or n -qubits. Particular attention is given to the Einstein–Podolsky–Rosen (EPR) or Bell states , which, unlike other joint tensor states, are shown being entangled . The various single-qubit measurement outcomes from the EPR–Bell states illustrate an effect of causality in the information concerning the other qubit. We then focus on the technique of Bell measurement , which makes it possible to know which Bell state is being measured, yielding two classical bits as the outcome. The property of EPR–Bell state entanglement is exploited in the principle of quantum superdense coding , which makes it possible to transmit classical bits at twice the classical rate, namely through the generation and measurement of a single qubit. Another key application concerns quantum teleportation . It consists of the transmission of quantum states over arbitrary distances, by means of a common EPR–Bell state resource shared by the two channel ends. While quantum teleportation of a qubit is instantaneous, owing to the effect of quantum-state collapse, it is shown that its completion does require the communication of two classical bits , which is itself limited by the speed of light.
In this chapter, we introduce the domain of quantum information. Quantum physics is much more than a perspective for new supports of information taking advantage of nanotechnologies. In fact, the quantum physics enables state superposition which can lead to significant breakthrough in computer programming. For example, the Grover algorithm brings the cost of partial search below complexity n instead of average complexity n /2 with classic computer, where n is the dataset size. Basically, the algorithm performs an inverse function computation when the direct function is given by a black box (i.e. has no particular structural property). The use of Grover algorithm could greatly impair the protection of transactions with cryptocurrencies if the quantum computers were to be generalized. Shore algorithm based on quantum Fourier transform in theory performs the factorization of numbers in O ( n 2 ), where n is the size of the number to be factorized. There is no known polynomial algorithm on classic computers to perform this task. However, the problem is not supposed to be NP hard. Indeed, it is believed that quantum computing cannot make NP-hard problems polynomial. We also look to one of the most spectacular quantum effects which is called the intrication . It allows a pair of particularly conditioned particles to be connected regardless of time and space. The intricacy was instrumental to prove via Bell inequality that the quantum measurement is indeed purely not deterministic. Although the connection between intricated particles is not expected to carry information in apparent faster than light transfer, however it leads to science fiction application such as teleportation, already experimented on system of few individual particles.
Quantum teleportation is one of the essential primitives of quantum communication. We suggest that any quantum teleportation scheme can be characterized by its efficiency, i.e. how often it succeeds to teleport, its fidelity, i.e. how well the input state is reproduced at the output, and by its insensitivity to cross talk, i.e. how well it rejects an input state that is not intended to teleport. We discuss these criteria for the two teleportation experiments of independent qubits which have been performed thus far. In the first experiment (1997, Nature, 390, 575) where the qubit states were various different polarization states of photons, the fidelity of teleportation was as high as 0.80 ± 0.05 thus clearly surpassing the limit of 2/3 which can, in principle, be obtained by a direct measurement on the qubit and classical communication. This high fidelity is confirmed in our second experiment (1998, Phys. Rev. Lett., 80, 3891), demonstrating entanglement swapping, that is, realizing the teleportation of a qubit which itself is still entangled to another one. This experiment is the only one to date that demonstrates the teleportation of a genuine unknown quantum state.