Numerical techniques for finding the distances of quantum codes

@article{Dumer2014NumericalTF,
title={Numerical techniques for finding the distances of quantum codes},
author={Ilya Dumer and Alexey A. Kovalev and Leonid P. Pryadko},
journal={2014 IEEE International Symposium on Information Theory},
year={2014},
pages={1086-1090}
}
• Published 1 May 2014
• Computer Science
• 2014 IEEE International Symposium on Information Theory
We survey the existing techniques for calculating code distances of classical codes and apply these techniques to generic quantum codes. For classical and quantum LDPC codes, we also present a new linked-cluster technique. It reduces complexity exponent of all existing deterministic techniques designed for codes with small relative distances (which include all known families of quantum LDPC codes), and also surpasses the probabilistic technique for sufficiently high code rates.
6 Citations
Distance verification for LDPC codes
• Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
This work re-designs the existing generic algorithms of distance verification and derives their complexity for LDPC codes and obtains new complexity bounds with provable performance expressed in terms of the erasure-correcting thresholds of longLDPC codes.
Thresholds for Correcting Errors, Erasures, and Faulty Syndrome Measurements in Degenerate Quantum Codes.
• Computer Science
Physical review letters
• 2015
This work gives explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with logarithmic or larger distances that are parametrically better than the existing analytical bound based on percolation.
Numerical and analytical bounds on threshold error rates for hypergraph-product codes
• Computer Science
Physical Review A
• 2018
Analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes are studied, with a simple model of independent X and Z errors.
Lattice Codes with Built in Dynamical Protection for Solid State Quantum Computation
• Computer Science
• 2014
Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any oenalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.
Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank
• Mathematics
Journal of Mathematical Physics
• 2019
We consider pairs of few-body Ising models where each spin enters a bounded number of interaction terms (bonds), such that each model can be obtained from the dual of the other after freezing $k$
Homology-changing percolation transitions on finite graphs
• Mathematics
Journal of Mathematical Physics
• 2022
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$.

References

SHOWING 1-10 OF 47 REFERENCES
Sparse-graph codes for quantum error correction
• Computer Science
IEEE Transactions on Information Theory
• 2004
Sparse-graph codes appropriate for use in quantum error-correction are presented and some of the codes are believed to be unsurpassed by previously publishedquantum error-correcting codes.
Quantum Error Correction Via Codes Over GF
• Computer Science
• 1998
The problem of finding quantum-error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner
On the iterative decoding of sparse quantum codes
• Computer Science
Quantum Inf. Comput.
• 2008
These results indicate that the main source of errors in the quantum coding scheme remains in the decoding, and propose heuristic methods to improve belief propagation decoding specifically targeted at these two problems.
New constructions of CSS codes obtained by moving to higher alphabets
• Computer Science
ArXiv
• 2012
This work generalizes a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to KHIS11a and applies it in particular to toric codes to obtain codes with better rates and improve dramatically the performance of standard iterative decoding.
Quantum Error Correction Beyond the Bounded Distance Decoding Limit
• Computer Science
IEEE Transactions on Information Theory
• 2012
The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes and outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder.
Quantum Error Correction Via Codes Over GF(4)
• Computer Science, Physics
IEEE Trans. Inf. Theory
• 1998
In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
• Computer Science
• 2013
It is shown that any family of LDPC codes, quantum or classical, where distance scales as a positive power of the block length, can correct all errors with certainty if the error rate per (qu)bit is sufficiently small.
Homological product codes
• Computer Science
STOC
• 2014
This work proposes the first family of good quantum codes with low-weight stabilizers, and conjecture that similar methods can produce good stabilizer codes with stabilizer weight O(nα) for any α > 0.
Improved quantum hypergraph-product LDPC codes
• Computer Science
2012 IEEE International Symposium on Information Theory Proceedings
• 2012
The rotated lattices specified by two integer-valued periodicity vectors are introduced for the usual toric codes and several related algebraic constructions are suggested which increase the rate of the existing hypergraph-product codes by up to four times.
Quantum LDPC codes with positive rate and minimum distance proportional to n½
• Computer Science
ISIT
• 2009
This work builds quantum LDPC codes with fixed non-zero rate and proves that their minimum distance grows proportionally to the square root of the blocklength.