BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Michael Mc Gettrick (University of Galway)
DTSTART:20260928T100000Z
DTEND:20260928T110000Z
DTSTAMP:20261006T143521Z
UID:M4CSA/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/M4CSA/12/">Q
 uantum walks on graphs</a>\nby Michael Mc Gettrick (University of Galway) 
 as part of Mathematics for Computer Science and Applications Seminar\n\nLe
 cture held in room 1/15\, 'Działownia' building\, Cracow University of Te
 chnology.\n\nAbstract\nQuantum walks have been defined and analyzed for ab
 out three decades\, since the work of Ambainis\, Kempe\, Aharonov\, etc. I
 nterest in this model peaked when they were not only shown to be useful in
  quantum algorithms\, but also to be universal for quantum computation (Ch
 ilds\, 2009\, Lovett et al.\, 2010). Besides being useful in Quantum Compu
 ter Science\, they are objects deserving mathematical attention in their o
 wn right.\n\nIn my talk I will introduce necessary concepts and notation (
 from Physics) as needed\, starting with the simple one-dimensional “Hada
 mard” walk. I will cover two classes of walks in detail: (1) alternating
  walks and (2) walks with memory (or history). In each case I will point o
 ut properties of interest - asymptotic probability distribution\, localiza
 tion\, dependencies on the initial state and the Unitary matrix we use for
  “coin flip”\, similarities and dissimilarities with corresponding cla
 ssical random walks\, etc. In the case of (1) I will show how we can use f
 ewer physical resources to walk in higher dimensional lattices\, while in 
 (2) I will show how this leads to walking on the line graph of the origina
 l graph.\n\nOn-site: room 1/15\, 'Działownia' building\, Cracow Universit
 y of Technology\nOnline: https://zoom.us/j/94141684360?pwd=PUvxIDr0laMi87Y
 6kcCEWHnIRRM511.1\n
LOCATION:https://researchseminars.org/talk/M4CSA/12/
END:VEVENT
END:VCALENDAR