Modular exponentiation quantum algorithm

Modular exponentiation is the problem of computing the value X^Y mod N for given positive integers X, Y and N. Modular exponentiation is a central subroutine of Shor’s period finding algorithm, which by its turn is used for integer factorization. In this project, we implemented a quantum circuit for modular exponentiation from scratch. The implementation was done using qiskit.