On the hardness of the minimum distance problem of quantum codes

DOI10.1109/TIT.2023.3286870MaRDI QIDQ6574965zbMATH OpenFDO

Authors Upendra Kapshikar, Srijita Kundu

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cited in

(1)

• Girth analysis of quantum quasi-cyclic LDPC codes

This page was built for publication: On the hardness of the minimum distance problem of quantum codes

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