@misc{Sobhani2024, type = {Master Thesis}, author = {Sobhani, Mona}, title = {Investigating the potential of a hybrid quantum-classical approach for prime factorization}, doi = {10.26127/BTUOpen-6814}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-68144}, school = {BTU Cottbus - Senftenberg}, year = {2024}, abstract = {The RSA algorithm is a fundamental component of secure communication, relying on the computational complexity of factoring large integers into primes. However, Shor's algorithm proposes that quantum computers could theoretically find these prime factors with exponential speedup, even for large integers. Despite this potential, current quantum computers are not yet capable of breaking RSA. Today's Noisy Intermediate-Scale Quantum (NISQ) devices, which are accessible for experimentation through IBM's cloud-based platform, enable researchers to test algorithms and investigate the potential quantum advantage given the existing capabilities of quantum computers. This thesis explores a hybrid quantum-classical approach that uses quantum computing for the computationally expensive parts of the problem and a classical optimizer. This study employed IBM's quantum simulator and real quantum computer to evaluate the effectiveness of the approach. The quantum simulator successfully factorized the number 1048561, while the real quantum computer factorized the number 253.}, subject = {Quantum computing; Hybrid quantum-classical approach; Prime factorization; RSA; Variational Quantum Eigensolver; Quantencomputing; Primenfaktorisierung; Hybrider quantum-klassischer Ansatz; RSA-Verschl{\"u}sselung; Primzahlzerlegung; Quantencomputer; Simulation}, language = {en} }