Quantum error-correcting codes are crucial for quantum computing and communication. Currently, these codes are mainly categorized into additive, non-additive, and surface codes. Additive and non-additive codes utilize one or more invariant subspaces of the stabilizer G to construct quantum codes. Therefore, the selection of these invariant subspaces is a key issue. In this paper, we propose a solution to this problem by introducing quotient space codes and a construction method for quotient space quantum codes. This new framework unifies additive and non-additive quantum codes. We demonstrate the codeword stabilizer codes as a special case within this framework and supplement its error-correction distance. Furthermore, we provide a simple proof of the Singleton bound for this quantum code by establishing the code bound of quotient space codes and discuss the code bounds for pure and impure codes. The quotient space approach offers a concise and clear mathematical form for the study of quantum codes.

翻译：量子纠错码对于量子计算和量子通信至关重要。目前，这些码主要分为加法码、非加法码和表面码。加法码和非加法码利用稳定子群G的一个或多个不变子空间来构造量子码。因此，这些不变子空间的选择是一个关键问题。本文通过引入商空间码和商空间量子码的构造方法，提出了该问题的一个解决方案。这一新框架统一了加法量子码和非加法量子码。我们将码字稳定子码证明为该框架的一个特例，并补充了其纠错距离。此外，通过建立商空间码的码界，我们为这类量子码提供了Singleton界的简洁证明，并讨论了纯码与不纯码的码界。商空间方法为量子码的研究提供了一种简洁清晰的数学形式。