BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:bg268's list
SUMMARY:Iterated dynamical maps on a quantum computer - Pr
ofessor Gerard J Milburn\, The University of Queen
sland
DTSTART;TZID=Europe/London:20080116T160000
DTEND;TZID=Europe/London:20080116T170000
UID:TALK10017AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/10017
DESCRIPTION:I will discuss an alternative to simulating Hamilt
onian flows with a quantum computer. A Hamiltonian
system is a continuous time dynamical system repr
esented as a flow of points in phase space. An al
ternative dynamical system\, first introduced by P
oincare\, is defined in terms of an area preservin
g map. The dynamics is not continuous but discrete
and successive dynamical states are labelled by i
ntegers rather than a continuous time variable. D
iscrete unitary maps are naturally adapted to the
quantum computing paradigm. Grover's algorithm\, f
or example\, is an iterated unitary map. In this t
alk I will discuss examples of nonlinear dynamical
maps which are well adapted to simple ion trap qu
antum computers\, including a transverse field Isi
ng map\, a non linear rotor map and a Jahn-Teller
map. I will show how a good understanding of the
quantum phase transitions and entanglement exhibi
ted in these models can be gained by first describ
ing the classical bifurcation structure of fixed p
oints. \n
LOCATION:Centre for Mathematical Sciences\, Wilberforce Roa
d\, Lecture room MR5
CONTACT:Berry Groisman
END:VEVENT
END:VCALENDAR