Fast decoders for qudit topological codes

DOI10.1088/1367-2630/16/6/063038zbMATH Open1451.81195arXiv1311.4895OpenAlexW2102532141WikidataQ62382447 ScholiaQ62382447MaRDI QIDQ5143239FDOQ5143239

Authors: Hussain Anwar, Benjamin J. Brown, Earl T. Campbell, Dan E. Browne 

Publication date: 11 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1311.4895

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cites Work

• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Reducibility among combinatorial problems
• Title not available (Why is that?)
• Multiple-particle interference and quantum error correction
• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Fault-tolerant quantum computation by anyons
• Models for gapped boundaries and domain walls
• Mixed-state entanglement and quantum error correction
• Quantum information theory
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Topological quantum memory
• Fault-tolerant quantum computation with higher-dimensional systems
• Title not available (Why is that?)
• Statistical Physics of Spin Glasses and Information Processing
• Universal topological phase of two-dimensional stabilizer codes
• The quantum double model with boundary: condensations and symmetries
• Qutrit magic state distillation
• Qudit surface codes and gauge theory with finite cyclic groups
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Projective plane and planar quantum codes
• Title not available (Why is that?)
• Generalized toric codes coupled to thermal baths
• The Last Recreations

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)