Minimal distances for certain quantum product codes and tensor products of chain complexes
arXiv:2007.12152 · doi:10.1103/PhysRevA.102.062402
Abstract
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field. Homology groups of such a complex are described by the Künneth theorem. We give an explicit expression for the distances when one of the complexes is a linear map between two spaces. The codes in the construction, subsystem product codes and their gauge-fixed variants, generalize several known families of quantum error-correcting codes.
16 pages, no figures. An erratum is posted to fix Lemma.1. No other result is affected
References in corpus (13)
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Fault-tolerant quantum computation against biased noise
- Topological order in a 3D toric code at finite temperature
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Homological Error Correction: Classical and Quantum Codes
- Qudit surface codes and gauge theory with finite cyclic groups
- Asymmetric quantum error correction via code conversion
- Error correction optimisation in the presence of X/Z asymmetry
- 2-D Compass Codes
- Higher-dimensional quantum hypergraph-product codes
- Ability of stabilizer quantum error correction to protect itself from its own imperfection
- Quantum Codes from High-Dimensional Manifolds
- Optimal quantum subsystem codes in 2-dimensions