Quantum Tanner codes
From MaRDI portal
Cited in
(7)- NLTS Hamiltonians and strongly-explicit SoS lower bounds from low-rate quantum LDPC codes
- Enhanced Lieb-Robinson bounds for commuting long-range interactions
- When can an expander code correct (n) errors in O(n) time?
- Good locally testable codes
- Optimal locality and parameter tradeoffs for subsystem codes
- Algebra is half the battle: verifying presentations of graded unipotent Chevalley groups
- Testing tensor products of algebraic codes
This page was built for publication: Quantum Tanner codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943003)