Quantum computers and cryptography

The thesis explores the abstract concept of quantum computing and simulates its appli- cation across various fields, specifically in encryption and machine learning. The aim of the thesis is to map the current state of cryptographic systems and assess their resilience in a post-quantum world. This analysis also includes an evaluation of new systems that could potentially replace the existing ones The practical part of the thesis focuses on two main experiments. The first involves comparing the efficiency of Shor’s algorithm and the quantum version of the quadratic sieve in the context of RSA decryption, using simulated quantum circuits. The second experiment applies the newly formulated concept of quantum random forests, training models on selected datasets with the goal of contributing to the description of the properties of this emerging approach.