BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
234886
20260417T125414Z
DTSTART;TZID=America/New_York:20260421T130000
DTEND;TZID=America/New_York:2
 0260421T135000
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/depar
 tment-mathematical-sciences-qit-thinking-seminar-bill-martin-wpi-4
Department of Mathematical Sciences QIT Thinking Seminar: Bill Martin, WPI
\n\n\n      \n      \n\n\n\nTuesday, April 21st, 2026\n1:00pm – 1:50pm\nS
 tratton Hall 301\n\nSpeaker:Bill Martin, WPI\nTitle:Quantum stabilizer cod
 es\nAbstract: Microsoft reports that current implementations of quantum co
 mputing devices exhibit error rates about 1-in-100 to 1-in-1000 gate opera
 tions. By contrast, standard CPUs measure errors per billion or per trilli
 on operations. Even the simplest broadly deployed algorithms entail millio
 ns of operations, making error rates below 1-in-a-million unworkable. This
  is why, informally speaking, each logical qubit must be encased in a prot
 ective shell of physical error-correcting qubits. This talk, while surveyi
 ng a few recent developments, will focus on an overview pf quantum stabili
 zer codes. We will work from first principles, using only linear algebra o
 ver the complex numbers and over finite rings. The Weyl-Heisenberg group f
 or an n-qubit quantum system is the group of 2^n by 2^n matrices formed by
  taking tensor products of 2 x 2 Pauli matrices in all possible ways. If G
  is an abelian subgroup of the Weyl-Heisenberg group, then the matrices in
  G are simultaneously diagonalizable. Each maximal common eigenspace of th
 e matrices in G is a quantum stabilizer code. The talk will outline how th
 ese codes can be constructed, how they can be used, and their error-correc
 tion abilities.\n
END:VEVENT
END:VCALENDAR
