BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Madelyn Cain (Harvard) DTSTART:20250225T213000Z DTEND:20250225T223000Z DTSTAMP:20260423T021135Z UID:MathPic/138 DESCRIPTION:Title: Low overhead fault tolerance for universal quantum computation\nby M adelyn Cain (Harvard) as part of Mathematical Picture Language Seminar\n\n Lecture held in Jefferson 256 and Zoom https://harvard.zoom.us/j/779283357 ?pwd=MitXVm1pYUlJVzZqT3lwV2pCT1ZUQT09.\n\nAbstract\nQuantum error correcti on (QEC) is believed to be essential for scalable quantum computation\, bu t its implementation is challenging due to its considerable space-time ove rhead. Here we report theoretical and experimental advances in reducing th is overhead. Using dynamically reconfigurable arrays of neutral atoms and various types of error-correcting codes\, we demonstrate efficient manipul ation and entanglement of logical qubits using transversal gates\, includi ng improving entangling gates with code distance and simulating classicall y complex scrambling circuits. In implementing these circuits\, we observe their performance can be substantially improved by accounting for error p ropagation during transversal entangling gates and decoding the logical qu bits jointly. By leveraging this deterministic propagation of errors\, we show this correlated decoding enables the number of noisy syndrome extract ion rounds between gates to be reduced from O(d) to O(1) in transversal Cl ifford circuits\, where d is the code distance. We then generalize this fi nding to apply to universal computation by developing strategies for handl ing feed-forward operations and magic state inputs. These techniques resul t in new theories of fault-tolerance and in practical reductions to the co st of large-scale quantum computation by over an order of magnitude.\n\nPa sscode: 657361\n LOCATION:https://researchseminars.org/talk/MathPic/138/ END:VEVENT END:VCALENDAR