Skip to main content

Deutsch Algorithm

 

The Deutsch algorithm was discovered by David Deutsch in 1985. The main motivation for this algorithm is the problem of how many steps to determine the characteristic of a given function.

Classical computers, therefore, classical algorithms can determine the character of the given function in at least two steps. Because, as you know, classical computers are made by processing the 0 or 1 bits separately.

However, for the solution to our motivation problem, the characteristic of the function can be found in one step by quantum computers, that is, by quantum algorithms. As a result of measuring our qubits in superposition, as a matter of fact of quantum physics, enables us to reach the desired result in one step.

As David Deutsch said “Computers are physical objects, and computations are physical processes. What computers can or cannot compute is determined by the laws of physics alone. . .”

Let's take a basic look at this easy algorithm.

Let's define a function that maps 0 and 1 to 0 and 1.

 

Let this function have the following characteristics;

It solves the characteristic of the function defined above in at least two steps.

With the quantum algorithm, I wrote below, the characteristic of this function can be solved in one step.

Now let's pass the state vector |ψ2> through the Hadamard operator.

Finally, when we measure the state vector, we find that if we get |0> it is a constant function, and if we get |1> we find that it is a balanced function.





Reference

https://people.vcu.edu/~sgharibian/courses/CMSC491/notes/Lecture%206%20-%20Deutsch%27s%20algorithm.pdf

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

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

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