First, we should mention the key pieces in Quantum Information Processing (in general), and Quantum Computing, and Communications (in particular), i.e., the Principle of Superposition and the quantum entanglement  , both closely related to the work of Erwin Schrödinger   . In fact, Schrödinger defined the entangled of pure states as the pure quantum state associated to composite systems like A and B that cannot be represented in the form of simple tensor products of subsystem state-vectors, that is  ,
where “ ” indicates the tensor product (also known as Kronecker’s product) while and are vectors providing the states of both subsystems, such as elementary particles   . Those states of composite systems that can be represented as tensor products of subsystem states constitute the complement in the set of pure states, the product states  . In fact, states of the composite system that can be represented in this form are called separable states. Then, since not all states are separable states (and thus product states) we will carry out the following analysis. A pair of basis is established: for HA and for HB. In HA ⊗ HB, the most general state is of the form
Therefore, this state will be separable if there exist vectors , , so
that yielding and . It is inseparable
if for any vectors , at least for one pair of coordinates , we have . If a state is inseparable, it is called an entangled state.
On the other hand, in 1935 Albert Einstein, Boris Podolsky and Nathan Rosen (EPR) propose a thought experiment by which they try to demonstrate that the wave-function does not provide a complete description of physical reality (and which gives rise to the famous EPR paradox), and hence that the Copenhagen interpretation is unsatisfactory; resolutions of the paradox have important implications for the interpretation of quantum mechanics  . The essence of the paradox is that particles can interact in such a way that it is possible to measure both their position and their momentum more accurately than Heisenberg’s uncertainty principle allows  , unless measuring one particle instantaneously affects the other to prevent this accuracy, which would involve information being transmitted faster than light    as forbidden by the theory of relativity (“spooky action at a distance”)       . This consequence had not previously been noticed and seemed unreasonable at the time; the phenomenon involved is now known as quantum entanglement   .
Moreover, in 1964 John S. Bell introduces his famous theorem  associated with 4 states, i.e., 2-qubit vectors into a combined space of Hilbert , and relative to two subsystems A and B,
where they are called Bell’s states, and also known as EPR pairs. This theorem raises an inequality, which when violated by quantum mechanics establishes the non-locality present in the entanglement of two subsystems like A and B. Besides, a posterior redefinition of this inequality due to Clauser, Horne, Shimony and Holt (CHSH)  leads to a more conducive way to experimental testing with  and without  loopholes.
An extremely important concept in quantum teleportation is the No-Cloning Theorem   , which states that it is impossible to create an identical copy of an arbitrary unknown quantum state. This No-Go Theorem of quantum mechanics was articulated by Wootters and Zurek  and Dieks  in 1982, and has profound implications in quantum computing and related fields. Besides, the No-Cloning Theorem  prevents the transfer of information faster than the speed of light    . We have seen that a measurement on subsystem A instantaneously transforms subsystem B into a well-defined state. The word “instantaneous” is seductive. Let us imagine that an entangled pure state has been produced whose subsystem SA is at Alice’s location and whose another subsystem SB at Bob’s location, very far away. Alice attempts to transmit one bit of information to Bob by measuring one of two non-commuting observables on her subsystem SA. If Bob succeeds in reading out this information on his subsystem SB, then it would have been transmitted at a velocity greater than that of light and this would contradict the theory of relativity  .
Quantum teleportation    is a process by which a quantum state can be transferred from one point to another while destroying the original state, which is required by the no-cloning theorem    . This process takes place between two different locations. An EPR pair (i.e., two maximally entangled states) is apportioned between Alice and Bob. Alice has the state to be teleported. This state is entangled with his EPR state, and after that a process involving quantum gates, Alice performs measurements with a certain probability, so that in identifying the original state in the appropriate base she transmits the elements of that base but in its classic version (i.e., two bits) through a classic channel. On the other side, Bob receives both bits, so that with them and the appropriate quantum gates, he rebuilds the original state. Clearly, we can see that a quantum teleportation depends on a classical communication, which can proceed no faster than the speed of light, it cannot be used for faster-than-light transport or communication of classical bits. Of course, the classical channel is the weak link in this chain in terms of transmission speed.
Otherwise, and since the quantum entanglement has a serious enemy, and in addition, quantum teleportation necessarily depends on the quantum entanglement, then such an enemy is inherited by quantum teleportation. This enemy is decoherence  , which usually collapse the entanglement. Decoherence can be viewed as the loss of information from a system into the environment, since every system is loosely coupled with the energetic state of its surroundings. This interaction between the state and its environment is clearly seen during the quantum measurement  , which causes the collapse of the wave-function   . To try to mitigate this problem, we must apply reconstructive techniques of the state, which results in an increase in the computational cost of the process as a whole  .
In this paper, we present a new protocol of quantum teleportation which does not require any disambiguation based on the transmission of classical bits, as in fact it happens in the original version     , which when using two channels (one classic for the bits and another quantum for the distribution of the EPRs) is more susceptible to attacks. However, the new version is simpler to implement in the laboratory than the original. This possibility has its origin in a work of Quantum Communications  which, through an extensive analysis, reaches the conclusion that such a possibility is viable.
Finally, the main pending aspect within the teleportation is its lack of instantaneity (seen and a whole) and a clear definition of its bandwidth  . Both are the responsibility of the classic channel that the protocol necessarily uses. To this scenario points to this work based on  .
For the implementation of quantum teleportation, we must use some quantum gates, which we are going to present next. The first one is the Hadamard gate,
which acts on a single qubit. It maps the basis state to and to , which means that a measurement will have equal probabilities
to become 1 or 0 (i.e., it creates a superposition). It is represented by the Hadamard matrix:
where and are two of the three Pauli’s matrices 
, and (5)
with . Figure 1 represents the Hadamard’s gate  .
The second one is the Controlled NOT gate or simply CNOT, which operates on a quantum register consisting of 2 qubits. The CNOT gate flips the second qubit (the target qubit) if and only if the first qubit (the control qubit) is . The inputs are allowed to be a linear superposition of . As an example of this, we can see that the CNOT gate transforms a superposed quantum state of the kind into another like . The CNOT gate can be represented by the matrix:
where I is the identity matrix. Figure 2 represents the CNOT gate  .
With both gates, we can build the famous Bell state (or EPR pair, named after Einstein, Podolsky, and Rosen paper  ) from computational basis state  , as we can see in Figure 3.
As an example, we are going to build , i.e., the Bell state of Figure 3 based on two states at its entrance and the application of Hadamard (H) and CNOT gates in that order. Thus, for the upper branch of Figure 3, we have
while by the lower branch, simply . Now, and before of CNOT gate, the Kronecker’s product “ ” intervenes between both branchs of Figure 3, the upper and the lower,
Figure 1. Hadamard’s (H) gate.
Figure 2. CNOT gate.
Figure 3. The output of these gates (Hadamard and CNOT) is an EPR qubit or Bell state. In fact, an EPR pair, one to Alice and other to Bob.
Finally, CNOT gate is applied
The complete set of Bell’s basis are:
On the other hand and as a complement to the tools seen so far in this section, it is necessary to be able to evaluate the quality of the experimental implementation of teleportation protocols in the presence of noise, i.e., how faithful is the teleported state to the original? Therefore, we will need a good metrics to be able to evaluate said transfer quality. Then, we recommend here two versions of the most used metric in teleportation, the fidelity  . These versions have to do with the characteristic of the state to teleport, i.e., if it is pure or a mixed state    .
Fidelity f is a metric which gives us the closeness between an initial and final state in a quantum process  . It has widely been used to characterize the performance of various quantum information tasks. Fidelity f is bounded by 0 ≤ f ≤ 1, where the unit fidelity (f = 1) implies that the initial and final states are equivalent  . Quantum teleportation is designed to transmit all possible (unknown) input states, thus a measure of averaging over all inputs is used. That is the average fidelity F. It quantifies how well the unknown input states can be transmitted to another location. Thus, F shows the optimality of the quantum teleportation. There it is shown that the unit average fidelity (F = 1) can be obtained when the two remote parties share the maximally entangled states, whereas F = 2/3 is the maximally attainable one in any classical schemes which cannot use the entanglement  .
Therefore, if and are the state to be teleported and the state teleported, respectively,
will be their respective density matrices. Fidelity quantifies a transformation performance between and states as,
The quantum teleportation applies to unknown input states so that the average fidelity―an average of the fidelities f over all possible input states―is used:
where is Haar measure with . Here, F = 1 implies that the task is perfectly performed for all possible inputs, while F = 1/2 does at random  .
3. Standard Quantum Teleportation
Then, we will develop the standard quantum teleportation protocol with and without noise. Where, the noiseless analysis is fundamental taking into account the implications of the new protocol for the whole Physics from the theoretical point of view, while from the purely experimental point of view we must consider the reality of the laboratory affected by innumerable noises due to all the gates involved for the purpose of implementing the different protocols. For this last reason, we need a thorough analysis in the presence of noise.
3.1. Noiseless Analysis
The quantum teleportation begins with the distribution of the EPR pair to Alice and Bob. This distribution constitutes the entanglement link between Alice and Bob, and after that, we continue with the complete sketch of quantum teleportation of Figure 4, where the green line indicates the border between the sides of Alice and Bob, that is, both extremes of the entanglement link. In Figure 4, a single fine line represents a wire carrying one qubit, while a double line represents a wire carrying one classical bit  . Besides, the classical channel is really a control classical channel for disambiguation purposes (as we will see below through two bits), while the entanglement link is really an entanglement data link. Besides, in this figure, the block with an H represents a Hadamard’s gate, and of Equation (10).
Now, If is an arbitrary state to be teleported with and of a Hilbert space, then, the initial state (3-partite state) will be,
where for simplicity (and from here on) in a generic form .
Now, CNOT gate is applied to Equation (15),
At this time, we apply a Hadamard’s gate to the elements of Equation (16),
Besides, Table 1 synthesizes the complete process of quantum teleportation, where Alice measures two of the possible qubits of the basis of Equation (10) and therefore she transmits the corresponding bits b1 and b2 via a classical channel to
Table 1. Alice’s side: measurement of the base, classical transmission of bits, and the collapse of states. Bob’s side: classical reception of bits, gates application for the final recovery of the arbitrary state.
Figure 4. Standard Teleportation protocol using an EPR pair and two classical bits for disambiguation.
Bob. The quantum measurement process is imperative in order to make the wave-function of the original arbitrary state collapse since this is necessary not to violate the No-Cloning Theorem. In other words, the quantum measurement process destroys the original arbitrary state  .
At this point, it is important to mention that in literature there are several concerns regarding the implementation of teleportation protocols using a greater or lesser dimensional commitment but always with two classical bits for disambiguation. An interesting example can be found in  , which shows that the one-qubit teleportation can be considered as a state transfer between subspaces of the whole Hilbert space of an indivisible eight-dimensional system. However, this as well as the rest of the works that manipulate high dimensional quantum systems for the implementation of quantum teleportation protocols do it with two classical bits for disambiguation.
On Alice’s side, the combination of the modules constituted by the following gates: CNOT, H (Hadamard) and quantum measurement, constitute what is known as Bell State Measurement (BSM), while on Bob’s side, its modules are unitary operations necessary for the reconstruction of the teleported state. What Alice did plus the transmission of the classic bits of disambiguation along with Bob’s unitary operations is the clearest example of Local Operations and Classical Communication (LOCC)  .
Finally, we must highlight as a fundamental contrast between this version of the quantum teleportation protocol with the following one, that here, i.e., in Equation (15) we make and that the Kronecker product “ ” is not commutative.
3.2. Noisy Analysis
Starting again from Figure 4, and considering noise in the EPR pair by a disturbance of the shape
where subscript n means noise, and
, with (19)
Then, repeating Equation (15) but with instead of , we will have
Now, CNOT gate is applied to Equation (20),
At this time, we apply a Hadamard’s gate to the elements of Equation (21),
From here, we follow a procedure similar to that of Table 1 but taking into account how sensitively the state will be affected by noise.
4. Simplified Quantum Teleportation
First, and unlike the previous one, the new protocol dispenses with a classic channel to transmit the disambiguation bits, as well as it does not require the use of the Pauli matrices of Bob’s side in order to reconstruct the teleported state from the mentioned disambiguation bits. These simplifications are the reason for the title of this paper, that is, simplified protocol. We will focus on Figure 5 using instead of .
Figure 5. Simplified Teleportation protocol using an EPR pair but without classical bits for disambiguation.
4.1. Noiseless Analysis
Now, CNOT gate is applied to Equation (23),
Applying a Hadamard’s gate to the elements of Equation (24),
It is clear from Equation (25) that no disambiguation is necessary. Alice measures (where, both bits are always equal to zero independently of ) in order to annul the entanglement and thus avoid violating the No-Cloning Theorem   . We can also see in Figure 5 that it is not necessary for Bob to apply any unitary transformation. This eliminates the classic channel that is responsible for obliging teleportation as a whole to be carried out in a time greater than zero, i.e., not being instantaneous.
4.2. Noisy Analysis
For noisy EPR pairs we also resorted to Figure 5 and using the same version of Equation (18) and Equation (19). Then, repeating Equation (23) but with instead of , we will have
Now, we apply CNOT gate to Equation (26),
Applying a Hadamard’s gate to the elements of Equation (27),
The worst consequence of noise on the new protocol is that the teleported state loses its purity, that is to say, it would not be on Bloch’s sphere, in the more general case, given that , but even so, the teleported state is recovered without problems and without disambiguation.
5. Conclusions and Future Works
In this work, we have presented a new quantum teleportation protocol in which we have eliminated the classical channel used currently for disambiguation, and since the classical channel is the weak link of standard teleportation in all matters relating to safety and speed, the novel seems to be an interesting alternative. We speak of security since quantum cryptography   is much more robust than its classical counterpart, being its main tool the quantum key distribution (QKD)     . On the other hand, the classical channel forces the communications system (as a complete unit) to have a speed of transmission equal to the speed of light, that is, the system is not instantaneous. In other words, in the case of an interplanetary communication, the traditional teleportation behaves (from the point of view of speed) as a classic communications system currently in use. The new protocol is also not instantaneous; it simply doesn’t have the disadvantages of the classic channel, although it is extremely faster than traditional teleportation.
The experimental implementation of the new protocol will allow us to verify what is established in  , which is an attempt to unify the two main pillars of Physics: the Theory of Relativity and Quantum Mechanics, as well as get a better understanding of the entanglement. This happens because the new protocol eliminates the obligation to use two channels, a classical one and a quantum one, and that because of the first one, the fundamental attribute of entanglement is lost: the instantaneity. Furthermore, in the Quantum Communications work mentioned above  , it is demonstrated that a superluminal signaling   is not necessary for entanglement to be instantaneous.
The future challenges in this area involve: a thorough study of what this work means in black hole theory, and, a formal and detailed analysis of the complete attributes of the entanglement and therefore of a quantum channel in terms of its bandwidth, channel capacity and information transit time for Quantum Communications    . Besides, the impact of the aforementioned verification on Quantum Internet   and Super Dense Coding   is evident.
Finally, and considering that there are already precedents of teleportation of energy   , and taking into account  , can we in the not too distant future teleport matter via exclusively quantum channels?
The author wishes to thank the scientists who created quantum teleportation for such a significant contribution to science and technology.
Conflicts of Interest
The authors declare no conflicts of interest regarding the publication of this paper.
 Einstein, A., Lorentz, H.A., Minkowski, H. and Weyl, H. (1952) The Principle of Relativity: A Collection of Original Memoirs on the Special and General Theory of Relativity. Courier Dover Publications, New York.
 Ghirardi, G.C., Grassi, R., Rimini, A. and Weber, T. (1988) Experiments of the EPR Type Involving CP-Violation Do Not Allow Faster-than-Light Communication between Distant Observers. Europhysics Letters, 6, 95-100.
 Aspect, A., Grangier, P., Roger, G. (1982) Experimental Realization of Einstein- Podolsky-Rosen-Bohm Gedankenexperiment: A New Violation of Bell’s Inequalities. Physical Review Letters, 49, 91-94.
 Clauser, J.F., Horne, M.A., Shimony, A. and Holt, R.A. (1969) Proposed Experiment to Test Local Hidden-Variable Theories. Physical Review Letters, 23, 880-884.
 Bennett, C.H., Brassard, G., Grepeau, C. and Jozsa, R. (1993) Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels. Physical Review Letters, 70, 1895-1899.
 Boschi, D., et al. (1998) Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels. Physical Review Letters, 80, 1121-1125.
 Bennett, C.H. and Brassard, G. (1984) Quantum Cryptography: Public Key Distribution and Coin Tossing. IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, 9-12 December 1984, 175-179.
 Wehner, S. (2018) The Quantum Internet Has Arrived (and It Hasn’t): Networks That Harness Entanglement and Teleportation Could Enable Leaps in Security, Computing and Science. Nature, 554, 289-292.