Tuesday, December 16, 2008, 3:30 pm — Large Seminar Room, Bldg. 510
Imagine a game where two players go back and forth making moves and at the end of a fixed number of moves the position is either a win or a loss for the first player. In this case, if both players play best possible, it is determined at the first move who wins or loses. To
figure out who will be the winner you need not look at all of the N final positions but only at N^0.753. I will show that with a quantum computer the exponent can be reduced to 0.5. The technique involves quantum scattering theory and illustrates how ideas from physics can be used to design quantum algorithms that outperform even best
possible classical algorithms.
Hosted by: Robert Pisarski
4811 | INT/EXT | Events Calendar
Not all computers/devices will add this event to your calendar automatically.
A calendar event file named "calendar.ics" will be placed in your downloads location. Depending on how your device/computer is configured, you may have to locate this file and double click on it to add the event to your calendar.
Event dates, times, and locations are subject to change. Event details will not be updated automatically once you add this event to your own calendar. Check the Lab's Events Calendar to ensure that you have the latest event information.