Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914857621651456 |
|---|---|
| author | Hastings, Matthew B. Haah, Jeongwan O'Donnell, Ryan |
| author_facet | Hastings, Matthew B. Haah, Jeongwan O'Donnell, Ryan |
| contents | We present a quantum LDPC code family that has distance $Ω(N^{3/5}/\operatorname{polylog}(N))$ and $\tildeΘ(N^{3/5})$ logical qubits. This is the first quantum LDPC code construction which achieves distance greater than $N^{1/2} \operatorname{polylog}(N)$. The construction is based on generalizing the homological product of codes to a fiber bundle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2009_03921 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes Hastings, Matthew B. Haah, Jeongwan O'Donnell, Ryan Quantum Physics Information Theory Combinatorics We present a quantum LDPC code family that has distance $Ω(N^{3/5}/\operatorname{polylog}(N))$ and $\tildeΘ(N^{3/5})$ logical qubits. This is the first quantum LDPC code construction which achieves distance greater than $N^{1/2} \operatorname{polylog}(N)$. The construction is based on generalizing the homological product of codes to a fiber bundle. |
| title | Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes |
| topic | Quantum Physics Information Theory Combinatorics |
| url | https://arxiv.org/abs/2009.03921 |