BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20180325T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260404T052806Z
UID:5b60158238dac303338033@ist.ac.at
DTSTART:20180806T110000
DTEND:20180806T120000
DESCRIPTION:Speaker: Arne Grimsmo\nhosted by Johannes Fink\nAbstract: By en
 coding a logical qubit in the infinitely large Hilbert space of a quantum 
 oscillator it might be possible to realize a more hardware efficient appro
 ach to quantum computing. Recent experiments have reached the so-called br
 eak-even point for error correction using this idea\, where an encoded qub
 it has a longer life-time than an unencoded qubit. However\, fault-toleran
 t schemes for these encodings have been missing. Without fault-tolerance\,
  it is probably not possible to go much beyond break even. In this talk I 
 will present ongoing theoretical work on a practical and fault-tolerant sc
 heme for a large family of oscillator codes. Although our results do not p
 rovide any free lunch\, they suggest that highly hardware efficient and fa
 ult-tolerant error correction is possible. We are also able to numerically
  compute fault-tolerance (pseudo) thresholds for codes in this family\, in
 cluding Cat- and Binomial codes\, for the first time.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:sdanzing@ist.ac.at
SUMMARY:Arne Grimsmo: Quantum computing with qubits encoded in oscillators
URL:https://talks-calendar.ista.ac.at/events/1333
END:VEVENT
END:VCALENDAR