Beyond the Hashing Limit of Quantum Pauli Channels
This paper demonstrates that generalized Bacon-Shor codes and quantum low-density parity-check constructions can surpass the fundamental hashing limit and, under certain conditions, the asymptotic quantum Singleton bound for quantum Pauli channels, particularly in low-rate schemes and biased noise environments.