English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a two-dimensional quantum memory of qubits on a torus whichencode the extended Fibonaccistring-net code, and devise strategies for errorcorrection when those qubits are subjected to depolarizing noise.Building onthe concept of tube algebras, we construct a set of measurements and of quantumgates whichmap arbitrary qubit errors to the string-net subspace and allow forthe characterization of the resulting errorsyndrome in terms of doubledFibonacci anyons. Tensor network techniques then allow to quantitativelystudythe action of Pauli noise on the string-net subspace. We perform MonteCarlo simulations of error correctionin this Fibonacci code, and compare theperformance of several decoders. For the case of a fixed-ratesamplingdepolarizing noise model, we find an error correction threshold of 4.7%using a clustering decoder. To the bestof our knowledge, this is the first timethat a threshold has been estimated for a two-dimensional error correctingcodefor which universal quantum computation can be performed within its code spacevia braiding anyons

Quantum error correction thresholds for the universal Fibonacci Turaev-Viro code