Complete conquest of prime factorization algorithm

Factorization algorithm , implement it with Python code!

Factorization, how much have you learned? 📝

This lecture starts with a simple primality detection algorithm.
Algorithm for finding prime numbers using the Sieve of Eratosthenes
We will implement Shor's quantum algorithm for factoring numbers using Python code.

Factorization, is it possible in polynomial time? ✒️

The RSA encryption system, which is widely used in e-commerce, etc.
It takes advantage of the fact that it is difficult to factorize a composite number that is the product of two very large prime numbers.
In general, prime factorization has exponential time complexity that is difficult to solve in polynomial time.
It is said that Shor's algorithm can be solved in polynomial time using a quantum computer.
This lecture proceeds to the stage of factoring 15 by implementing a quantum circuit of Shor's algorithm.

Features of this course 💡

This lecture focuses on implementation and practice using Python coding.
From simple primality detection algorithms to quantum circuit implementations
Everyone is explaining with a focus on executable Python coding.
Anyone who knows Python can follow along and practice.
If you study while practicing coding directly, from middle and high school students to graduate students,
Anyone who understands prime factorization can study it with enjoyment.

View other lectures 📺

Corinna, let's code! with Python
Learning coding for the first time, easy and fun with Python.

Learning Algorithm Basics with Python
Lower the barrier to learning algorithms with Python coding!