相关论文: A Pair Measurement Surface Code on Pentagons

We present two new types of syndrome extraction circuits for the color code. Our first construction, which after [M. McEwen, D. Bacon, and C. Gidney, Quantum 7, 1172 (2023)] we call the semi-wiggling color code, promises to mitigate leakage…

We propose a scheme for a ground-code measurement-based quantum computer, which enjoys two major advantages. First, every logical qubit is encoded in the gapped degenerate ground subspace of a spin-1 chain with nearest-neighbor two-body…

Single-shot error correction outperforms conventional approaches by requiring only one round of stabilizer measurements for decoding, even in the presence of measurement errors. This capability relates to the confinement property of codes,…

Dynamical quantum error-correcting codes (QECC) offer wider possibilities in how one can protect logical quantum information from noise and perform fault-tolerant quantum computation compared to static QECCs. A family of dynamical QECCs…

Early demonstrations of fault tolerant quantum systems have paved the way for logical-level compilation. For fault-tolerant applications to succeed, execution must finish with a low total program error rate (i.e., a low program failure…

Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-density-parity-check (LDPC) codes, however, Shor and Steane…

Surface codes have historically been the dominant choice for quantum error correction due to their superior error threshold performance. However, recently, a new class of Generalized Bicycle (GB) codes, constructed from binary circulant…

Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. The square-lattice surface…

Tesseract is a Most-Likely Error decoder designed for low-density-parity-check quantum error-correcting codes. Tesseract conducts a search through a graph on the set of all subsets of errors to find the lowest cost subset of errors…

For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction…

Quantum error correction (QEC) requires the execution of deep quantum circuits with large numbers of physical qubits to protect information against errors. Designing protocols that can reduce gate and space-time overheads of QEC is…

We present a simple $q$-ary family of single-error-correcting, double-error-detecting (SEC--DED) linear codes whose parity checks are tied directly to the base-$p$ ($q=p$ prime) digits of the coordinate index. For blocklength $n=p^r$ the…

In this paper, the concept of the {\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle…

High-fidelity qubit readout is a fundamental requirement for practical quantum computing systems. In this work, we investigate methods to enhance the measurement fidelity of flux qubits via a quantum flux parametron-mediated readout scheme.…

We construct a double-toric surface code by exploiting the planar tessellation using a rhombus-shaped tile. With n data qubits, we are able to encode at least n/3 logical qubits or quantum memories. By a suitable arrangement of the tiles,…

Topological error-correcting codes, such as surface codes and color codes, are promising because quantum operations are realized by two-dimensionally (2D) arrayed quantum bits (qubits). However, physical wiring of electrodes to qubits is…

We consider some questions related to codes constructed using various graphs, in particular focusing on graphs which are not lattices in two or three dimensions. We begin by considering Floquet codes which can be constructed using…

Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome ("soft-output decoders") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct…

Practical quantum computation heavily relies on the ability to perform quantum error correction in a fault-tolerant manner. Fault-tolerant encoding is a critical first step, and careful consideration of the error correction cycle that…

Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear…