BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Low-Overhead Parallelisation of Linear Combination of Unitaries - 
 Gregory Boyd (University of Oxford)
DTSTART:20240613T110000Z
DTEND:20240613T130000Z
UID:TALK223357@talks.cam.ac.uk
CONTACT:Lila Cadi Tazi
DESCRIPTION:The Linear Combination of Unitaries (LCU) method is a powerful
  scheme for the block encoding of operators but suffers from high overhead
 s. In this work\, we discuss the parallelisation of LCU based on partition
 ing of observables into groups\, as well as the use of adaptive circuits t
 hat allow us to perform required Clifford circuits in constant depth. This
  parallelisation only requires a modest increase in the number of qubits i
 n order to produce an O(n) depth reduction. Our method can significantly r
 educe the overall space-time volume of the computation\, even when includi
 ng the increase in magic state factories required by parallelisation [1].\
 n\n[1] G. Boyd\, Low-Overhead Parallelisation of LCU via Commuting Operato
 rs\, arXiv: 2312.00696 (2024)
LOCATION:U202 Meeting room\, Department of Chemistry\, Cambridge
END:VEVENT
END:VCALENDAR