[LUGSB] Next LUGSB Meeting: Quantum Computing

[Matthew Gruen]

Something I realized after the fact.

Why Shor's algorithm didn't work on 27: I forgot, it doesn't work on
powers of primes. Otherwise, the Chinese remainder theorem doesn't
apply, and some important number theoretic properties are lost. One of
the first checks to do is to take square, cube, etc. roots of n to
ensure it isn't a perfect power. 27 is 3**3, and so it always fails.

Also, when justin.tv wasn't acting up, there's a good hour and fifteen
minutes of video of today's meeting at
http://www.justin.tv/lugsb/videos (the "QC" and "Quantum Computing"
videos)

Matt

On Mon, Oct 3, 2011 at 8:55 AM, Matthew Gruen <wikigracenotes at gmail.com> wrote:
> Hello all,
>
> During today's LUGSB meeting, October 3, I'll be talking about some
> basic concepts in quantum computing, a summary of Shor's algorithm,
> and then maybe some discussion on the future of quantum computing. No
> previous knowledge of group theory or Fourier analysis required. Come
> and learn how you can be the future and run quantum algorithms on
> *your* computer! (spoiler: libquantum)
>
> As usual, we will meet at 7:00pm in CS 2311. There will be cookies,
> soda, and (if all goes according to plan) live streaming on
> <http://justin.tv/lugsb>.
>
> See you there,
> Matt
>