Skip to main content

First Look At The Quantum Fourier Transform


 One of the important approaches to solving a problem is choosing the right space dimension. As you can imagine, we cannot solve every problem in the space that we want.

However, one of the fascinating things about mathematics is that it allows us to switch between spaces. This mathematical expression, which we know as the Fourier Transform, allows us to solve a problem in another space if we cannot solve it in the space we want, and to return to the space we want with the Inverse Fourier Transform.


 The Fourier Transform is a method that has physical real applications, not just abstract mathematics. For example, the Fourier Transform, which converts a signal in the time domain to the frequency domain, has applications in vibration analysis, image processing, sound engineering, etc.

On the other hand, if our problem takes discrete values, then what we need to apply is the Discrete Fourier Transform. Our famous space, Hilbert space, which is likely to come to your mind when you say discrete, may come to mind. Bingo! It is very possible to apply the Discrete Fourier Transform in the quantum world as well. So we now have a Quantum Fourier Transform method.

So what does the Quantum Fourier Transform do?

As you know, calculations in the quantum world are made on the basis of sets of 0 and 1. These are the situations that provide the transformation from computational bases to Fourier bases thanks to the Quantum Fourier Transform.


 I will not go into the mathematical expression in this article, but in my next article, I will go into depth on this subject. Because, thanks to this method, which has an important place in quantum calculations, it forms one of the foundations of Shor's algorithm, which is its real application.

Stay curious :)




References

https://news.mit.edu/2012/faster-fourier-transforms-0118

https://ckk.com.tr/ders/signalssystems/SS%2060%20Fourier%20Transforms.pdf

https://deepai.org/machine-learning-glossary-and-terms/fourier-transform

 

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

Quantum Phase Estimation - Calculating an Eigenvalue

    We continue our series of fundamental and ongoing quantum algorithms. In today's post, we'll look at the eigenvalue calculation that is familiar to anyone in both the basic sciences and engineering. We will consider a slightly different situation, of course, our work is quantum. Let's consider the quantum state of a system! When we make an observation, we obtain real observation values by calculating the eigenvalues and eigenvectors of the state in that system, the mathematical calculation that helps us to have information about the position, momentum, or energy of that system. So, how can we find the eigenvalues of the unitary operators, which act on a system without changing its size, that is, preserve its physical size? To solve this problem, we will examine the Quantum Phase Estimation solution. In order to find the eigenvalues of the unit operator U, we need to find the value of the phase ϕ, which is inside the exponential value. However, it is not that easy. A qua...
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