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:Computer Laboratory Wednesday Seminars
SUMMARY:Quantum computing -- theoretical prospects and rel
ations to classical computation - Richard Jozsa\,
Centre for Quantum Information and Foundations\, D
AMTP\, University of Cambridge
DTSTART;TZID=Europe/London:20110316T141500
DTEND;TZID=Europe/London:20110316T151500
UID:TALK29286AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/29286
DESCRIPTION:Quantum computing is based on a novel model of com
putation in which the elementary steps are quantum
processes\, in contrast to the familiar Boolean o
perations on bit strings that underlie classical m
odels.\nAs such it is meant to be realistically im
plementable\, and it is known to have dramatic imp
lications for some complexity issues (most famousl
y providing an efficient algorithm for integer fac
torisation).\n\nIn this talk we will introduce the
quantum model in a way that emphasises its comput
ational ingredients\, generalising some familiar c
lassical notions and providing some intuition for
its algorithmic\npossibilities and limitations. Th
en we will consider the question of the relationsh
ip between quantum and classical computing power.
A definitive tool for exploring this issue is the
notion of efficient\nclassical simulation of quant
um computations. We will outline a variety of rece
nt surprising simulation results\, suggesting that
the quantum-classical relationship is richly comp
lex and in fact very little\nunderstood.\n
LOCATION:Lecture Theatre 2\, Computer Laboratory
CONTACT:Stephen Clark
END:VEVENT
END:VCALENDAR