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

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...
Post a Comment
Read more

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...
Post a Comment
Read more