暂无分享,去创建一个
[1] J. Preskill,et al. Topological quantum memory , 2001, quant-ph/0110143.
[2] David J. C. MacKay,et al. Sparse-graph codes for quantum error correction , 2004, IEEE Transactions on Information Theory.
[3] Peter Gabriel,et al. Finite dimensional algebras , 1986 .
[4] Omar Fawzi,et al. Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[5] Noga Alon,et al. Explicit Expanders of Every Degree and Size , 2020, Combinatorica.
[6] L. Pryadko,et al. Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates. , 2018, Physical review letters.
[7] Roxana Smarandache,et al. Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds , 2009, IEEE Transactions on Information Theory.
[8] Martin Suchara,et al. Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code , 2014, 1405.4883.
[9] Matthew B. Hastings,et al. Homological product codes , 2013, STOC.
[10] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[11] Jeongwan Haah,et al. Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes , 2020, STOC.
[12] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[13] Doron Puder,et al. Expansion of random graphs: new proofs, new results , 2012, 1212.5216.
[14] Tali Kaufman,et al. Decodable quantum LDPC codes beyond the √n distance barrier using high dimensional expanders , 2020, SIAM Journal on Computing.
[15] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[16] Hideki Imai,et al. Quantum Quasi-Cyclic LDPC Codes , 2007, 2007 IEEE International Symposium on Information Theory.
[17] Patrick Solé,et al. On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots , 2006, Des. Codes Cryptogr..
[18] Daniel Gottesman,et al. Fault-tolerant quantum computation with constant overhead , 2013, Quantum Inf. Comput..
[19] Shor,et al. Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[20] Jeongwan Haah. Local stabilizer codes in three dimensions without string logical operators , 2011, 1101.1962.
[21] Soon Xin Ng,et al. Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies , 2015, IEEE Access.
[22] Gilles Zémor,et al. Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength , 2009, IEEE Transactions on Information Theory.
[23] Steane,et al. Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.
[24] L. Pryadko,et al. Quantum Kronecker sum-product low-density parity-check codes with finite rate , 2012, 1212.6703.
[25] J. Thorpe. Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .
[26] M. Freedman,et al. Z(2)-Systolic Freedom and Quantum Codes , 2002 .
[27] Paul H. Siegel,et al. Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes , 2012, IEEE Transactions on Information Theory.
[28] Pavel Panteleev,et al. Degenerate Quantum LDPC Codes With Good Finite Length Performance , 2019, Quantum.
[29] Matthew B. Hastings,et al. Weight reduction for quantum codes , 2016, Quantum Inf. Comput..
[30] Joel Friedman,et al. A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.
[31] Gilles Zémor,et al. Quantum LDPC codes with positive rate and minimum distance proportional to n½ , 2009, ISIT.
[32] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[33] Alexander Barg,et al. Error exponents of expander codes , 2002, IEEE Trans. Inf. Theory.
[34] R. M. Tanner,et al. A Class of Group-Structured LDPC Codes , 2001 .
[35] Earl T. Campbell,et al. A theory of single-shot error correction for adversarial noise , 2018, Quantum Science and Technology.
[36] Alexandra Kolla,et al. On the Expansion of Group-Based Lifts , 2013, APPROX-RANDOM.