Skip to main content

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

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


We're going to do some math for 3> .

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

Popular posts from this blog

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 source is al

Quantum Memories in Free Space

     In quantum technologies, the important point is to be able to transmit the information-carrying quantum bits (qubits) from the transmitter to the receiver without loss or damage. This is one of the main purposes. For this, physicists are developing quantum memories that allow us to store information-loaded photons for certain periods of time to be transmitted at any time. Quantum memories are essential components for applications such as quantum information processing, quantum networks, and quantum repeaters. There are quantum devices developed by various methods in order not to lose photons or disrupt their function during the storage process of qubits. In today's article, I will talk about an alternative approach besides the material quantum memories produced. Scientists from the University of Illinois Urbana-Champaign, Truman State University, and RightHand Robotics, Inc. have succeeded in producing a quantum memory in free space. Before describing quantum memories operatin

Density Matrix - Alternative to State Vector

    As you know, in quantum mechanics we operate with state vectors. However, it is very convenient to use the alternative notation to solve some problems. This alternative representation is expressed by the density matrix. A density matrix does not violate quantum postulates like state vectors and even postulates have equivalents just like state vectors. It is represented by the density matrix or density operator rho (ρ). The mathematical representation is as follows:, Let's take the density matrix as an example: As you can see, the density matrix is very practical and very easy to calculate. In particular, it is a pretty good alternative for computations in quantum mechanical systems that make up multiple qubits. You may have noticed another similarity right away. Yes, the trace of the density matrix is equal to 1. This means that we know that the state vector must be normalized. It means the same with the sum of all probabilities is equal to 1.