@monkeydboaAIML Computational Science Specialist, Accenture Private Limited, Ex Wipro Private Limited, Ex Mercedes Benz, Ex Ericsson
I open-sourced Shor's algorithm running on a 32-core NVIDIA laptop
I have completed building a Shor's Algorithm. I have made it open source. And made it worked on nvidia laptop using 32 cores.
Here's the link:-
pypi.org/project/my-shor-package/
What is working is that i tested on pow(10,100) all kinds of digits whether it is prime, composite, neither. And the package is working.
Here is the link to actual code:-
github.com/prakHr/ShorAlgorithm
One thing I need from you fellow developers test it on higher number of core processors.
Introductions
Comments1
Testing on numbers up to 10^100 is a bold claim for a classical simulation of Shor's, since the quantum speedup disappears there. Is the 32-core scaling coming from the modular exponentiation or the period finding step, and how are you handling the state vector memory growth?
1 comment
Testing on numbers up to 10^100 is a bold claim for a classical simulation of Shor's, since the quantum speedup disappears there. Is the 32-core scaling coming from the modular exponentiation or the period finding step, and how are you handling the state vector memory growth?