Skip to main content

Advantage of Quantum Supremacy

 

I would like to address a concept that some private companies that manufacture quantum computers recently announced as a last-minute. This concept is quantum supremacy or quantum advantage.

As you know, it is the best highly anticipated performance speed from quantum computers. While classical computers deal with a problem that takes a long time to solve, it is predicted that quantum computers can complete the same problem in a reasonable time. This advantage of quantum computers is called "quantum supremacy".

While talking about quantum superiority, some authors state that a quantum computer solves the problem it handles by performing a parallel computation, that is, by breaking it down into parts, as a classical computer does.

However, this is a wrong interpretation. The source of quantum supremacy is the superposition state or entanglement. As I mentioned in previous articles, quantum particles contain all possibilities at the same time, meaning that the problem contains all possible solutions. Then, as a result of measurements made by using appropriate algorithms, that is, by collapsing the wave function, it offers us the solution that can be reached as soon as possible.

As in classical physics, special algorithms are developed for quantum computers in order to treat the problem as a whole at once and reduce it to a single result in all possibilities. Among the algorithms still under development are, Deutsch–Jozsa algorithm, Grover algorithm, and Shor algorithm, which are among the best-known algorithms today. 

The task of these algorithms is either to determine the characteristic of a given function or to find certain data in irregular data sets. We do not yet have algorithms developed for problems in concrete physics, chemistry, or any engineering fields.

In my future articles, I will give a detailed explanation of the algorithms I mentioned above.

Stay with physics. :)


 

 

Reference

https://physicsworld.com/a/is-googles-quantum-supremacy-not-so-supreme-after-all/

https://qiskit.org/textbook/ch-algorithms/grover.html

Richard P. Feynman, “Simulating physics with computers”. Int J Theor Phys 21, 467–488 (1982).


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

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