Fast decoders for qudit topological codes
From MaRDI portal
Publication:5143239
Abstract: 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.
Recommendations
- Quantum codes for topological quantum computation
- Quantum computation with topological codes. From qubit to topological fault-tolerance
- Efficient decoding of random errors for quantum expander codes
- scientific article; zbMATH DE number 5582982
- Towards efficient decoding of classical-quantum polar codes
- Hypermap-homology quantum codes
- Euclidean and hyperbolic asymmetric topological quantum codes
- Quantum codes based on fast Pauli block transforms in the finite field
- Quantum Codes From Toric Surfaces
- Qudit surface codes and hypermap codes
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5613977 (Why is no real title available?)
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 2018408 (Why is no real title available?)
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Fault-tolerant quantum computation by anyons
- Fault-tolerant quantum computation with higher-dimensional systems
- Generalized toric codes coupled to thermal baths
- Mixed-state entanglement and quantum error correction
- Models for gapped boundaries and domain walls
- Multiple-particle interference and quantum error correction
- Paths, Trees, and Flowers
- Projective plane and planar quantum codes
- Quantum information theory
- Qudit surface codes and gauge theory with finite cyclic groups
- Qutrit magic state distillation
- Reducibility among combinatorial problems
- Statistical Physics of Spin Glasses and Information Processing
- The Last Recreations
- The quantum double model with boundary: condensations and symmetries
- Topological quantum memory
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Universal topological phase of two-dimensional stabilizer codes
Cited in
(11)- Hat problem: a new strategy based on quantum stabilizer codes
- Fault-tolerant quantum error correction for non-abelian anyons
- Logical error rate scaling of the toric code
- Topological quantum error correction in the Kitaev honeycomb model
- The role of entropy in topological quantum error correction
- Quantum codes based on fast Pauli block transforms in the finite field
- Qudit surface codes and hypermap codes
- Qudit surface codes and gauge theory with finite cyclic groups
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Kitaev's \(\mathbb Z_d\)-codes threshold estimates
- Single-shot decoding of good quantum LDPC codes
This page was built for publication: Fast decoders for qudit topological codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143239)
