Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.
A renormalization group decoding algorithm for topological quantum codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for fault-tolerant quantum information processing. Here, we present a decoding algorithm for topological codes that is faster than previously known algorithms and applies to a wider class of topological codes. Our algorithm makes use of two methods inspired from statistical physics: renormalization groups and mean-field approximations. First, the topological code is approximated by a concatenated block code that can be efficiently decoded. To improve this approximation, additional consistency conditions are imposed between the blocks, and are solved by a belief propagation algorithm.
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
Extends n-dimensional topological stabilizer codes to Clifford hierarchy versions corresponding to non-Abelian gauge theories and constructs transversal gates at the (n+1)th Clifford level.