Quantum Error Correction Thresholds for the Universal Fibonacci Turaev-Viro Code
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonacci string-net code, and devise strategies for error correction when those qubits are subjected to depolarizing noise. Building on the concept of tube algebras, we construct a set of measurements and of quantum gates which map arbitrary qubit errors to the string-net subspace and allow for the characterization of the resulting error syndrome in terms of doubled Fibonacci anyons. Tensor network techniques then allow to quantitatively study the action of Pauli noise on the string-net subspace. We perform Monte Carlo simulations of error correction in this Fibonacci code, and compare the performance of several decoders. For the case of a fixed-rate sampling depolarizing noise model, we find an error correction threshold of 4.75% using a clustering decoder. To the best of our knowledge, this is the first time that a threshold has been estimated for a two-dimensional error correcting code for which universal quantum computation can be performed within its code space.