BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:A Criterion for Post-Selected Quantum Advantage [Confirmed]
DTSTART:20250514T150000Z
DTEND:20250514T163000Z
DTSTAMP:20260815T033200Z
UID:indico-event-1185@events.perimeterinstitute.ca
DESCRIPTION:Speakers: Matthew Fox (University of Colorado Boulder)\n\nAssu
 ming the polynomial hierarchy is infinite\, we prove a sufficient conditio
 n for determining if uniform and polynomial size quantum circuits over a n
 on-universal gate set are not efficiently classically simulable in the wea
 k multiplicative sense. Our criterion exploits the fact that subgroups of 
 SL(2\; C) are essentially either discrete or dense in SL(2\; C). Using our
  criterion\, we give a new proof that both instantaneous quantum polynomia
 l (IQP) circuits and conjugated Clifford circuits (CCCs) afford a quantum 
 advantage. We also prove that both commuting CCCs and CCCs over various fr
 agments of the Clifford group afford a quantum advantage\, which settles t
 wo questions of Bouland\, Fitzsimons\, and Koh. Our results imply that cir
 cuits made of just U \\otimes U-conjugated CZ gates afford a quantum advan
 tage for almost all single-qubit unitaries U.\n\nhttps://events.perimeteri
 nstitute.ca/event/1185/
LOCATION:PI/4-405 - Bob Room (Perimeter Institute for Theoretical Physics)
URL:https://events.perimeterinstitute.ca/event/1185/
END:VEVENT
END:VCALENDAR