Title: How to factor integers on a quantum computer

 Speaker: Luca Candelori (WSU)

Abstract: Quantum computing has recently received a lot of attention thanks to incremental technological advances occurring in the past 5 years, and with more powerful quantum computers quickly becoming available. In this talk we’ll introduce the mathematical foundations of this promising technology, and we will discuss its limitations.  Perhaps the most well-known feature of quantum computers is their ability to factor large composite integers in polynomial time, thanks to Shor’s Algorithm. We will discuss this algorithm in detail, and I will demonstrate a slightly non-standard  implementation of it on an IBM quantum computer that we have worked with past students of Math 6480. The intended audience for this talk is undergraduate students with a background in linear algebra and modular arithmetic. No knowledge of quantum physics required!

Pizza will be servied!