BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//RLASKEY//CALENDEROUS//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260912T132351Z
LAST-MODIFIED:20160930T192131Z
DTSTART:20160919T173000Z
DTEND:20160919T183000Z
UID:event1633@bu.edu
URL:http://physics.bu.edu/internal/events/show/1633
SUMMARY:Solving Classical Computational Problems by Annealing a Planar Quan
	tum Vertex Model
DESCRIPTION:Featuring Zhicheng Yang\n\nPart of the Preliminary Oral Exam.\n
	\nDissertation Committee:  Claudio Chamon\, Andrei Ruckenstein\, Anatoli Po
	lkovnikov\, Ami Katz\, Michael El-Batanouny \n\nAbstract:  We construct a p
	lanar vertex model that encodes the result of a\nuniversal reversible class
	ical computation in its ground state. The\napproach involves Boolean variab
	les (spins) placed on links of a\ntwo-dimensional lattice\, with vertices r
	epresenting logic gates. Large\nshort-ranged interactions between at most t
	wo spins implement the\noperation of each gate. The lattice is anisotropic 
	with one direction\ncorresponding to ``computational'' time\, and with tran
	sverse\nboundaries storing the computation's input and output. While we sho
	w\nthat the model displays no finite temperature phase transitions\,\nindep
	endent of circuit\, the computational complexity is encoded in the\nscaling
	 of the relaxation rate into the ground state with the system\nsize. To exp
	lore faster relaxation routes\, we construct an explicit\nmapping of the ve
	rtex model into the Chimera architecture of the\nD-Wave machine\, initiatin
	g a novel approach to reversible classical\ncomputation based on state-of-t
	he-art implementations of quantum\nannealing.\n\n![Yang](/resources/event-i
	mage/1633/ed0cdd4_small)
LOCATION:SCI 328\, 590 Commonwealth Avenue\, 02215
STATUS:CONFIRMED
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR