BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//RLASKEY//CALENDEROUS//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260824T125041Z
LAST-MODIFIED:20121116T203436Z
DTSTART:20101112T170000Z
DTEND:20101112T180000Z
UID:event728@bu.edu
URL:http://physics.bu.edu/internal/events/show/728
SUMMARY:The efficiency of the quantum adiabatic algorithm
DESCRIPTION:Featuring Peter Young\, UC Santa Cruz\nHosted by: Anders Sandvi
	k\n\nPart of the Biophysics/Condensed Matter Seminar Series.\n\nAbstract:\n
	I will describe results of quantum Monte Carlo simulations for quite large 
	problem sizes which aim to determine how efficiently the quantum adiabatic 
	algorithm (QAA) could solve hard optimization problems on a quantum compute
	r. Results will be presented for a particular "constraint satisfaction prob
	lem". Next\, results from a classical\, heuristic\, algorithm will be prese
	nted for several problems\, and\, in the rest of the talk\, I will discuss 
	the application of the QAA to the hardest of these. Curiously\, although th
	is problem is very hard for standard algorithms\, including the QAA\, it ca
	n solved in polynomial time using a special approach.
LOCATION:SCI 352\, 590 Commonwealth Avenue\, 02215
STATUS:CONFIRMED
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR