Shor's Factoring Algorithm and Modular Exponentiation Operators
We provide a pedagogical presentation of Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time. In contrast, all known classical algorithms for the factoring problem take an exponential time to f...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Quanta
2023-09-01
|
| Series: | Quanta |
| Online Access: | https://dankogeorgiev.com/ojs/index.php/quanta/article/view/77 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|