Pith. sign in

REVIEW 1 cited by

Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.03708 v1 pith:ECKU4ICF submitted 2021-12-07 quant-ph cond-mat.mes-hall

classification quant-phcond-mat.mes-hall
keywords errorquantumcorrectioncyclecodecomputersdemonstratedistance-three
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum computers hold the promise of solving computational problems which are intractable using conventional methods. For fault-tolerant operation quantum computers must correct errors occurring due to unavoidable decoherence and limited control accuracy. Here, we demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. Using 17 physical qubits in a superconducting circuit we encode quantum information in a distance-three logical qubit building up on recent distance-two error detection experiments. In an error correction cycle taking only $1.1\,\mu$s, we demonstrate the preservation of four cardinal states of the logical qubit. Repeatedly executing the cycle, we measure and decode both bit- and phase-flip error syndromes using a minimum-weight perfect-matching algorithm in an error-model-free approach and apply corrections in postprocessing. We find a low error probability of $3\,\%$ per cycle when rejecting experimental runs in which leakage is detected. The measured characteristics of our device agree well with a numerical model. Our demonstration of repeated, fast and high-performance quantum error correction cycles, together with recent advances in ion traps, support our understanding that fault-tolerant quantum computation will be practically realizable.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tensor-network decoders for process tensor descriptions of non-Markovian noise

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A tensor-network-based maximum likelihood decoder is constructed for quantum error correction under process-tensor noise, with an MPS approximation demonstrated on the five-qubit and Steane codes.

Pith tools