# On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets

## TL;DR

This paper explores Steane-enlargement of quantum codes derived from Cartesian product point sets, providing bounds, algorithms, and examples that demonstrate improved parameters surpassing existing codes and bounds.

## Contribution

It introduces bounds and an algorithm for Steane-enlargement of quantum codes from Cartesian products, showing improved code parameters and surpassing known bounds.

## Key findings

- Enlarged codes have increased dimensions with advantageous parameters.
- Several codes match or exceed the Gilbert-Varshamov bound.
- Examples demonstrate the effectiveness of the enlargement technique.

## Abstract

In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously considered by Galindo et al. in [4]. We give bounds on the dimension increase obtained via enlargement, and additionally give an algorithm to compute the true increase. A number of examples of codes are provided, and their parameters are compared to relevant codes in the literature, which shows that the parameters of the enlarged codes are advantageous. Furthermore, comparison with the Gilbert-Varshamov bound for stabilizer quantum codes shows that several of the enlarged codes match or exceed the parameters promised by the bound.