Implementation of Shor's Algorithm and Reliability of Quantum Computing Devices
Επιτομή
The process to find the prime factors of a large number, the "factoring problem"is believed to be a very hard problem. For this reason, it is the cornerstone of modern cryptographic schemes, like RSA cryptosystem. In 1994, Professor Peter Shor proposed a new polynomial-time quantum algorithm that finds the prime factors of a number with many digits. This was a bolt from the blue for the security of transactions and electronic communications and became an example of how quantum computing changes our perception of security and safety. In this paper Shor's Algorithm is presented and an implementation, a way to factor number 21 is described. In addition, some reliability issues of quantum devices were considered in order to explore the potentiality of Shor's algorithm. © 2021 ACM.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Application of efficient nanoparticles for early diagnosis and treatment of cancer
Alexiou A., Vairaktarakis C., Tsiamis V., Ashraf G.M. (2015)Cancer is considered as a prevalent cause of human deaths and undoubtedly, is the most complex disease with multiple cellular physiological systems involved. During the last decade, the application of nanotechnological ... -
Quantum cryptography in maritime telecommunications
Papathanasaki M., Fountas P., Maglaras L., Douligeris C., Ferrag M.A. (2021)This article is about quantum cryptography in Maritime Telecommunications. Cryptography is necessary for the security of online communications, transportations, medicine, and other significant fields. This new research ... -
Experiments with IBM quantum devices for random number generation and string matching
Savvas I.K., Chernov A.V., Butakova M.A. (2020)Quantum physics is old and mature. Quantum computing and algorithms arose 3 decades ago. Quantum programming on real Quantum Computational Devices (QCD) is something new. Less than the last five years, researchers and ...