Turkish Journal of Mathematics and Computer Science

Turkish Journal of Mathematics and Computer Science

Fundamental Structure of Shor's Quantum Algorithm for Factoring Integers

Yazarlar: Turgut HANOYMAK, Akram CHEHRAZİ

Cilt 11 , Sayı 2 , 2019 , Sayfalar 78 - 83

Konular:Matematik

Anahtar Kelimeler:Factorization,Measurement,Superposition Principle,Qubit

Özet: One of the most well known mathematically hard problems in number theory is the integer factorization problem, roughly stated that decomposition of a composite number into its prime factors. In modern cryptography, RSA encryption algorithm whose security is based on integer factorization problem is highly practical, widespread and up to date no classical algorithm having polynomial running time for the factorization of large numbers is known. In 1994, Peter Shor proposed an efficient algorithm on quantum computer. In this paper, we  mention about the fundamentals of  Shor's quantum algorithm illustrating a concrete example.

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2019, title={Fundamental Structure of Shor’s Quantum Algorithm for Factoring Integers}, volume={11}, number={2}, publisher={Turkish Journal of Mathematics and Computer Science}, author={Turgut HANOYMAK,Akram CHEHRAZİ}, year={2019}, pages={78–83} }
APA
KOPYALA
Turgut HANOYMAK,Akram CHEHRAZİ. (2019). Fundamental Structure of Shor’s Quantum Algorithm for Factoring Integers (Vol. 11, pp. 78–83). Vol. 11, pp. 78–83. Turkish Journal of Mathematics and Computer Science.
MLA
KOPYALA
Turgut HANOYMAK,Akram CHEHRAZİ. Fundamental Structure of Shor’s Quantum Algorithm for Factoring Integers. no. 2, Turkish Journal of Mathematics and Computer Science, 2019, pp. 78–83.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri