Related papers: Entanglement-assisted Quantum Codes from Cyclic Co…
Quantum error correction requires the use of error syndromes derived from measurements that may be unreliable. Recently, quantum data-syndrome (QDS) codes have been proposed as a possible approach to protect against both data and syndrome…
This paper introduces a construction of quantum CSS codes from a tuple of component CSS codes and two collections of subsets. The resulting codes have parallelizable encoding and syndrome measurement circuits and built-in redundancy in the…
In the previous research by Grassl, Huber and Winter, they proved a theorem which can make entanglement-assisted quantum error-correcting codes (EAQECC) from general quantum error-correcting codes (QECC). In this paper, we prove that the…
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes,…
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…
We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric…
We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances…
Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is…
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This…
Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an…
We introduce a Steane-like enlargement procedure for entanglement-assisted quantum error-correcting codes (EAQECCs) obtained by considering Euclidean inner product. We give formulae for the parameters of these enlarged codes and apply our…
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…
A major difficulty in quantum computation is the ability to implement fault tolerant computations, protecting information against undesired interactions with the environment. Stabiliser codes were introduced as a means to protect…
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…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
We prove that the known formulae for computing the optimal number of maximally entangled pairs required for entanglement-assisted quantum error-correcting codes (EAQECCs) over the binary field hold for codes over arbitrary finite fields as…
We present a protocol for generating entanglement over long distances in a two-dimensional quantum network based on the surface error-correction code. This protocol requires a fixed number of quantum memories at each node of the network and…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…