BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230922T100000
DTEND;TZID=America/New_York:20230922T113000
DTSTAMP:20260610T001541
CREATED:20240223T095601Z
LAST-MODIFIED:20240223T095601Z
UID:10002845-1695376800-1695382200@cmsa.fas.harvard.edu
SUMMARY:Floquet codes\, automorphisms\, and quantum computation
DESCRIPTION:Quantum Matter Seminar \nSpeaker: Margarita Davydova (MIT) \nTitle: Floquet codes\, automorphisms\, and quantum computation \nAbstract: In this talk\, I will introduce a new kind of measurement-based quantum computation inspired by Floquet codes. In this model\, the quantum logical gates are implemented by short sequences of low-weight measurements which simultaneously encode logical information and enable error correction.  We introduce a new class of quantum error-correcting codes generalizing Floquet codes that achieve this\, which we call dynamic automorphism (DA) codes. \nAs in Floquet codes\, the instantaneous codespace of a DA code at any fixed point in time is that of a topological code. In this case\, the quantum computation can be viewed as a sequence of time-like domain walls implementing automorphisms of the topological order\, which can be understood in terms of reversible anyon condensation paths in a particular parent model.  This talk will introduce all of these concepts as well as provide a new perspective for thinking about Floquet codes. \nThe explicit examples that we construct\, which we call DA color codes\, can implement the full Clifford group of logical gates in 2+1d by two- and\, rarely three-body measurements. Using adaptive two-body measurements\, we can achieve a non-Clifford gate in 3+1d\, making the first step towards universal quantum computation in this model. \nThe talk is based on recent work with Nathanan Tantivasadakarn\, Shankar Balasubramanian\, and David Aasen [arxiv: 2307.10353].
URL:https://cmsa.fas.harvard.edu/event/qm_92223/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Quantum Matter
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-QMMP-09.22.23.png
END:VEVENT
END:VCALENDAR