- Tytuł:
- Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
- Autorzy:
-
Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha - Powiązania:
- https://bibliotekanauki.pl/articles/1070857.pdf
- Data publikacji:
- 2019
- Wydawca:
- Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
- Tematy:
-
Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm - Opis:
- In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
- Źródło:
-
World Scientific News; 2019, 123; 102-113
2392-2192 - Pojawia się w:
- World Scientific News
- Dostawca treści:
- Biblioteka Nauki
Artykuł