The asymptotic probability distribution of the relative distance of additive quantum codes

DOI10.1016/J.JMAA.2007.08.023MaRDI QIDQ2467792zbMATH OpenOpenAlexFDO

Authors Yuefei Ma

Publication date 28 January 2008

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmaa.2007.08.023

zbMATH Keywords

additive quantum error-correcting codesbinary codesquantum Gilbert-Varshamov bound

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60)

Review text

For given information rate \(R\), it is proved as \(n\) tends to infinity, that almost all additive \(n,n\cdot R\) quantum codes (pure and impure) are the codes with their relative distance tending to \(h^{-1}(1-R)\), where \(h(x)=-x\log^{x/3}_2-(1-x)\log^{1-x}_2\) is an entropy function.

Recommendations

• scientific article; zbMATH DE number 1406138
• Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
• Distance Distribution of Binary Codes and the Error Probability of Decoding
• Asymptotic bounds on quantum codes from algebraic geometry codes
• \(\mathbb{Z}_p \mathbb{Z}_p[v]\)-additive cyclic codes are asymptotically good

Cites work

• A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes
• Error Correcting Codes in Quantum Theory
• Fundamentals of Error-Correcting Codes
• Nonbinary quantum stabilizer codes
• Quantum Error Correction and Orthogonal Geometry
• Quantum error correction via codes over GF(4)
• Quantum error detection .II. Bounds
• The intractability of computing the minimum distance of a code
• Upper bounds on the size of quantum codes

This page was built for publication: The asymptotic probability distribution of the relative distance of additive quantum codes

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