Here is a list of QLDPC codes.
Code Description
Balanced product code Family of CSS quantum codes based on products of two classical codes which share common symmetries. The balanced product can be understood as taking the usual tensor/hypergraph product and then factoring out the symmetries factored. This reduces the overall number of physical qubits $$n$$, while, under certain circumstances, leaving the number of encoded qubits $$k$$ and the code distance $$d$$ invariant. This leads to a more favourable encoding rate $$k/n$$ and normalized distance $$d/n$$ compared to the tensor/hypergraph product.
Crystalline-circuit code Code dynamically generated by unitary Clifford circuits defined on a lattice with some crystalline symmetry. A notable example is the circuit defined on a rotated square lattice with vertices corresponding to iSWAP gates and edges decorated by $$R_X[\pi/2]$$, a single-qubit rotation by $$\pi/2$$ around the $$X$$-axis. This circuit is invariant under space-time translations by a unit cell $$(T, a)$$ and all transformations of the square lattice point group $$D_4$$.
Dinur-Hsieh-Lin-Vidick (DHLV) code Stub.
Distance-balanced code CSS code constructed from a CSS code and a classical code using a distance-balancing procedure based on a generalized homological product. The initial code is said to be unbalanced, i.e., tailored to noise biased toward either bit- or phase-flip errors, and the procedure can result in a code that is treats both types of errors on a more equal footing. The original distance-balancing procedure [1], later generalized in Ref. [2], can yield QLDPC codes; see Thm. 1 in Ref. [1].
Expander lifted-product code Family of $$G$$-lifted product codes constructed using two random classical Tanner codes defined on expander graphs. For certain parameters, this construction yields the first asymptotically good QLDPC codes. Classical codes resulting from this construction are one of the first two families of $$c^3$$-LTCs.
Fiber-bundle code Also called a twisted product code. CSS code constructed by combining a random LDPC code as the base and a cyclic repetition code as the fiber of a fiber bundle. After applying distance balancing, a QLDPC code with distance $$\Omega(n^{3/5}\text{polylog}(n))$$ and rate $$\Omega(n^{-2/5}\text{polylog}(n))$$ is obtained.
Floquet code Dynamically-generated stabilizer-based code whose logical qubits are generated through a particular sequence of check-operator measurements such that the number of logical qubits is larger than when the code is viewed as a static subsystem stabilizer code. After each measurement in the sequence, the codespace is a joint $$+1$$ eigenspace of an instantaneous stabilizer group (ISG), i.e., a particular stabilizer group corresponding to the measurement. The ISG specifies the state of the system as a Pauli stabilizer state at a particular round of measurement, and it evolves into a (potentially) different ISG depending on the check operators measured in the next step in the sequence. As opposed to subsystem codes, only specific measurement sequences maintain the codespace.
Floquet color code Stub.
Fracton code A code whose codewords make up the ground-state space of a fracton-phase Hamiltonian.
Generalized homological product CSS code Qubit, modular-qudit, or Galois-qudit generalized homological product code of CSS type.
Generalized homological product code Stabilizer code formulated in terms a chain complex consisting of some type of product of other chain complexes. The CSS-to-homology correspondence yields an interpretation of codes in terms of manifolds, thus allowing for the use of various products from topology in constructing codes. The codes participating in the product can be quantum, classical, or mixed. Products can be of more than two codes, in which case the output code need not be of CSS type (e.g., for XYZ-product codes). The simplest product is a tensor product, with more general products imposing equivalence or symmetry relations on the outputs of the tensor product. A product of two codes can be interpreted as a fiber bundle, with one element of the product being the base and the other being the fiber.
Good QLDPC code Also called asymptotically good QLDPC codes. A family of QLDPC codes $$[[n_i,k_i,d_i]]$$ whose asymptotic rate $$\lim_{i\to\infty} k_i/n_i$$ and asymptotic distance $$\lim_{i\to\infty} d_i/n_i$$ are both positive.
Haah cubic code Class of stabilizer codes on a length-$$L$$ cubic lattice with one or two qubits per site. We also require that the stabilizer group $$\mathsf{S}$$ is translation invariant and generated by two types of operators with support on a cube. In the non-CSS case, these two are related by spatial inversion. For CSS codes, we require that the product of all corner operators is the identity. We lastly require that there are no non-trival ''string operators'', meaning that single-site operators are a phase, and any period one logical operator $$l \in \mathsf{S}^{\perp}$$ is just a phase. Haah showed in his original construction that there is exactly one non-CSS code of this form, and 17 CSS codes [3]. The non-CSS code is labeled code 0, and the rest are numbered from 1 - 17. Codes 1-4, 7, 8, and 10 do not have string logical operators [3][4].
Homological product code CSS code formulated using the homological product of two chain complexes (see CSS-to-homology correspondence). Stub.
Honeycomb Floquet code Floquet code inspired by the Kitaev honeycomb model [5] whose logical qubits are generated through a particular sequence of measurements.
Hypergraph product code A family of $$[[n,k,d]]$$ CSS codes whose construction is based on two binary linear seed codes $$C_1$$ and $$C_2$$.
Lifted-product (LP) code Also called a Panteleev-Kalachev (PK) code. Code that utilizes the notion of a lifted product in its construction. Lifted products of certain classical Tanner codes are the first (asymptotically) good QLDPC codes.
Quantum Tanner code Stub.
Quantum check-product code Stub.
Quantum convolutional code One-dimensional translationally invariant qubit stabilizer code whose whose stabilizer group can be partitioned into constant-size subsets of constant support and of constant overlap between neighboring sets. Initially formulated as a quantum analogue of convolutional codes, which were designed to protect a continuous and never-ending stream of information. Precise formulations sometimes begin with a finite-dimensional lattice, with the intent to take the thermodynamic limit; logical dimension can be infinite as well.
Quantum expander code CSS codes constructed from a hypergraph product of bipartite expander graphs with bounded left and right vertex degrees. For every bipartite graph there is an associated matrix (the parity check matrix) with columns indexed by the left vertices, rows indexed by the right vertices, and 1 entries whenever a left and right vertex are connected. This matrix can serve as the parity check matrix of a classical code. Two bipartite expander graphs can be used to construct a quantum CSS code (the quantum expander code) by using the parity check matrix of one as $$X$$ checks, and the parity check matrix of the other as $$Z$$ checks.
Quantum low-density parity-check (QLDPC) code Also called a sparse quantum code. Family of $$[[n,k,d]]$$ stabilizer codes for which the number of sites (either qubit or qudit) participating in each stabilizer generator and the number of stabilizer generators that each site participates in are both bounded by a constant as $$n\to\infty$$. A geometrically local stabilizer code is a QLDPC code where the sites involved in any syndrome bit are contained in a fixed volume that does not scale with $$n$$. As opposed to general stabilizer codes, syndrome extraction of the constant-weight check operators of a QLDPC codes can be done using a constant-depth circuit.
Quantum parity code (QPC) Also called a generalized Shor code [6]. A $$[[m_1 m_2,1,\min(m_1,m_2)]]$$ CSS code family obtained from concatenating an $$m_1$$-qubit phase-flip repetition code with an $$m_2$$-qubit bit-flip repetition code. Logical codewords are \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{2^{m_2/2}}\left(|0\rangle^{\otimes m_1}+|1\rangle^{\otimes m_1}\right)^{\otimes m_2}\\ |\overline{1}\rangle&=\frac{1}{2^{m_2/2}}\left(|0\rangle^{\otimes m_1}-|1\rangle^{\otimes m_1}\right)^{\otimes m_2}~. \end{split} \end{align}
Quantum repetition code Encodes $$1$$ qubit into $$n$$ qubits according to $$|0\rangle\to|\phi_0\rangle^{\otimes n}$$ and $$|1\rangle\to|\phi_1\rangle^{\otimes n}$$. Also known as a bit-flip code when $$|\phi_i\rangle = |i\rangle$$, and a phase-flip code when $$|\phi_0\rangle = |+\rangle$$ and $$|\phi_1\rangle = |-\rangle$$.
Ramanujan-complex product code CSS code constructed from a Ramanujan quantum code and an asymptotically good classical LDPC code using distance balancing. Ramanujan quantum codes are defined using Ramanujan complexes which are simplicial complexes that generalise Ramanujan graphs. Combining the quantum code obtained from a Ramanujan complex and a good classical LDPC code, which can be thought of as coming from a 1-dimensional chain complex, yields a new quantum code that is defined on a 2-dimensional chain complex. This 2-dimensional chain complex is obtained by the co-complex of the product of the 2 co-complexes. The length, dimension and distance of the new quantum code depend on the input codes.
Rotated surface code Also called a checkerboard code. CSS variant of the surface code defined on a square lattice that has been rotated 45 degrees such that qubits are on vertices, and both $$X$$- and $$Z$$-type check operators occupy plaquettes in an alternating checkerboard pattern.
Surface-17 code A $$[[9,1,3]]$$ rotated surface code named for the sum of its 9 data qubits and 8 syndrome qubits. It uses the smallest number of qubits to perform error correction on a surface code with parallel syndrome extraction.
Tensored-Ramanujan-complex product code Code constructed in a similar way as the Ramanujan-complex product code, but utilizing tensor products of Ramanujan complexes in order to improve code distance from $$\sqrt{n}\log n$$ to $$\sqrt{n}~\text{polylog}(n)$$. The utility of such tensor products comes from the fact that one of the Ramanujan complexes is a collective cosystolic expander as opposed to just a cosystolic expander.
Translationally invariant stabilizer code A geometrically local qubit or qudit stabilizer code with qudits organized on a lattice modeled by the additive group $$\mathbb{Z}^D$$ for spatial dimension $$D$$ such that each lattice point, referred to as a site, contains $$m$$ qudits of dimension $$q$$. The stabilizer group of the translationally invariant code is generated by site-local Pauli operators and their translations.
Transverse-field Ising model (TFIM) code A 1D translationally invariant stabilizer code whose encoding is a constant-depth circuit of nearest-neighbor gates on alternating even and odd bonds that consist of transverse-field Ising Hamiltonian interactions. The code allows for perfect state transfer of arbitrary distance using local operations and classical communications (LOCC).
XYZ product code A non-CSS QLDPC code constructed from three classical codes. The construction of an XYZ product code is similar to that of a hypergraph product code and related codes. The idea is that rather than taking a product of only two classical codes to produce a CSS code, a third classical code is considered, acting with Pauli-$$Y$$ operators.
$$(5,1,2)$$-convolutional code Quantum convolutional code with the stabilizer generators \begin{align} \begin{array}{cccccccc} X & Z & I & I & I & I & I & \cdots\\ Z & X & X & Z & I & I & I & \cdots\\ I & Z & X & X & Z & I & I & \cdots\\ I & I & Z & X & X & Z & I & \cdots\\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots \end{array} \end{align}
$$[[9,1,3]]$$ Shor code Nine-qubit CSS code that is the smallest such code to correct a single-qubit error. Logical codewords are \begin{align} \begin{split} |\overline{0}\rangle&=\frac{1}{2\sqrt{2}}\left(|000\rangle+|111\rangle\right)^{\otimes3}\\ |\overline{1}\rangle&=\frac{1}{2\sqrt{2}}\left(|000\rangle-|111\rangle\right)^{\otimes3}~. \end{split} \end{align} The code works by concatenating each qubit of a phase-flip with a bit-flip repetition code. Therefore, the code can correct both type of errors simultaneously.

References

[1]
M. B. Hastings, “Weight Reduction for Quantum Codes”. 1611.03790
[2]
Shai Evra, Tali Kaufman, and Gilles Zémor, “Decodable quantum LDPC codes beyond the $\sqrt{n}$ distance barrier using high dimensional expanders”. 2004.07935
[3]
J. Haah, “Local stabilizer codes in three dimensions without string logical operators”, Physical Review A 83, (2011). DOI; 1101.1962
[4]
A. Dua et al., “Sorting topological stabilizer models in three dimensions”, Physical Review B 100, (2019). DOI; 1908.08049
[5]
A. Kitaev, “Anyons in an exactly solved model and beyond”, Annals of Physics 321, 2 (2006). DOI; cond-mat/0506438
[6]
Dave Bacon and Andrea Casaccino, “Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes”. quant-ph/0610088