Classical low-density parity-check (LDPC) codes were first introduced by Robert Gallager in the 1960's and have reemerged as one of the most influential coding schemes.We present new families of quantum low-density parity-check error-correcting codes derived from regular tessellations of Platonic 2-manifolds and from embeddings of the Lubotzky-Phillips-Sarnak Ramanujan graphs.These families of quantum error-correcting codes answer a conjecture proposed by MacKay about the existence of good families of quantum low-density parity-check codes with nonzero rate, increasing minimum distance and a practical decoder.For both families of codes, we present a logarithmic lower bound on the shortest noncontractible cycle of the tessellations and therefore on their distance.Note that a logarithmic lower bound is the best known in the theory of regular tessellations of 2-manifolds.We show their asymptotic sparsity and non-zero rate.In addition, we show their decoding performance with simulations using belief propagation.Furthermore, we present a general geometrical model to design non-additive quantum error-correcting codes for the amplitude-damping channel.Non-additive quantum error-correcting codes are more general than stabilizer or additive quantum errorcorrecting codes, and in some cases non-additive quantum codes are more optimal.As an example, we provide an 8-qubit amplitude-damping code, which can encode 1 qubit and correct for 2 errors.This violates the quantum Hamming bound which requires that its length start at 9.
Classical low-density parity-check (LDPC) codes were first introduced by Robert Gallager in the 1960's and have reemerged as one of the most influential coding schemes.We present new families of quantum low-density parity-check error-correcting codes derived from regular tessellations of Platonic 2-manifolds and from embeddings of the Lubotzky-Phillips-Sarnak Ramanujan graphs.These families of quantum error-correcting codes answer a conjecture proposed by MacKay about the existence of good families of quantum low-density parity-check codes with nonzero rate, increasing minimum distance and a practical decoder.For both families of codes, we present a logarithmic lower bound on the shortest noncontractible cycle of the tessellations and therefore on their distance.Note that a logarithmic lower bound is the best known in the theory of regular tessellations of 2-manifolds.We show their asymptotic sparsity and non-zero rate.In addition, we show their decoding performance with simulations using belief propagation.Furthermore, we present a general geometrical model to design non-additive quantum error-correcting codes for the amplitude-damping channel.Non-additive quantum error-correcting codes are more general than stabilizer or additive quantum errorcorrecting codes, and in some cases non-additive quantum codes are more optimal.As an example, we provide an 8-qubit amplitude-damping code, which can encode 1 qubit and correct for 2 errors.This violates the quantum Hamming bound which requires that its length start at 9.
Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When one enforces both orthogonality and regularity in a straightforward manner, the girth is typically reduced and the minimum distance becomes structurally upper bounded. In this work, we overcome this limitation by using permutation matrices with controlled commutativity and by restricting the orthogonality constraints to only the active part of the construction, while preserving regular check-matrix structures. This design circumvents conventional structural distance limitations induced by parent-matrix orthogonality, and enables the construction of quantum LDPC codes with large girth while avoiding latent low-weight logical operators. As a concrete demonstration, we construct a girth-8, (3,12)-regular [[9216,4612,≤48]] quantum LDPC code and show that, under BP decoding combined with a low-complexity post-processing algorithm, it achieves a frame error rate as low as 10−8 on the depolarizing channel with error probability 4%.
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, distance scaling as$n^\epsilon for\epsilon > 0andefficientdecodingschemes.Thecodefamilyisbasedontessellationsofclosed,four−dimensional,hyperbolicmanifolds,asfirstsuggestedbyGuthandLubotzky.ThemaincontributionofthisworkistheconstructionofsuitablemanifoldsviafinitepresentationsofCoxetergroups,theirlinearrepresentationsoverGaloisfieldsandtopologicalcoverings.Weestablishalowerboundontheencodingratek/n$of$13/72 = 0.180\ldots $and we show that the bound is tight for the examples that we construct. Numerical simulations give evidence that parallelizable decoding schemes of low computational complexity suffice to obtain high performance. These decoding schemes can deal with syndrome noise, so that parity check measurements do not have to be repeated to decode. Our data is consistent with a threshold of around 4% in the phenomenological noise model with syndrome noise in the single-shot regime.
This article develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error-correction performance, high rates, and low decoding complexity. The proposed method produces several infinite families of codes with a wide variety of parameters and entanglement requirements. Our framework encompasses the previously known entanglement-assisted quantum LDPC codes having the best error-correction performance and many other codes with better block error rates in simulations over the depolarizing channel. We also determine important parameters of several well-known classes of quantum and classical LDPC codes for previously unsettled cases.
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 performance is sub-optimal with a quaternary belief propagation (BP) decoder due to unavoidable short cycles in their Tanner graphs. In this paper, we propose a novel joint code and decoder design for QLDPC codes. The constructed codes have a minimum distance of about the square root of the block length. In addition, it is, to the best of our knowledge, the first QLDPC code family where BP decoding is not impaired by short cycles of length 4. This is achieved by using an ensemble BP decoder mitigating the influence of assembled short cycles. We outline two code construction methods based on classical quasi-cyclic codes and finite geometry codes. Numerical results demonstrate outstanding decoding performance over depolarizing channels.
Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to establish code families with constant encoding rate and linear distance, simultaneously achieving optimal asymptotic scaling in both parameters. In particular, we characterize explicit logical representatives of the full gauged code space, and provide a fundamental treatment of non-Abelian code distance in the sense of Knill--Laflamme based on combining expansion with cleaning to establish protection against arbitrary errors. We further construct an almost-good family with entire code spaces exhibiting long-range magic. Moreover, we use linearly addressable cup product to directly generate linearly many encoded magic states from gauging measurements of Clifford operators. These results extend good qLDPC codes beyond the Pauli stabilizer setting, lay the foundation for pursuing the no low-energy trivial magic conjecture and shed light on non-Abelian quantum phases and orders beyond geometric locality.
Noise is a major obstacle in the development of practical schemes for quantum computation and communication. Similar to the case of classical communication, this noise can be protected against by employing a code, which provides a means for encoding quantum states prior to transmission and allows for errors to be inferred, and hopefully corrected, by a decoder at the receiver. Unfortunately, designing good codes and decoders is typically a difficult problem. This thesis focuses on developing low-complexity heuristic approaches to three such problems: the design of modified belief propagation decoders for quantum low-density parity-check codes, the design of stabilizer codes for asymmetric channels, and the design of codeword stabilized codes. Quantum low-density parity-check codes are stabilizer codes with low-weight generators. Such codes permit low-complexity decoding via the use of belief propagation, which is an iterative message passing algorithm that takes place on a factor graph defined by the code. However, the performance of such a decoder is limited both by code structure and the degenerate nature of quantum errors. To overcome these limitations, at least in part, a number of modifications to belief propagation are developed. Central among these is the augmented decoder, which in the case of a decoding error, iteratively reattempts decoding using modified factor graph. This heuristic modification simply involves the duplication of a randomly selected subset of the graph’s check nodes, which are in one-to-one correspondence with the code’s stabilizer generators. Across a range of codes, it is shown that the decoders developed perform as well as or better than other modified decoders presented in literature. For a number of channels of physical interest, phase-flip errors occur far more frequently than bit-flip errors. When transmitting across these so-called asymmetric channels, the decoding error rate can be minimized by tailoring the code used to the channel. However, assessing the performance of codes on a given channel is made difficult by the #P-completeness of optimal decoding. To address this complexity, it is shown that the decoding error rate can be accurately approximated using only a small fraction of the possible errors caused by the channel. This approximation is then used to identify a number of cyclic stabilizer codes that perform well on two different asymmetric channels. To further build on this, a heuristic is demonstrated for assessing code performance based on the decoding error rate of an associated classical code. The complexity of calculating this classical error rate is relatively low, and it is shown that it can be used as the basis for a hill-climbing search algorithm. Such searches have yielded a large number of highly performant codes satisfying various structure constraints. The family of codeword stabilized codes encompasses both the stabilizer codes as well as many of the best known nonadditive codes. Constructing a standard form codeword stabilized code is a matter of selecting a simple undirected graph and a binary classical code. This makes designing optimal codes difficult as the number of possible graphs grows exponentially with code length, and the clique search required to construct the classical code is NP-hard. To address the exponential growth of the search space, a heuristic is developed for assessing graphs. This heuristic is then employed by a genetic algorithm that also makes use of a novel crossover operation based on spectral bisection, which is show to be superior to more standard crossover operations. With a graph selected, it is demonstrated that the complexity of the clique search required to construct the associated classical code can be mitigated through the use of a heuristic clique finding algorithm. A number of best known codes are presented that have been found using this approach.