Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander

Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 14

1 of 14

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Classical codes
  3. 3 CSS (Calderbank, Shor, Steane) codes A quantum CSS code is given by two orthogonal subspaces
  4. 4 CSS codes as 2-complexes A CSS code given by parity check matrices
  5. 5 Geometric 2-complexes
  6. 6 Boundaries
  7. 7 Towards better complexes
  8. 8 Geometrical approach (II)
  9. 9 LSV (Lubotzky, Samuels, Vishne) complexes (1) These are explicit bounded degree simplicial complexes, which are highly complicated objects (both locally and globally).
  10. 10 Link of a vertex
  11. 11 Decoding LSV complexes (1)
  12. 12 Balancing distances (1) TA
  13. 13 LSV 3-complexes
  14. 14 Final remarks

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.