BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Exploiting randomness in quantum algorithms - Earl Campbell (Sheff
 ield/Riverlane)
DTSTART:20251125T130000Z
DTEND:20251125T140000Z
UID:TALK237712@talks.cam.ac.uk
CONTACT:Tom Gur
DESCRIPTION:I will give an overview of one of my long-standing research st
 rands on how to exploit randomness in the design of quantum compilers and 
 algorithms.  This will include the general idea of mixing different unitar
 ies to obtain a quadratic reduction in compilation errors without any incr
 ease in average gate count.  I will then review work by myself and other g
 roups on incorporating randomization into Trotterisation approaches to Ham
 iltonian simulation and phase estimation\, including the qDrift algorithm.
   Lastly\, I will describe more recent work on mitigated magic dilution fo
 r non-Clifford logic\, where we showed how randomisation can enable us to 
 dilute high magic gates (like the T gate) to achieve a larger number of lo
 w magic gates (such as small angle rotations) while also mitigating errors
 .  The approach of mitigated magic dilution is benchmarked against the Hub
 bard model\, where we see evidence that it is orders of magnitude more res
 ource-efficient in the early error-corrected setting where algorithms are 
 of low depth.
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR