# Quantum low-weight check (QLWC) code[1]

## Description

Member of a family of \([[n,k,d]]\) modular-qudit or Galois-qudit stabilizer codes for which the number of sites participating in each stabilizer generator is bounded by a constant as \(n\to\infty\).

## Parent

## Child

- Quantum low-density parity-check (QLDPC) code — QLDPC codes are QLWC codes for which the number of stabilizer generators that each site participates in is bounded by a constant as \(n\to\infty\).

## Cousins

- Unary code — A family of approximate non-stabilizer QLWC codes with linear distance and rate has been constructed [1] using unary codes that arise from the Feynman-Kitaev clock construction [2].
- Approximate quantum error-correcting code (AQECC) — A family of approximate non-stabilizer QLWC codes with linear distance and rate has been constructed [1] using unary codes that arise from the Feynman-Kitaev clock construction [2].

## References

- [1]
- C. Nirkhe, U. Vazirani, and H. Yuen, “Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground States”, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany (2018) arXiv:1802.07419 DOI
- [2]
- A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation (American Mathematical Society, 2002) DOI

## Page edit log

- Victor V. Albert (2023-11-16) — most recent

## Cite as:

“Quantum low-weight check (QLWC) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/qlwc