Related papers: Quasi-twisted codes: decoding and applications in …
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently…
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser)…
Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…
Topological color codes defined by the 4.8.8 semiregular lattice feature geometrically local check operators and admit transversal implementation of the entire Clifford group, making them promising candidates for fault-tolerant quantum…
Quantum error correction offers a promising path for performing quantum computations with low errors. Although a fully fault-tolerant execution of a quantum algorithm remains unrealized, recent experimental developments, along with…
Bit-Flipping (BF) decoders are a family of decoders widely employed in post-quantum cryptographic schemes based on Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes, such as BIKE. BF decoders suffer from trapping sets,…
In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes ("quasi codes"). By definition, a quasi code is a parametric approximate…
Quasi-twisted codes are used here as the classical ingredients in the so-called Construction X for quantum error-control codes. The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. We expand the choices…
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…
In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our…
It is recently conjectured in quantum information processing that phase-shift errors occur with high probability than qubit-flip errors, hence the former is more disturbing to quantum information than the later one. This leads us to…
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to…
A locally recoverable code of locality $r$ over $\mathbb{F}_{q}$ is a code where every coordinate of a codeword can be recovered using the values of at most $r$ other coordinates of that codeword. Locally recoverable codes are efficient at…
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…
We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…
Cryptography based on the presumed hardness of decoding codes -- i.e., code-based cryptography -- has recently seen increased interest due to its plausible security against quantum attackers. Notably, of the four proposals for the NIST…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…