Almost-linear time decoding algorithm for topological codes
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of $O(n \alpha(...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/99b602641df348c0b03502e6d25c5210 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|