BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Introduction to Direct Fidelity Estimation - Jedrzej Burkat (Unive
 rsity of Cambridge)
DTSTART:20241023T113000Z
DTEND:20241023T133000Z
UID:TALK223351@talks.cam.ac.uk
CONTACT:Chiara Leadbeater
DESCRIPTION:With the prospect of reaching hundreds of fault-tolerant qubit
 s by the end of the decade\, scaling up quantum computing infrastructure i
 s as much of a theoretical as practical challenge. Against the backdrop of
  progress in hardware\, simple yet effective techniques are needed to addr
 ess the question of how well our quantum computers can perform their inten
 ded task: implementing one\, and two-qubit gates. In this chalk talk\, I w
 ill define the problem of fidelity estimation\, and provide a common appro
 ach for solving it — the Direct Fidelity Estimation algorithm. \n\nIn th
 e first part of the talk\, I will outline the concept of Channel Fidelity 
 and the closely-related Entanglement Fidelity of quantum processes. After 
 introducing the necessary tools for estimating these quantities (via the P
 auli-Liouville representation of quantum channels)\, I will present the Di
 rect Fidelity Estimation (DFE) algorithm of Flammia & Liu [PRL 106\, 23050
 1]\, a commonly used technique for certifying quantum processes. In the se
 cond part I will also introduce Matchgates\, a family of gates capable of 
 universal quantum computation that is native to many quantum computing arc
 hitectures. After modifying the DFE algorithm\, we will arrive at Matchgat
 e Fidelity Estimation [arXiv:2404.07974]\, a variant of DFE capable of ben
 chmarking Matchgate circuits in a scalable runtime. \n\n
LOCATION:Todd-Hamied Room\, Department of Chemistry\, Cambridge and Teams
END:VEVENT
END:VCALENDAR