Comparison of memory thresholds for planar qudit geometries
We introduce and analyze a new type of decoding algorithm called general color clustering, based on renormalization group methods, to be used in qudit color codes. The performance of this decoder is analyzed under a generalized bit-flip error model, and is used to obtain the first memory threshold e...
Main Authors: | Jacob Marks, Tomas Jochym-O’Connor, Vlad Gheorghiu |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2017-01-01
|
Series: | New Journal of Physics |
Subjects: | |
Online Access: | https://doi.org/10.1088/1367-2630/aa939a |
Similar Items
-
Fast decoders for qudit topological codes
by: Hussain Anwar, et al.
Published: (2014-01-01) -
Correlations in star networks: from Bell inequalities to network inequalities
by: Armin Tavakoli, et al.
Published: (2017-01-01) -
Multi-partite entanglement can speed up quantum key distribution in networks
by: Michael Epping, et al.
Published: (2017-01-01) -
Operation of a planar-electrode ion-trap array with adjustable RF electrodes
by: M Kumph, et al.
Published: (2016-01-01) -
Asynchronous reference frame agreement in a quantum network
by: Tanvirul Islam, et al.
Published: (2016-01-01)