Simulazione in tensor network dell'algoritmo di Shor per la fattorizzazione in numeri primi

This thesis explores the implementation and simulation of a scalable version of Shor’s algorithm for prime factorization. An acknowledged bottleneck in this algorithm lies in the modular exponentiation process. To address this challenge, we propose a design for the quantum circuit based on the model developed by Vedral, Barenco, and Ekert. The computational engine employed for simulations is a classical tensor network quantum emulator (Quantum Matcha Tea) which uses the matrix product states (MPS) ansatz for the the wavefunction. The main achievement of this study is the successful execution of Shor’s quantum circuits with over 100 qubits, showcasing both the emulator’s proficiency in handling substantial computational complexities and the correct crafting of the quantum circuit.