Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2309.12165 · IEEE Transactions on Information Theory

Analysis of the Error-Correcting Radius of a Renormalization Decoder for Kitaev’s Toric Code

Wouter Rozendaal, Gilles Zémor

Published May 6, 2024• 4 citations
arXivHTMLPDF

Abstract

Kitaev’s toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between accuracy and efficiency, with a time complexity inO(nlog2n). One question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an uncorrectable error pattern whose weight scales liked1/2and prove that the decoder corrects all error patterns of weight less than 5/6dlog2(6/5), wheredis the minimum distance of the toric code.

DOI
10.1109/tit.2024.3396620

Related papers

A Worst-Case Analysis of a Renormalisation Decoder for Kitaev’s Toric Code

Wouter Rozendaal, Gilles Zémor

Kitaev's toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between efficiency and speed, but one question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an uncorrectable error pattern whose weight scales like d1/2and prove that the decoder corrects all error patterns of weight less than $\frac{5}{6}{d^{{{\log }_2}(6/5)}}$, where d is the minimum distance of the toric code.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•2 citations

Kitaev's Z_d-Codes Threshold Estimates

Guillaume Duclos-Cianci, David Poulin

We study the quantum error correction threshold of Kitaev's toric code over the group Z_d subject to a generalized bit-flip noise. This problem requires novel decoding techniques, and for this purpose we generalize the renormalization group method we previously introduced in [Duclos-Cianci/Poulin,arXiv:0911.0581,2009; Duclos-Cianci/Poulin,ITW'10,2010] for Z_2 topological codes.

Leibniz international proceedings in informatics•Jan 1, 2013•3 citations

Quantum Error Correction: Decoders for the Toric Code

Nando Leijenhorst

Quantum error correction is needed for future quantum computers. Classical error correcting codes are not suitable for this due to the nature of quantum mechanics. Therefore, new codes need to be developed. A promising candidate is the toric code, a surface code, because of its locality and its high error correcting capability and thresholds (the error probability below which increasing the size of the code decreases the failure rate). This thesis provides an introduction to quantum error correction and the stabilizer formalism, which is used to introduce the toric code. Several decoders are looked at, including the Minimum Weight Perfect Matching (MWPM) decoder and a recently developed decoder, the Union-Find (UF) decoder. The UF decoder is useful because of its almost-linear time complexity, while only reducing the threshold by a marginal amount compared to the MWPM decoder. In this thesis, the time complexity of the weighted growth version of the UF decoder is analysed. The toric code and the decoders have been implemented and simulated, and the thresholds have been determined. For the MWPM decoder, the threshold was determined to be 11.5±0.2%, which is not in agreement with the threshold in literature of 10.3%, and should not be possible according to the optimal threshold of about 11%. This probably is a result of the low grid sizes (up to a gridsize of 11) of the code used due to the time needed to simulate the MWPM decoder. For the UF decoder, the threshold found was 9.7 ± 0.9%, which is in agreement with the threshold of 9.9% found by N. Delfosse and N. Nickerson. The time complexity of the UF decoder has also been determined, and is indeed almost-linear as expected by the analysis.

•Jan 1, 2019•1 citation

Fast decoders for qudit topological codes

Hussain Anwar, Benjamin J. Brown, Earl T. Campbell +1 more

Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.

arXiv:1311.4895•New Journal of Physics•Jun 17, 2014•92 citations

Local Probabilistic Decoding of a Quantum Code

Thomas R. Scruby, Kae Nemoto

flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser) which are uncorrectable for this decoder, so previous studies have considered modified versions of flip , sometimes in conjunction with other decoders. We argue that this may not always be necessary, and present numerical evidence for the existence of a threshold for flip when applied to the looplike syndromes of a three-dimensional toric code on a cubic lattice. This result can be attributed to the fact that the lowest-weight uncorrectable errors for this decoder are closer (in terms of Hamming distance) to correctable errors than to other uncorrectable errors, and so they are likely to become correctable in future code cycles after transformation by additional noise. Introducing randomness into the decoder can allow it to correct these "uncorrectable" errors with finite probability, and for a decoding strategy that uses a combination of belief propagation and probabilistic flip we observe a threshold of ∼5.5% under phenomenological noise. This is comparable to the best known threshold for this code ( ∼7.1% ) which was achieved using belief propagation and ordered statistics decoding [Higgott and Breuckmann, 2022], a strategy with a runtime of O(n3) as opposed to the O(n) ( O(1) when parallelised) runtime of our local decoder. We expect that this strategy could be generalised to work well in other low-density parity check codes, and hope that these results will prompt investigation of other previously overlooked decoders.

arXiv:2212.06985•Quantum•Aug 29, 2023•7 citations

Kitaev's Zd -code threshold estimates

Guillaume Duclos-Cianci, David Poulin

We study the quantum error correction threshold of Kitaev's toric code over the group ${\mathbb{Z}}_{d}$ subject to a generalized bit-flip noise. This problem requires special decoding techniques, and for this purpose we generalize the renormalization-group method we introduced previously [G. Duclos-Cianci and D. Poulin, Phys. Rev. Lett. 104, 050504 (2010) and IEEE Information Theory Workshop, Dublin (2010), p. 1] for ${\mathbb{Z}}_{2}$ topological codes.

arXiv:1302.3638•Physical Review A•Jun 27, 2013•53 citations
Kitaev’s toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between accuracy and efficiency, with a time complexity inO(nlog2n). One question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an uncorrectable error pattern whose weight scales liked1/2and prove that the decoder corrects all error patterns of weight less than 5/6dlog2(6/5), wheredis the minimum distance of the toric code.
Kitaev's toric code is arguably the most studied quantum code and is expected to be implemented in future generations of quantum computers. The renormalisation decoders introduced by Duclos-Cianci and Poulin exhibit one of the best trade-offs between efficiency and speed, but one question that was left open is how they handle worst-case or adversarial errors, i.e. what is the order of magnitude of the smallest weight of an error pattern that will be wrongly decoded. We initiate such a study involving a simple hard-decision and deterministic version of a renormalisation decoder. We exhibit an uncorrectable error pattern whose weight scales like d1/2and prove that the decoder corrects all error patterns of weight less than 56dlog⁡2(6/5)\frac{5}{6}{d^{{{\log }_2}(6/5)}}65​dlog2​(6/5), where d is the minimum distance of the toric code.
Quantum error correction is needed for future quantum computers. Classical error correcting codes are not suitable for this due to the nature of quantum mechanics. Therefore, new codes need to be developed. A promising candidate is the toric code, a surface code, because of its locality and its high error correcting capability and thresholds (the error probability below which increasing the size of the code decreases the failure rate). This thesis provides an introduction to quantum error correction and the stabilizer formalism, which is used to introduce the toric code. Several decoders are looked at, including the Minimum Weight Perfect Matching (MWPM) decoder and a recently developed decoder, the Union-Find (UF) decoder. The UF decoder is useful because of its almost-linear time complexity, while only reducing the threshold by a marginal amount compared to the MWPM decoder. In this thesis, the time complexity of the weighted growth version of the UF decoder is analysed. The toric code and the decoders have been implemented and simulated, and the thresholds have been determined. For the MWPM decoder, the threshold was determined to be 11.5±0.2%, which is not in agreement with the threshold in literature of 10.3%, and should not be possible according to the optimal threshold of about 11%. This probably is a result of the low grid sizes (up to a gridsize of 11) of the code used due to the time needed to simulate the MWPM decoder. For the UF decoder, the threshold found was 9.7 ± 0.9%, which is in agreement with the threshold of 9.9% found by N. Delfosse and N. Nickerson. The time complexity of the UF decoder has also been determined, and is indeed almost-linear as expected by the analysis.
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The second decoder is a generalization of a "soft-decisions" decoder due to Poulin and Duclos-Cianci [Phys. Rev. Lett. 104, 050504 (2010)], with a small cell size to optimize the efficiency of implementation in the high dimensional case. In each case, we estimate thresholds for the uncorrelated bit-flip error model and provide a comparative analysis of the performance of both these approaches to error correction of qudit toric codes.
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser) which are uncorrectable for this decoder, so previous studies have considered modified versions of flip , sometimes in conjunction with other decoders. We argue that this may not always be necessary, and present numerical evidence for the existence of a threshold for flip when applied to the looplike syndromes of a three-dimensional toric code on a cubic lattice. This result can be attributed to the fact that the lowest-weight uncorrectable errors for this decoder are closer (in terms of Hamming distance) to correctable errors than to other uncorrectable errors, and so they are likely to become correctable in future code cycles after transformation by additional noise. Introducing randomness into the decoder can allow it to correct these "uncorrectable" errors with finite probability, and for a decoding strategy that uses a combination of belief propagation and probabilistic flip we observe a threshold of ∼5.5% under phenomenological noise. This is comparable to the best known threshold for this code ( ∼7.1% ) which was achieved using belief propagation and ordered statistics decoding [Higgott and Breuckmann, 2022], a strategy with a runtime of O(n3) as opposed to the O(n) ( O(1) when parallelised) runtime of our local decoder. We expect that this strategy could be generalised to work well in other low-density parity check codes, and hope that these results will prompt investigation of other previously overlooked decoders.
We study the quantum error correction threshold of Kitaev's toric code over the group Zd{\mathbb{Z}}_{d}Zd​ subject to a generalized bit-flip noise. This problem requires special decoding techniques, and for this purpose we generalize the renormalization-group method we introduced previously [G. Duclos-Cianci and D. Poulin, Phys. Rev. Lett. 104, 050504 (2010) and IEEE Information Theory Workshop, Dublin (2010), p. 1] for Z2{\mathbb{Z}}_{2}Z2​ topological codes.