Related papers: Single-Shot and Few-Shot Decoding via Stabilizer R…
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a…
With quantum devices rapidly approaching qualities and scales needed for fault tolerance, the validity of simplified error models underpinning the study of quantum error correction needs to be experimentally evaluated. In this work, we have…
Erasure qubits reduce overhead in fault-tolerant quantum error correction (QEC) by converting dominant faults into detectable errors known as erasures. They have demonstrated notable improvements in thresholds and scaling in surface and…
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights $O(1)$ and such that $O(1)$ generators act on any given qubit. The number of…
We introduce a class of bosonic quantum error-correcting codes, termed \emph{extended binomial codes}, which generalize the structure of one-mode binomial codes by incorporating ideas from high-rate qubit stabilizer codes. These codes are…
This paper is concerned with the systematic Bernoulli generator matrix~(BGM) codes, which have been proved to be capacity-achieving over binary-input output-symmetric~(BIOS) channels in terms of bit-error rate~(BER). We prove that the…
Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance. Conventional MSD protocols implemented in surface codes often require multiple…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for both unique string…
Syndrome extraction in the planar color code is complicated by high weight stabilizers and hook errors that can reduce the circuit-level distance. With a single auxiliary qubit per plaquette, any spatially uniform circuit halves the…
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed…
Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding…
Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses…
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…
We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They…
In this paper, we study cyclic stabiliser codes over $\mathbb{F}_p$ of length dividing $p^t+1$ for some positive integer $t$. We call these $t$-Frobenius codes or just Frobenius codes for short. We give methods to construct them and show…
We demonstrate the existence of a finite temperature threshold for a 1D stabilizer code under an error correcting protocol that requires only a fraction of the syndrome measurements. Below the threshold temperature, encoded states have…
Quantum low-density parity-check (QLDPC) codes provide non vanishing rates, distance scaling with the blocklength of the code, and facilitate fast iterative decoding because of their sparsity. However, in practice iterative decoding fails…
Quantum error correcting code can diagnose potential errors and correct them based on measured outcomes by leveraging syndrome measurement. However, mid-circuit measurement has been technically challenging for early fault-tolerant quantum…
We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes…