Deutsch–Jozsa Algorithm

In our previous article, I mentioned the Deutsch algorithm, which is the first of the quantum algorithms. In this article, I will talk about the Deutsch-Jozsa algorithm.

In fact, if you look at it, this algorithm is an extended version of the Deutsch algorithm. Extended means an algorithm that can be applied to n functions.

It is almost the same in formulation, only revised according to n functions.

Let's examine it in more detail!

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

We will also ask the question that we have emphasized in the Deutsch algorithm and which constitutes the main problem of this algorithm.

In how many steps can we determine the characteristic of our function f in the example above?

When we consider this problem in the classical algorithm, it will determine

2ⁿ/2 +1 steps for an n-dimensional function.

We're going to do some math for |ψ₃> .

When we make a measurement after this process if all of them are 0 as a result, our f function is fixed, but if we get 1 from the measurement results, we can say that our f function is in balance.

Reference

https://www.youtube.com/watch?v=MZD3gYBg0_c&list=PLqNc_xpYGu775P7iJA7Kvfxmv_Fm9wwHj&index=3

Comments

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

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

Let's Define Quantum Programming

Along with the strange discoveries of quantum physics, one of these ideas for how we could use it is quantum computers. Work on quantum computers, which is a pretty good idea, started small and became what it is today. Now we had to take one more step and do quantum programming. The first studies on this process were made in the early 2000s. However, these studies were more theoretical. This was because quantum computers were not yet technologically ready. Finally, with the serious development of quantum computers (of course, we are still not at the desired point) we started to create our quantum algorithms. Today, we can do these algorithms on IBM Quantum Experience, Microsoft Azure Quantum, DWave Leap Cloud, or with quantum development kits. With these platforms, most of which are open source, we can create our quantum algorithms with the Python language, which we use classically and which is the most common programming language. The fact that such platforms are open sou...

Era Quantic | Quantum Computing and Information Articles

Search This Blog