Grover's Quantum Search Algorithm by Stuart Read '19, Mathematics Colloquium, Wednesday, November 28
Wed, November 28th, 2018
1:00 pm - 1:45 pm
- This event has passed.
Grover’s Quantum Search Algorithm by Stuart Read ’19, Mathematics Colloquium, Wednesday, November 28, 1 – 1:45 pm, Stetson Court Classroom 101
Abstract: Given a list of N objects, a classical computer requires an average of ~N/2 operations to find the location of the object that meets a specified criteria. We will compare the different ways in which classical and quantum computers store information, and show that a quantum computer only requires an average of ~N^(1/2) operations to perform the same task. Time permitting, we will discuss the implications of this computational speed-up.
Event/Announcement Navigation
- « MIDWEEKMUSIC
- P-Values and Scientific Reproducibility: What’s all the Fuss? by Prof. Richard De Veaux, Wednesday, November 28, 2018, 1:10-1:50 pm »
Megamenu Social