Gast ::
| Hauptseite > Publikationsdatenbank > Generalized Belief Propagation Algorithms for Decoding of Surface Codes > print |
| Hauptseite > Publikationsdatenbank > Generalized Belief Propagation Algorithms for Decoding of Surface Codes > print |
| 001 | 915883 | ||
| 005 | 20230104131921.0 | ||
| 024 | 7 | _ | |a 2128/33365 |2 Handle |
| 037 | _ | _ | |a FZJ-2022-05753 |
| 100 | 1 | _ | |a Old, Josias |0 P:(DE-Juel1)192118 |b 0 |e Corresponding author |
| 245 | _ | _ | |a Generalized Belief Propagation Algorithms for Decoding of Surface Codes |
| 260 | _ | _ | |c 2022 |
| 336 | 7 | _ | |a Preprint |b preprint |m preprint |0 PUB:(DE-HGF)25 |s 1672831274_10869 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a WORKING_PAPER |2 ORCID |
| 336 | 7 | _ | |a Electronic Article |0 28 |2 EndNote |
| 336 | 7 | _ | |a preprint |2 DRIVER |
| 336 | 7 | _ | |a ARTICLE |2 BibTeX |
| 336 | 7 | _ | |a Output Types/Working Paper |2 DataCite |
| 520 | _ | _ | |a Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g. notably for the quantum low-density parity check (LDPC) code class of random expander codes. However, it is also well-known that the performance of BP breaks down when facing topological codes such as the surface code, where naive BP fails entirely to reach a below-threshold regime, i.e. the regime where error correction becomes useful. Previous works have shown, that this can be remedied by resorting to post-processing decoders outside the framework of BP. In this work, we present a generalized belief propagation method with an outer re-initialization loop that successfully decodes surface codes, i.e. opposed to naive BP it recovers the sub-threshold regime known from decoders tailored to the surface code and from statistical-mechanical mappings. We report a threshold of 17% under independent bit-and phase-flip data noise (to be compared to the ideal threshold of 20.6%) and a threshold value of 14% under depolarizing data noise (compared to the ideal threshold of 18.9%), which are on par with thresholds achieved by non-BP post-processing methods. |
| 536 | _ | _ | |a 5224 - Quantum Networking (POF4-522) |0 G:(DE-HGF)POF4-5224 |c POF4-522 |f POF IV |x 0 |
| 700 | 1 | _ | |a Rispler, Manuel |0 P:(DE-Juel1)187504 |b 1 |
| 856 | 4 | _ | |u https://arxiv.org/abs/2212.03214 |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/915883/files/2212.03214.pdf |y OpenAccess |
| 909 | C | O | |o oai:juser.fz-juelich.de:915883 |p openaire |p open_access |p VDB |p driver |p dnbdelivery |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 0 |6 P:(DE-Juel1)192118 |
| 910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 0 |6 P:(DE-Juel1)192118 |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 1 |6 P:(DE-Juel1)187504 |
| 913 | 1 | _ | |a DE-HGF |b Key Technologies |l Natural, Artificial and Cognitive Information Processing |1 G:(DE-HGF)POF4-520 |0 G:(DE-HGF)POF4-522 |3 G:(DE-HGF)POF4 |2 G:(DE-HGF)POF4-500 |4 G:(DE-HGF)POF |v Quantum Computing |9 G:(DE-HGF)POF4-5224 |x 0 |
| 914 | 1 | _ | |y 2022 |
| 915 | _ | _ | |a OpenAccess |0 StatID:(DE-HGF)0510 |2 StatID |
| 920 | _ | _ | |l yes |
| 920 | 1 | _ | |0 I:(DE-Juel1)PGI-2-20110106 |k PGI-2 |l Theoretische Nanoelektronik |x 0 |
| 980 | 1 | _ | |a FullTexts |
| 980 | _ | _ | |a preprint |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a I:(DE-Juel1)PGI-2-20110106 |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|