Balanced Product Quantum Codes

DOI10.1109/TIT.2021.3097347MaRDI QIDQ5032526zbMATH OpenOpenAlexFDO

Authors Nikolas P. Breuckmann, Jens Niklas Eberhardt

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Abstract: This work provides the first explicit and non-random family of $[[N,K,D]]$ LDPC quantum codes which encode $KinTheta(N^{f}rac45)$ logical qubits with distance $DinOmega(N^{f}rac35)$. The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the $operatornamepolylog(N)sqrtN$ distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have $KinTheta(N)$ and that we conjecture to have linear distance $DinTheta(N)$.

Cited in

(16)

• On quantum SPC product codes
• A linear-algebraic and lattice-theoretical look at the Cleaning Lemma of quantum coding theory
• scientific article; zbMATH DE number 6001555 (Why is no real title available?)
• A construction of combinatorial NLTS
• Single-shot decoding of good quantum LDPC codes
• Nowhere to go but high: a perspective on high-dimensional expanders
• Homological quantum rotor codes: logical qubits from torsion
• Good quantum LDPC codes with linear time decoders
• NLTS Hamiltonians from good quantum codes
• Transversal diagonal logical operators for stabiliser codes
• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
• Coboundary and cosystolic expansion without dependence on dimension or degree
• When can an expander code correct (n) errors in O(n) time?
• Cups and gates. I: Cohomology invariants and logical quantum operations
• Good locally testable codes

This page was built for publication: Balanced Product Quantum Codes

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