Skip to main content

The Entropy of Entanglement - Measure of Information

 

 

Entropy is one of the most important concepts in physics. In my previous articles, I focused on what entropy is and its relationship with time. As you will remember, entropy is a measure of disorder and is in the positive direction of increase.

In this article, I will explain the expression of entropy on quantum computers and its relationship with quantum information in its broadest form. In the last part, we will learn what another important concept, entanglement entropy, means to us.

Let's consider a system. The more information we have about this system, the lower the entropy. The opposite is also true. That is, the less information we have about this system, the higher the value of entropy. So entropy is a measure of our ignorance about a system.

First, let's define this definition in a classical mathematical way. Next, let's write the equivalent in quantum mechanics.

Let's consider two sets A and B. Suppose that sets A and B contain one bit of information. Let these bits have N configurations for set A and n configurations for set B. In this case, we can write down the probabilities of finding the bits in the sets A and B.

If set B gets smaller, the entropy decreases because the information will be constrained.

Let's look at limit situations.  
  • If we have all the information about our system, then the entropy is zero.        

  • If we don't know anything about our system then the entropy will be maximum.  


 If we generalize this to classical bits;

Of course, if our information is such that it gives a distribution, then we need to have an entropy equation on probability. This is expressed as follows.

The minus sign in the equation is written to make the entropy positive in case the probabilities less than 1 turn out to be negative.

So, we can write the information as:

Information = Smax -S
 
 
 
So far, I have described entropy classically. Now let's look at how we can relate information to entropy in quantum mechanics.

The logic is similar to the classical expression. However, in quantum mechanics, we formulate and use the density matrix.

Suppose a state vector is of probability Pi. However, let's write the entropy expression in quantum mechanics.

Now that we have written the entropy expression in quantum mechanics, let's examine some limit states.
 
  • Let a system be prepared in a pure state. So let's 100% know in which configuration it is prepared. In this case, our entropy in this system would be zero. Because we already have all the knowledge.
  • Another limit situation is as follows. You get prepared for different situations with equal probabilities. In this case, the entropy of our system becomes maximum. 

Let's evaluate this through an example. Let's look at the entanglement below. 

The entropy of this entangled state is zero. Because we know 100% that our state vector is prepared in this way.

However, since the subsystems that make up our entangled system are prepared with equal probabilities, their entropy becomes maximum.

In summary, in entanglement entropy, the entropy of the whole of the system is zero, but the entropies of the subsystems that make it up are at their maximum value.




Reference

https://www.youtube.com/watch?v=TGrK3oDOq1k

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

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