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

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

Quantum Phase Estimation - Calculating an Eigenvalue

    We continue our series of fundamental and ongoing quantum algorithms. In today's post, we'll look at the eigenvalue calculation that is familiar to anyone in both the basic sciences and engineering. We will consider a slightly different situation, of course, our work is quantum. Let's consider the quantum state of a system! When we make an observation, we obtain real observation values by calculating the eigenvalues and eigenvectors of the state in that system, the mathematical calculation that helps us to have information about the position, momentum, or energy of that system. So, how can we find the eigenvalues of the unitary operators, which act on a system without changing its size, that is, preserve its physical size? To solve this problem, we will examine the Quantum Phase Estimation solution. In order to find the eigenvalues of the unit operator U, we need to find the value of the phase ϕ, which is inside the exponential value. However, it is not that easy. A qua...
Post a Comment
Read more

Shor's Protocol - Example Solution

    Finally, we have come to the famous Shor's definition of the algorithm in this article. Before applying this algorithm, we examined in detail the three mathematical operations required for our algorithm. These three necessary mathematical expressions were modular arithmetics, quantum Fourier transform , and quantum phase estimation . As you may remember, Shor's algorithm is an algorithm that gives prime factor values of large numbers. To show that this protocol works, we will write an algorithm that gives the prime factors of 15. The binary equivalent of the decimal number 15 consists of 1111 qubits. Now let's examine Shor's protocol in detail. If we write it in a regular way, we can write the state vector | ψ 3 > as follows. Now, let's measure the last four qubits. In this case, we would have measured the situations |1>, |2>, |4>, |8> with 25% probability. Suppose we have reached the state |8> with a probability of 25% in our measurement re...
Post a Comment
Read more