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

Labels:

Comments

Post a Comment

Popular posts from this blog

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

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

Let's Define Quantum Programming

    Along with the strange discoveries of quantum physics, one of these ideas for how we could use it is quantum computers. Work on quantum computers, which is a pretty good idea, started small and became what it is today. Now we had to take one more step and do quantum programming. The first studies on this process were made in the early 2000s. However, these studies were more theoretical. This was because quantum computers were not yet technologically ready. Finally, with the serious development of quantum computers (of course, we are still not at the desired point) we started to create our quantum algorithms. Today, we can do these algorithms on IBM Quantum Experience, Microsoft Azure Quantum, DWave Leap Cloud, or with quantum development kits. With these platforms, most of which are open source, we can create our quantum algorithms with the Python language, which we use classically and which is the most common programming language. The fact that such platforms are open sou...
2 comments
Read more