Renormalization Group Decoder for a Four-Dimensional Toric Code

DOI10.1109/TIT.2018.2879937MaRDI QIDQ5223949zbMATH OpenOpenAlexWikidataFDO

Authors Kasper Duivenvoorden, Nikolas P. Breuckmann, Barbara M. Terhal

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of $4.35pm0.1\mathrm{\%}$. For this error model, this is the highest known threshold of any topological code. Without measurement errors, a four-dimensional version of our algorithm can be used and we find a threshold of $7.3pm0.1\mathrm{\%}$. For the gate-based depolarizing error model we find a threshold of $0.31pm0.01\mathrm{\%}$ which is below the threshold found for the two-dimensional toric code.

Cited in

(2)

• An optimal dissipative encoder for the toric code
• Loops in 4+1d topological phases

This page was built for publication: Renormalization Group Decoder for a Four-Dimensional Toric Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223949)