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(...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/99b602641df348c0b03502e6d25c5210 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|