What we did
We adapted and refined Beauregard's implementation of Shor's algorithm that used only 2n + 3 qubits.
Challenges we ran into
Before we found Beauregard, we were running into trouble with implementing a universal modular exponentiation that was core to Shor's factoring algorithm. We tried to implement Vedral, Barenco and Ekert's modular exponentiator algorithm to no success, in particular, we ran into issues with implementing a proper modular addition.
Accomplishments that we're proud of
We are really proud that we were able to come up with a working implementation of a universal Shor's algorithm (thanks Henry!). Furthermore, we found that we learnt a lot about quantum algorithms through this hackathon and are excited for the future.
What we learned
Aside from Shor's algorithm, we also gained a better understanding of how quantum circuits works.
What's next for Semiprime Factorization with 2n+3 Qubits
We might try to use a different non-QFT-based adder to see if it performs better on simulated benchmarks
Built With
- qiskit
- quantumrings
Log in or sign up for Devpost to join the conversation.