• What we'll do
Main Event: Polynomial-Time Algorithms for Prime Factorization
and Discrete Logarithms on a Quantum Computer - Daniel Muldrew
"A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored."
• Important to know
Big ups to Glympse for hosting this month!
As a chapter of Papers We Love we abide by and enforce the PWL Code of Conduct (https://github.com/papers-we-love/seattle/blob/master/code-of-conduct.md) at our events. Please give it a read, plan on acting like an adult, and involve one of the organizers if you need help.
Stop slacking and join us in the #seattle channel at https://papersweloveslack.herokuapp.com!
If you have a paper you'd like to present, or even just a mini, please hit up one of the organizers :) We're always looking for more presenters.