Skip to main content

Quantum Superdense Coding Protocol

 

One of the most basic applications of quantum algorithms is superdense coding. It is a simple protocol, but it is also an important protocol. Now let's take a detailed look.

The setup of the protocol is as follows:

Alice wants to send 2-qubit information to Bob, but she can only send a single-qubit due to her possibilities. But how does Bob get a 2-qubit of information from Alice?

This is where Caren comes in. Caren entanglements 2 qubits through Hadamard and CNOT. It sends one of the entangled particles to Alice and the other to Bob. Alice and Bob have no information as they do not measure which particle has come to them.

From here on, Alice will be able to send the qubits she wants to Bob. Let's examine them all in turn.

  • Let Alice wants to send the 00 qubits. In this case, it will use the I gate.
  • Let Alice wants to send the 01 qubits. In this case, it will use the X gate. 

  • Let Alice wants to send the 10 qubits. In this case, it will use the Z gate.             
     
    Let Alice wants to send the 11 qubits. In this case, it will use the iY gate.
     
    As can be seen, Bob finds the qubit information sent by Alice in the measurement results with 100% probability.
     
    Let's focus on the important point above. For this protocol to work correctly, the qubits to be created must be entangled. Otherwise, if they are not entangled, Bob will get different results with different probabilities.

    The entangled states you see above are called Bell States. As I mentioned before, in order to obtain an accurate measurement result with a 100% probability of the quantum superdense coding protocol, it is necessary to start the process with one of the Bell entanglement states.

    I will write about different protocols in my future articles.

    Stay with physics. :)




    Reference

    https://www.youtube.com/watch?v=3wCW4x51Blo&list=PLqNc_xpYGu77u6dI_RijjCLd-nP8p_4pI&index=22
     
     
     
     
     
     
     
     
     
     

Comments

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...

Introduction to Grover's Algorithm

    Another algorithm that has an important place among quantum algorithms is the Grover algorithm. It was developed by the Indian physicist Lov Grover in 1997. I described the Deutsch-Jozsa algorithm algorithm in my previous articles. Although the Deutsch-Jozsa algorithm helps us find the characteristics of the functions and gives us good information about the working principles of the quantum algorithm, it has no application to a real physical problem. Grover's algorithm allows us to solve real physical problems. In this article, I will give information about the working principle of the Grover algorithm and its application as an example. Let's imagine two cities, A and B! Suppose there is more than one way to get from A to B. What we want is to find the shortest path among the existing path options. When we want to solve this problem through a classical algorithm, it will deal with each option one by one with iterations and reach the result. However, Grover's algorithm...

A Study of Quantum Properties of Phonons - A New Kind of Quantum Computing Could Be Possible

  To date, we have quantum computers that are superconducting, ion-trapped, neutral atoms, and photons. However, it seems that a new one will be added among these types. Phonons could be popular for this new quantum computer. Before moving on to this stage, a team led by Prof. Andrew Cleland at the Pritzker School of Molecular Engineering at the University of Chicago conducted two experiments to establish a detailed study of phonons. As is known, quantum mechanics argues that quantum elementary particles are indivisible. For example, photons, the smallest particles of light with which we are more studied and familiar, are examples of these elementary particles. However, little attention has been paid to phonons, another quantum particle that transmits sound, in small packets. The team at the University of Chicago was able to figure out how to first capture single phonons and entangle two phonons, using phonons with a pitch that is about a million times higher than what the human ea...