BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Quantum Complexity of Computing Schatten p-norms - Chris Cade\
 , University of Bristol
DTSTART:20171109T141500Z
DTEND:20171109T151500Z
UID:TALK89361@talks.cam.ac.uk
CONTACT:Steve Brierley
DESCRIPTION:In this talk I will present some results on the quantum comple
 xity of computing Schatten p-norms and related quantities. We find that th
 e problem of estimating these quantities is closely related to the one cle
 an qubit model of computation. We show that the problem of approximating T
 r(|A|^p) for a log-local n-qubit Hamiltonian A and p=poly(n)\, up to a sui
 table level of accuracy\, is contained in DQC1\; and that approximating th
 is quantity up to a somewhat higher level of accuracy is DQC1-hard. In som
 e cases the level of accuracy achieved by the quantum algorithm is substan
 tially better than a natural classical algorithm for the problem.
LOCATION:MR5\, Centre for Mathematical Sciences\, Wilberforce Road\, Cambr
 idge
END:VEVENT
END:VCALENDAR