BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:ca180221-7820-4d8d-8de2-a8bc55161062
X-WR-CALNAME:[ICQ] Gerard Valenti-Rojas (Naquidis-IMB) Towards “Good-Enough
 ” Quantum Low-Density Parity-Check Codes
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:ca180221-7820-4d8d-8de2-a8bc55161062
DTSTAMP:20260427T180728Z
CLASS:PUBLIC
DESCRIPTION:Towards “Good-Enough” Quantum Low-Density Parity-Check Codes\n
 \nThe accumulation of errors in quantum computers obstructs the execution 
 of powerful algorithms. Hence\,\ncurrent quantum computers require Quantum
  Error Correction (QEC) in order to be functional and reliable\neven in th
 e presence of such errors\, something known as Fault-Tolerant Quantum Comp
 utation (FTQC).\nConventional strategies for protecting and correcting aga
 inst qubit errors\, such as Surface Codes\, suffer\nfrom large overheads i
 n the number of physical qubits that are used to encode logical informatio
 n. In other\nwords\, practical implementation of quantum error-correcting 
 codes requires a better ratio between the\nnumber of logical and physical 
 qubits\, something known as a high encoding rate. Quantum Tanner Codes\nha
 ve been shown to be optimal in the asymptotic limit due to their rich stru
 cture\, providing a potential\nsolution to this conundrum. However\, “good
 -enough” finite explicit constructions have not been found so\nfar. In thi
 s work\, we reformulate Tanner codes as unconventional lattice gauge theor
 ies describing spin\nmany-body systems. Preliminary results indicate the p
 otential for an unusually robust relative of\ntopologically ordered matter
  as a key element for the outstanding capabilities of this family of codes
 .\n\n\nhttps://combalgo.labri.fr/pmwiki.php/Groupe/Info-Quantique
DTSTART;TZID=Europe/Paris:20241001T104500
DTEND;TZID=Europe/Paris:20241001T114500
LOCATION:Room 178
SEQUENCE:0
SUMMARY:[ICQ] Gerard Valenti-Rojas (Naquidis-IMB) Towards “Good-Enough” Qua
 ntum Low-Density Parity-Check Codes
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
