BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:738@lincs.fr
DTSTART;TZID=Europe/Paris:20230208T150000
DTEND;TZID=Europe/Paris:20230208T160000
DTSTAMP:20230214T150354Z
URL:https://www.lincs.fr/events/a-converse-for-fault-tolerant-quantum-comp
 utation/
SUMMARY:A Converse for Fault-tolerant Quantum Computation
DESCRIPTION:As techniques for fault-tolerant quantum computation keep
 improving\, it is natural to ask: what is the fundamental lower bound on
 redundancy? In this paper\, we obtain a lower bound on the redundancy
 required for $\\epsilon$-accurate implementation of a large class of
 operations that includes unitary operators. For the practically relevant
 case of sub-exponential depth and sub-linear gate size\, our bound on
 redundancy is tighter than the known lower bounds. We obtain this bound by
 connecting fault-tolerant computation with a set of finite blocklength
 quantum communication problems whose accuracy requirements satisfy a joint
 constraint. The lower bound on redundancy obtained here leads to a strictly
 smaller upper bound on the noise threshold for non-degradable noise. Our
 bound directly extends to the case where noise at the outputs of a gate are
 non-i.i.d. but noise across gates are i.i.d.\n(This is a joint work with
 Uthirakalyani G\, IIT Madras and Anuj K. Nayak\, UIUC. No prior knowledge
 about quantum computation and communication will be assumed in this talk.)
CATEGORIES:Seminars,Youtube
LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\,
 Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR