QIP2021 | Fiber Bundle Codes: Breaking the N^{1/2} polylog(N) Barrier... (Matthew Hastings)

preview_player
Показать описание
Fiber Bundle Codes: Breaking the N^{1/2} polylog(N) Barrier for Quantum LDPC Codes

Authors: Matthew Hastings, Jeongwan Haah and Ryan O'Donnell
Affiliations: Microsoft | Microsoft | Carnegie Mellon University

Abstract
We present a quantum LDPC code family that has distance Omega(N^{3/5}/polylog(N)) and Theta(N^{3/5}) logical qubits, up to polylogs, where N is the code length. This is the first quantum LDPC code construction which achieves distance greater than N^{1/2} polylog(N). The construction is based on generalizing the homological product of codes to a fiber bundle.

Get entangled with us!
Рекомендации по теме
Комментарии
Автор

Thanks for posting these amazing talks, could you please enable the subtitles?

sophiac.
welcome to shbcf.ru