The reviewed record of science sign in
Pith

arxiv: 2103.14209 · v1 · pith:XFUNGVWY · submitted 2021-03-26 · quant-ph

QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder for Surface Code

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:XFUNGVWYrecord.jsonopen to challenge →

classification quant-ph
keywords quantumerrorcodesuperconductingalgorithmcorrectiondecoderdecoding
0
0 comments X
read the original abstract

Due to the low error tolerance of a qubit, detecting and correcting errors on it is essential for fault-tolerant quantum computing. Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods. % One of the challenges of QEC is its high complexity and computational demand. QEC needs to be very power-efficient since the power budget is limited inside of a dilution refrigerator for superconducting qubits by which one of the most successful quantum computers (QCs) is built. In this paper, we propose an online-QEC algorithm and its hardware implementation with SFQ-based superconducting digital circuits. We design a key building block of the proposed hardware with an SFQ cell library and evaluate it by the SPICE-level simulation. Each logic element is composed of about 3000 Josephson junctions and power consumption is about 2.78 uW when operating with 2 GHz clock frequency which meets the required decoding speed. Our decoder is simulated on a quantum error simulator for code distances 5 to 13 and achieves a 1.0% accuracy threshold.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Proof of a finite threshold for the union-find decoder

    quant-ph 2026-02 unverdicted novelty 8.0

    Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.