• What we'll do
PWL Mini: FLP impossibility result: https://homes.cs.washington.edu/~arvind/cs425/doc/fischer.pdf. Presented by Vaidhy!
The main event: Casey presents "A fast quantum mechanical algorithm for database search."
"Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of 1/2, any classical algorithm (whether deterministic or probabilistic) will need to look at a minimum of N/2 names. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) steps. The algorithm is within a small constant factor of the fastest possible quantum mechanical algorithm."
Big ups to Comcast Technology Solutions (https://www.comcasttechnologysolutions.com) for hosting this month!
• What to bring
• Important to know
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!