Logical error rate scaling of the toric code

DOI10.1088/1367-2630/16/9/093045MaRDI QIDQ3386980zbMATHOpenAlexFDO

Authors Fern H. E. Watson, Sean D. Barrett

Publication date 12 January 2021

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

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

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

Abstract: To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical quantum computers will necessarily operate below these thresholds meaning that other performance indicators become important. In this work we consider the scaling of the logical error rate of the toric code and demonstrate how, in turn, this may be used to calculate a key performance indicator. We use a perfect matching decoding algorithm to find the scaling of the logical error rate and find two distinct operating regimes. The first regime admits a universal scaling analysis due to a mapping to a statistical physics model. The second regime characterizes the behavior in the limit of small physical error rate and can be understood by counting the error configurations leading to the failure of the decoder. We present a conjecture for the ranges of validity of these two regimes and use them to quantify the overhead -- the total number of physical qubits required to perform error correction.

Recommendations

• scientific article
• Fast decoders for qudit topological codes
• Rectangular surface code under biased noise
• scientific article
• Kitaev's \(\mathbb Z_d\)-codes threshold estimates

Cites work

• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Computing Minimum-Weight Perfect Matchings
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Fault-tolerant quantum computation by anyons
• On the Lambert \(w\) function
• Paths, Trees, and Flowers
• Topological quantum memory

Cited in

(7)

• scientific article; zbMATH DE number 5953455 (Why is no real title available?)
• Cellular automaton decoders of topological quantum memories in the fault tolerant setting
• The role of entropy in topological quantum error correction
• Kitaev's \(\mathbb Z_d\)-codes threshold estimates
• Reinforcement learning for optimal error correction of toric codes
• An optimal dissipative encoder for the toric code
• Rectangular surface code under biased noise

This page was built for publication: Logical error rate scaling of the toric code

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