Skip to main content

A Simple Explanation of Quantum Teleportation

 

Quantum teleportation is the sending of a quantum state from a transmitter to a receiver. It is a phenomenon that we are classically accustomed to by definition until now. But, as the name suggests, quantum teleportation takes advantage of the strange properties of the quantum.

The first emergence of today's quantum teleportation phenomenon was with the article "Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels" published in 1993. This famous article was published by Cherles H. Bennett et al. In the article, the mathematical possibility of quantum teleportation has been proven.

Since then, many quantum teleportation protocols have been developed. Generally speaking, let Alice be the transmitter, Bob the receiver, and Source the setter. Let Source superposition the two qubits to be transmitted and give the qubits in this state to Alice. Let Alice entanglement her own particle with the particle she received from Source and send it to Bob through classical channels. Bob, on the other hand, performs some operations on the particle previously sent from the Source according to these bits he received from Alice and finally performs the measurement. In this case, there are two events encountered.

Quantum teleportation procedure.

1) The quantum state in Alice's hand disappeared when Alice made an observation.

2) With Bob's measurement, the quantum information in Alice was formed in Bob.

Here are some points to note. First, a physical object is not sent, which we classically perceive in quantum teleportation. What is sent is the quantum information of the quantum particle.

Another important point is that when the receiver measured the beamed information, the information of the particles that Alice had in her hand at first disappeared. In fact, the information contained, not the particles themselves, was teleported. As a result of my no-copy theory, the information in Alice disappeared without being copied.

We can perceive this event more easily by making a classical analogy. For example, you have a glass in your hand and you want to teleport it to your friend. What you have to do is break the glass and then teleport it. This glass will be formed again in your friend's hand, but with the only difference, it will be re-synthesized according to the breaking information of the glass you broke, not the real glass you hold in your friend's hand. In other words, the information about the breaking will be transmitted.

It may still sound complicated. However, in the following sections, I will write an explanation of this phenomenon through mathematics and algorithms.

Stay with curious. :)




Reference

C. H. Bennett, et al. (1993). Teleporting An Unknown Quantum State Via Dual Classical And Einstein-Podolsky-Rosen Channels. Physical Review Letters, sf: 1895. doi: 10.1103/PhysRevLett.70.1895.

https://en.wikipedia.org/wiki/Quantum_teleportation

https://www.bizsiziz.com/quantum-teleportation-and-entanglement-leads-to-nobel-prize-victory/

Labels:

Comments

Post a Comment

Popular posts from this blog

Bloch Sphere – Geometric Representation of Quantum State

    It is very difficult to visualize quantum states before our eyes. The Bloch sphere represents quantum state functions quite well. The Bloch sphere is named after physicist Felix Bloch. As you can see in the Bloch sphere figure below, it geometrically shows the pure states of two-level quantum mechanical systems. The poles of the Bloch sphere consist of bits |0⟩ and |1⟩. Classically, the point on the sphere indicates either 0 or 1. However, from a quantum mechanics point of view, quantum bits contain possibilities to be found on the entire surface of the sphere. Traditionally, the z-axis represents the |0⟩ qubit, and the z-axis the |1⟩ qubit. When the wave function in superposition is measured, the state function collapses to one of the two poles no matter where it is on the sphere. The probability of collapsing into either pole depends on which pole the vector representing the qubit is closest to. The angle θ that the vector makes with the z-axis determines this probabilit...
1 comment
Read more

Statement of Bell's Inequality

 One of the most important applications of quantum mechanics is Bell's inequality. In 1965, John Stewart Bell actually thought that Einstein might be right and tried to prove it, but proved that quantum logic violated classical logic. It was a revolutionary discovery. Let's look at its mathematically simple explanation. To create the analogy, let's first write a classical inequality.   This inequality above is a classic expression. The quantum analogy of this expression represents the Bell inequality. With just one difference. Bell's inequality shows that the above equation is violated. Expressing Bell's inequality by skipping some complicated mathematical intermediates; While there is no such situation in the classical world that will violate the inequality we mentioned at the beginning, it is difficult to find a situation that does not violate this inequality in the quantum world. Reference https://www.youtube.com/watch?v=lMyWl6Pq904 https://slideplay...
1 comment
Read more

Bernstein–Vazirani Algorithm

  Quantum computers currently available are not sufficient to solve every existing classical problem due to their own characteristics. This does not mean that they are inferior to classical computers, or that, on the contrary, quantum computers should give all kinds of advantages over classical computers. Popular quantum algorithms solved in quantum computers are algorithms created by taking advantage of the superposition and entanglement properties of particles. So, they are algorithms created to show the prominent features of quantum properties. Today I will talk about an enjoyable algorithm that demonstrates the efficiency and speed of these quantum features. Known as the Bernstein - Vazirani algorithm is a quantum algorithm invented by Ethan Bernstein and Umesh Vazirani in 1992. The purpose of this algorithm, which is a game, is to find a desired number. To put it more clearly, let's keep in mind a string of binary numbers, for example, 1011001. Next, let's write an algori...
Post a Comment
Read more