Papers We Love Meetup- Shor’s Algorithm Part 1

December 17, 2015

About the Talk:

Godel was first to talk about problems that can be solved by a computer, or by any machine. Godel’s incompleteness theorem showed us certain problems cannot be solved by a computer, however powerful it is. It took two other scientists, to further categorize problems that can be solved efficiently on a classical computer. This is captured in the famous “Church-Turing Thesis”, which says every problem with an efficient algorithm can be also done efficiently in a Turing machine. And, at the end of last century we found a new class of computers that actually can solve problems more efficiently than any classical computer, since the new class of computers use Quantum Physics. Quantum physics was one of the biggest leaps in Physics in the last century. All of our cyber security relies on the difficulty of solving a problem called “integer factorization”. No one has yet found an efficient algorithm for solving this on a classical computer. If we do, then we have all of our privacy and security taken away from us. In 1994, Peter M. Shor discovered an algorithm which can efficiently solve integer factorization on a Quantum Computer. This algorithm is now aptly called “Shor’s Algorithm”. Anita from InMobi will be talking about quantum computers, and how Shor’s algorithm works, in a two part series at the “Papers We Love” meetup.

Paper: By Peter M. Shor

Speaker: Anita, Staff Engineer, InMobi

Pre-requisites: Complex Numbers, Vectors.

Good To Know: Fourier Transform, Number Theory.

Bonus: Linear Algebra, Hilbert Spaces, Quantum Mechanics.

You can RSVP to the event here:

Next Meetup->> Papers we love meetup- Shor's Algorithm Part 2

Event Details


InMobi Technologies, 8th Floor (Cafeteria), Delta Block, Embassy Tech Square, Marathahalli-Sarjapur Outer Ring Rd, Bengaluru, Karnataka 560103, India

Google Map

Time & Date

Start: January 02, 2016 at 2:00 PM IST
End: January 02, 2016 at 5:00 PM IST