Wicaksono, Adjie Wahyu and Wicaksana, Arya (2019) Implementation of Shor’s Quantum Factoring Algorithm using ProjectQ Framework. International Journal of Engineering and Advanced Technology (IJEAT), 8 (653). ISSN 2249 – 8958
Full text not available from this repository.Abstract
Prime number factorization is a problem in computer science where the solution to that problem takes super-polynomial time classically. Shor’s quantum factoring algorithm is able to solve the problem in polynomial time by harnessing the power of quantum computing. The implementation of the quantum algorithm itself is not detailed by Shor in his paper. In this paper, an approach and experiment to implement Shor’s quantum factoring algorithm are proposed. The implementation is done using Python and a quantum computer simulator from ProjectQ. The testing and evaluation are completed in two computers with different hardware specifications. User time of the implementation is measured in comparison with other quantum computer simulators: ProjectQ and Quantum Computing Playground. This comparison was done to show the performance of Shor’s algorithm when simulated using different hardware. There is a 33% improvement in the execution time (user time) between the two computers with the accuracy of prime factorization in this implementation is inversely proportional to the number of qubits used. Further improvements upon the program that has been developed for this paper is its accuracy in terms of finding the factors of a number and the number of qubits used, as previously mentioned.
| Item Type: | Article |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 14 Oct 2021 08:22 |
| Last Modified: | 14 Oct 2021 08:22 |
| URI: | https://kc.umn.ac.id/id/eprint/18775 |
Actions (login required)
 |
View Item |
