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

Non-Abelian quantum error correction

Weibo Feng

Published Jan 1, 2015• 7 citations
OpenAlex

Related papers

Fault-Tolerant Quantum Error Correction for non-Abelian Anyons

Guillaume Dauphinais, David Poulin

arXiv:1607.02159•Communications in Mathematical Physics•Jul 10, 2017•49 citations

Realization of quantum error correction

John Chiaverini, Dietrich G. Leibfried, Tobias Schaetz +9 more

Nature•Dec 1, 2004•519 citations

Improved HDRG decoders for qudit and non-Abelian quantum error correction

Adrian Hutter, Daniel Loss, James R. Wootton

Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strengths of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size L from to for any We apply our algorithm to decoding quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the quantum double models. The parallelized runtime of our algorithm is for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.

arXiv:1410.4478•New Journal of Physics•Mar 31, 2015•43 citations

Error Correction for Quantum Computers

WORLD SCIENTIFIC eBooks•Jul 1, 1998•0 citations

Continuous error correction for Ising anyons

Adrian Hutter, James R. Wootton

Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture truly scalable, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis, and further errors may occur while we are correcting existing ones. Here, we prove the feasibility of this task, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate ${p}_{c}>0$ such that for all error rates $p<{p}_{c}$ the probability of a logical error per time step can be made exponentially small in the distance of a logical qubit.

arXiv:1508.04033•Physical Review A•Apr 18, 2016•14 citations

Symposium Program

Special Session SS1 on Quantum error correction: The quantum physics perspective Chairpersons: Bane Vasić (University of Arizona), Narayanan Rengaswamy (University of Arizona)The surface code and its topological cousins are currently the leading candidates for implementing quantum error correction in hardware, especially for technologies such as superconducting qubits.It is now well-known that these codes can be constructed from classical binary linear codes via the hypergraph product construction.However, the intuition and initial construction of the toric and surface codes came from Kitaev's fundamentally physics perspective.Before efficient decoders were built, the connection between statistical physics and the toric code also enabled the computation of its error correction threshold.While this is only one example, albeit a famous one, of the impact of taking a physics-based perspective towards quantum error correction, it shows how such an approach can span the wide spectrum of fundamental results to practical real-world implementation.In this session, we will hear from leading experts in the field about insights on quantum error correction gained from a physicist's point of view.13:55 -14:45 Keynote by K. Brown Quantum Error Correction and Machine Noise [1]Quantum error correction and fault-tolerant quantum computation promise to build reliable quantum devices from faulty components.Theoretical studies tend to focus on depolarizing and dephasing noise which can be simulated by the stochastic application of Pauli errors.In this talk, I will discuss quantum error correction in the context of a broader range of noise sources including coherent errors, leakage, and erasure.I will conclude by discussing how the co-design of hardware and faulttolerant procedures can lead to more efficient fault-tolerant quantum computation.14:45 -15:10 Abelian and non-abelian quantum two-block codes Renyu Wang, Hsiang-Ku Lin, and Leonid P Pryadko[2] 1570908406.pdfWe discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalizedbicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian.We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian.This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group.We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•0 citations
Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strengths of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size L from to for any We apply our algorithm to decoding quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the quantum double models. The parallelized runtime of our algorithm is for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.
Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture truly scalable, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis, and further errors may occur while we are correcting existing ones. Here, we prove the feasibility of this task, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate pc>0{p}_{c}>0pc​>0 such that for all error rates p<pcp<{p}_{c}p<pc​ the probability of a logical error per time step can be made exponentially small in the distance of a logical qubit.
Special Session SS1 on Quantum error correction: The quantum physics perspective Chairpersons: Bane Vasić (University of Arizona), Narayanan Rengaswamy (University of Arizona)The surface code and its topological cousins are currently the leading candidates for implementing quantum error correction in hardware, especially for technologies such as superconducting qubits.It is now well-known that these codes can be constructed from classical binary linear codes via the hypergraph product construction.However, the intuition and initial construction of the toric and surface codes came from Kitaev's fundamentally physics perspective.Before efficient decoders were built, the connection between statistical physics and the toric code also enabled the computation of its error correction threshold.While this is only one example, albeit a famous one, of the impact of taking a physics-based perspective towards quantum error correction, it shows how such an approach can span the wide spectrum of fundamental results to practical real-world implementation.In this session, we will hear from leading experts in the field about insights on quantum error correction gained from a physicist's point of view.13:55 -14:45 Keynote by K. Brown Quantum Error Correction and Machine Noise [1]Quantum error correction and fault-tolerant quantum computation promise to build reliable quantum devices from faulty components.Theoretical studies tend to focus on depolarizing and dephasing noise which can be simulated by the stochastic application of Pauli errors.In this talk, I will discuss quantum error correction in the context of a broader range of noise sources including coherent errors, leakage, and erasure.I will conclude by discussing how the co-design of hardware and faulttolerant procedures can lead to more efficient fault-tolerant quantum computation.14:45 -15:10 Abelian and non-abelian quantum two-block codes Renyu Wang, Hsiang-Ku Lin, and Leonid P Pryadko[2] 1570908406.pdfWe discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalizedbicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian.We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian.This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group.We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.