Integer factorization is a problem where there is a very fast classical algorithm for multiplying two large numbers together, but finding the original factors is much more difficult because the search space of possible factors is so large, and there is no efficient classical algorithm for finding the factors of large numbers.
factualpending
Speaker
Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]Evidence Quote
“If you have two large numbers and you multiply them together there is a very fast, efficient, classical algorithm for finding the answer. However, if you start with the answer and ask, what are the original numbers that multiply together to make this number? It is a lot more difficult.”
Created: 8/10/2026, 10:45:18 PM
Your notes
Loading notes...