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:CQIF Seminar
SUMMARY:Different permutations are almost orthogonal - Ara
m Harrow (University of Washington)
DTSTART;TZID=Europe/London:20120713T120000
DTEND;TZID=Europe/London:20120713T130000
UID:TALK38974AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/38974
DESCRIPTION:Consider the n! different unitaries that permute n
d-dimensional quantum systems. If d>=n\, then the
se are linearly independent. In this talk\, I'll e
xplain a sense in which they are approximately ort
hogonal\nif d >> n^2. This simple fact turns out t
o make life much easier when working with multipar
tite quantum states that are invariant under colle
ctive unitary rotation. After describing the basic
idea\, I'll discuss some subset of the following
five applications:\n\n1. There is no efficient pro
duct test (in the sense of my previous work with A
shley Montanaro) that uses only LOCC measurements
between the different copies of the state to be te
sted.\n\n2. Random maximally entangled states have
similar moments to fully random states.\n\n3. Ran
dom quantum circuits on n qubits with poly(n) gate
s are approximate poly(n)-designs. (Joint work wit
h Fernando Brandao and Michal Horodecki).\n\n4. An
alternate proof of the Hastings result that rando
m unitaries give quantum expanders.\n\n5. The N-pa
rty data-hiding scheme of Eggeling and Werner can
be achieved with only poly(N) local dimension.
LOCATION:MR14\, Centre for Mathematical Sciences
CONTACT:Richard Jozsa
END:VEVENT
END:VCALENDAR