Quantum error detection .II. Bounds

DOI10.1109/18.841163MaRDI QIDQ4503582zbMATH OpenOpenAlexFDO

Authors Alexei Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn

Publication date 7 September 2000

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

Full work available at URL https://arxiv.org/abs/quant-ph/9906131

zbMATH Keywords

probability of undetected errorquantum codesself-orthogonal codes

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Error probability in coding theory (94B70)

Abstract: In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.

Recommendations

• Quantum error detection .I. Statement of the problem
• Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
• Upper bounds on the size of quantum codes
• Quantum error correction via codes over GF(4)
• Quantum shadow enumerators

Cited in

(20)

• On bounds for quantum error correcting codes over EJ-integers
• On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
• On the distance of stabilizer quantum codes from \(J\)-affine variety codes
• The asymptotic probability distribution of the relative distance of additive quantum codes
• Quantum codes from a new construction of self-orthogonal algebraic geometry codes
• 2-designs and redundant syndrome extraction for quantum error correction
• Stabilizer quantum codes defined by trace-depending polynomials
• Strengthened quantum Hamming bound
• Quantum Event-Error Detection Codes
• Trade-off between the tolerance of located and unlocated errors in nondegenerate quantum error-correcting codes
• Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
• Quantum shadow enumerators
• Monotonicity of the quantum linear programming bound
• Quantum error detection .I. Statement of the problem
• Upper bounds on the size of quantum codes
• A family of degenerate codes for depolarizing channels
• scientific article; zbMATH DE number 5235447 (Why is no real title available?)
• Steane enlargement of entanglement-assisted quantum error-correcting codes
• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• Asymptotic error rates in quantum hypothesis testing

This page was built for publication: Quantum error detection .II. Bounds

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