On the hardness of approximating distances of quantum codes

DOI10.4230/LIPICS.FSTTCS.2025.34MaRDI QIDQ7391909zbMATH OpenFDO

Authors Elena Grigorescu, Vatsal Jha, Eric Samperton

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2025.34

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A Deterministic Reduction for the Gap Minimum Distance Problem
• A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
• Error Correcting Codes in Quantum Theory
• Five infinite families of binary cyclic codes and their related codes with good parameters
• Graph states for quantum secret sharing
• Hardness of approximating the minimum distance of a linear code
• Homological product codes
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• Majorana fermion codes
• Multiparty entanglement in graph states
• New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ n log ^k n ) distance
• On the hardness of the minimum distance problem of quantum codes
• On the inherent intractability of certain coding problems (Corresp.)
• Quantum error correction via codes over GF(4)
• Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
• The history of degenerate (bipartite) extremal graph problems
• The intractability of computing the minimum distance of a code

This page was built for publication: On the hardness of approximating distances of quantum codes

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