About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Quantum Error Correction Thresholds for the Universal Fibonacci Turaev-Viro Code
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 us 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.7% using a clustering decoder.