TELKOMNIKA Telecommunication, Computing, Electronics and Control
Web-app realization of Shor’s quantum factoring algorithm and Grover’s quantum search algorithm

TELKOMNIKA Telecommunication, Computing, Electronics and Control
Web-app realization of Shor’s quantum factoring algorithm and Grover’s quantum search algorithm

Grover, Quantum application, Shor, Web-app

Quantum algorithms are well-known for their quadratic if not exponential speedup over their classical counterparts. The two widely-known quantum algorithms are Shor’s quantum factoring algorithm and Grover’s quantum search algorithm. Shor’s quantum factoring algorithm could perform integer factorization in O(logN). Grover’s quantum search algorithm could solve the unsorted search problem in O(√N). However, both algorithms are introduced as theoretical concepts in the original papers due to the limitations of quantum technology at that time. In this paper, an improved way is presented to realize the two algorithms into a web application using state-of-the-art quantum technology. The web-app is designed and built considering the uses of a quantum simulator and libraries provided by ProjectQ and Rigetti Forest. The result shows
that both algorithms are realizable into web-applications.

Arya Wicaksana, Anthony, Adjie Wahyu Wicaksono

DOI: 10.12928/TELKOMNIKA.v18i3.14755

Universitas Ahmad Dahlan

June 2020

Sri Wahyuni

ISSN: 1693-6930

http://journal.uad.ac.id/index.php/TELKOMNIKA

PDF

English

Text

TELKOMNIKA Telecommunication, Computing, Electronics and Control