On tensor products of CSS codes

DOI10.4171/AIHPD/71MaRDI QIDQ2421732zbMATH OpenWikidataFDO

Authors Benjamin Audoux, Alain Couvreur

Publication date 18 June 2019

Published in Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.07081

zbMATH Keywords

tensor productCSS codesquantum codeschain complexes

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Other types of codes (94B60) Chain complexes in algebraic topology (55U15) Tensor products in functional analysis (46M05)

Abstract: CSS codes are in one-to-one correspondance with length 3 chain complexes. The latter are naturally endowed with a tensor product $otimes$ which induces a similar operation on the former. We investigate this operation, and in particular its behavior with regard to minimum distances. Given a CSS code $mathcalC$, we give a criterion which provides a lower bound on the minimum distance of $mathcalCotimesmathcalD$ for every CSS code $mathcalD$. We apply this result to study the behaviour of iterated tensor powers of codes. Such sequences of codes are logarithmically LDPC and we prove in particular that their minimum distances tend generically to infinity. Different known results are reinterpretated in terms of tensor products. Three new families of CSS codes are defined, and their iterated tensor powers produce LDPC sequences of codes with length $n$, row weight in $O(logn)$ and minimum distances larger than $n^{fracalpha2}$ for any $alpha<1$. One family produces sequences with dimensions larger than $$ for any $$.

Recommendations

• An application of Khovanov homology to quantum codes
• A note on the minimum distance of quantum LDPC codes
• Homological product codes
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• A construction of quantum turbo product codes based on CSS-type quantum convolutional codes

Cites work

• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 595200 (Why is no real title available?)
• scientific article; zbMATH DE number 1972882 (Why is no real title available?)
• scientific article; zbMATH DE number 1796840 (Why is no real title available?)
• A Construction of Quantum LDPC Codes From Cayley Graphs
• An application of Khovanov homology to quantum codes
• Design of capacity-approaching irregular low-density parity-check codes
• Fault-tolerant quantum computation by anyons
• Homological error correction: Classical and quantum codes
• Homological product codes
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Multiple-particle interference and quantum error correction
• On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction
• On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• Projective plane and planar quantum codes
• Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
• Quantum Reed-Muller codes
• Quantum computation and quantum information. 10th anniversary edition

Cited in

(2)

• Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
• Homological quantum rotor codes: logical qubits from torsion

This page was built for publication: On tensor products of CSS codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2421732)