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...
On this platform, you can find developments about quantum computers and quantum algorithms.