Skip to main content

Quantum Network

 

With the discovery and development of quantum mechanics, the first quantum revolution has been implemented quickly over time. In the first quantum revolution, we can give examples of technologies such as superconducting and laser that we are mostly familiar with now.

However, II. The quantum revolution has also begun to be developed rapidly. II. The fields that make up the quantum revolution are quantum computers and information. In my previous articles, I mentioned quantum quantum computers, teleportation, and cryptology as a start. Today's article will be about the quantum internet.

The quantum internet uses the principles of superposition and entanglement, which, like quantum computers, involve strange properties of the quantum. The underlying logic is the same as the entangled qubits that underpin quantum computers. It is aimed to convey the information in this way by transmitting the entangled qubits that form it between the quantum devices.

Do not think that we can use the quantum internet as casually as the classical internet on a daily basis. Because, as you know, after creating quantum entangled states, transmitting them to very long distances without deteriorating the states and losing efficiency is a very difficult problem in terms of engineering. External factors such as temperature and pressure are the main sources of these problems. Since even fiber optic cables to transmit entangled photons difficult for the quantum internet to reach the desired point, China launched a quantum internet satellite into space in recent years and brought a new approach to studies in this area. It seems that we will not be able to use the quantum internet like the classical internet in the very near future. Of course, rapid scientific developments can reverse this situation.

So what advantages can it offer us with the development of the quantum internet?

For example, the GPS devices we use all the time will become more precise, detailed mapping of the Earth's gravitational field, higher resolution simulations thanks to the quantum internet running on quantum computers, and thus simulating complex probes such as molecules and proteins or in all fields of science and engineering can be provided.




Reference

J. Yin, et al. (2017). Satellite-Based Entanglement Distribution Over 1200 Kilometers. Science, sf: 1140-1144. doi: 10.1126/science.aan3211


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

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

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