Shor's Algoritme
Shor's algoritme er en kvantealgoritme, der kører i polynomiel tid og kan faktorisere store heltal samt beregne diskrete logaritmer, problemer som formodes at være intractable på klassiske computere. Algoritmen blev opdaget af Peter Shor i 1994 og demonstrerede kvantecomputeres potentiale til at bryde udbredte kryptografiske systemer som RSA, hvilket markerede en milepæl i kvanteberegningsteori.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. DOI: 10.1109/SFCS.1994.365700 ↗
- Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41, 303–332. DOI: 10.1137/S0036144598347011 ↗
- Ekert, A. K., Raussendorf, R. (2014). A short introduction to quantum computing. Reviews of Modern Physics, 74, 339–373. link ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Shor's Algorithm for Integer Factorization and Discrete Logarithm. ScholarGate. https://scholargate.app/da/quantum-computing/shors-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Grover's AlgoritmeKvanteberegning↔ compare
- Kvantenøgledistribution (BB84)Kvanteberegning↔ compare
- KvantefaseestimeringKvanteberegning↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →