Basically, Shor's algorithm for DLP (1994). I can explain how that works pretty well.
Edit basically if you take half of the possible solutions and have an oracle to tell you if the solution is in there with above(/below) 50% chance, one can classically solve the DLP. Well, an idea for an oracle is in a paper below.
We will need to implement the ideas from the papers below. We need to implement shor for DLP and the necessary gates.
Basically, Shor's algorithm for DLP (1994). I can explain how that works pretty well.
Edit basically if you take half of the possible solutions and have an oracle to tell you if the solution is in there with above(/below) 50% chance, one can classically solve the DLP. Well, an idea for an oracle is in a paper below.
We will need to implement the ideas from the papers below. We need to implement shor for DLP and the necessary gates.
Papers
https://scholar.google.com/scholar?cluster=11275231808084287077&hl=en&as_sdt=2005&sciodt=0,5
And
https://pdfs.semanticscholar.org/ea2f/e564f243c3f1da92b03c4095ccae912116b9.pdf
Description
Members
@slackhandleemail:example@example.comDeliverable
GitHub repo