The Need for Structure in Quantum LDPC Codes
暂无分享,去创建一个
[1] A. Kitaev,et al. Quantum codes on a lattice with boundary , 1998, quant-ph/9811052.
[2] E. Knill,et al. Theory of quantum error-correcting codes , 1997 .
[3] Simon Litsyn,et al. Bounds on Spectra of Codes with Known Dual Distance , 1998, Des. Codes Cryptogr..
[4] Tali Kaufman,et al. Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders , 2014, ArXiv.
[5] Tali Kaufman,et al. High dimensional expanders and property testing , 2014, ITCS.
[6] Gilles Zémor,et al. Quantum Expander Codes , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[7] Alexander Lubotzky,et al. Expander graphs in pure and applied mathematics , 2011, 1105.2389.
[8] David J. C. MacKay,et al. Sparse-graph codes for quantum error correction , 2004, IEEE Transactions on Information Theory.
[9] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[10] D. Gottesman. An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation , 2009, 0904.2557.
[11] Nathan Linial,et al. Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[12] Dorit Aharonov,et al. Quantum Locally Testable Codes , 2013, SIAM J. Comput..
[13] Raymond Laflamme,et al. Quantum Analog of the MacWilliams Identities for Classical Coding Theory , 1997 .
[14] Matthew B. Hastings,et al. Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs , 2013, Quantum Inf. Comput..
[15] A. Nilli. On the second eigenvalue of a graph , 1991 .
[16] Tali Kaufman,et al. Bounded degree cosystolic expanders of every dimension , 2015, STOC.
[17] A. Steane. Multiple-particle interference and quantum error correction , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[18] A. Harrow,et al. Local Hamiltonians with No Low-energy Trivial States , 2015 .
[19] Lior Eldar,et al. Local Hamiltonians Whose Ground States Are Hard to Approximate , 2015, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[20] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[21] Aram Wettroth Harrow,et al. Product-state approximations to quantum ground states , 2013, STOC '13.
[22] Steane,et al. Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.
[23] Simon Litsyn,et al. Estimates for the range of binomiality in codes' spectra , 1997, IEEE Trans. Inf. Theory.
[24] H. Bombin,et al. Homological error correction: Classical and quantum codes , 2006, quant-ph/0605094.
[25] B. Terhal,et al. Tradeoffs for reliable quantum information storage in 2D systems , 2009, Quantum Cryptography and Computing.
[26] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[27] Dhruv Mubayi,et al. Inverse Expander Mixing for Hypergraphs , 2016, Electron. J. Comb..
[28] Ori Parzanchevski. Mixing in High-Dimensional Expanders , 2017, Comb. Probab. Comput..
[29] Ori Parzanchevski,et al. Isoperimetric inequalities in simplicial complexes , 2012, Comb..
[30] Alexey A. Frolov,et al. Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes , 2016, Probl. Inf. Transm..
[31] Eric M. Rains. Quantum Weight Enumerators , 1998, IEEE Trans. Inf. Theory.
[32] Dorit Aharonov,et al. The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} , 2014, Quantum Information Processing.
[33] Salah A. Aly,et al. A Class of Quantum LDPC Codes Constructed From Finite Geometries , 2007, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[34] Dorit Aharonov,et al. On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[35] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[36] Michael Lentmaier,et al. Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.
[37] Kejing Liu,et al. Design of near-optimum quantum error-correcting codes based on generator and parity-check matrices of LDGM codes , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.
[38] Matthew B. Hastings,et al. Quantum Codes from High-Dimensional Manifolds , 2016, ITCS.
[39] А Е Китаев,et al. Квантовые вычисления: алгоритмы и исправление ошибок@@@Quantum computations: algorithms and error correction , 1997 .
[40] Daniel Gottesman,et al. Fault-tolerant quantum computation with constant overhead , 2013, Quantum Inf. Comput..
[41] Shor,et al. Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[42] Dorit Aharonov,et al. The commuting local Hamiltonian on locally-expanding graphs is in NP. , 2013, 1311.7378.
[43] S. Litsyn,et al. Upper bounds on the size of quantum codes , 1997, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[44] Nathan Linial,et al. Homological Connectivity Of Random 2-Complexes , 2006, Comb..
[45] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian , 1969 .
[46] D. Spielman,et al. Expander codes , 1996 .
[47] A. Kitaev. Fault tolerant quantum computation by anyons , 1997, quant-ph/9707021.
[48] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[49] Alexander Lubotzky,et al. Ramanujan complexes and high dimensional expanders , 2012, 1301.1028.
[50] Robert B. Griffiths,et al. Quantum Error Correction , 2011 .
[51] Simon Litsyn,et al. Upper bounds on the rate of LDPC codes as a function of minimum distance , 2002, IEEE Transactions on Information Theory.
[52] H. Bombin,et al. An Introduction to Topological Quantum Codes , 2013, 1311.0277.
[53] N. Linial,et al. Lifts, Discrepancy and Nearly Optimal Spectral Gaps , 2003 .
[54] A. Lubotzky. HIGH DIMENSIONAL EXPANDERS , 2017, Proceedings of the International Congress of Mathematicians (ICM 2018).
[55] Isaac L. Chuang,et al. Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .
[56] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[57] M. Freedman,et al. Z(2)-Systolic Freedom and Quantum Codes , 2002 .
[58] B. Terhal,et al. A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes , 2008, 0810.1983.
[59] Nathan Linial,et al. Lifts, Discrepancy and Nearly Optimal Spectral Gap* , 2006, Comb..
[60] Matthew B. Hastings,et al. Homological product codes , 2013, STOC.
[61] I. Chuang,et al. Quantum Computation and Quantum Information: Bibliography , 2010 .
[62] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[63] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..
[64] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[65] J. Tillich,et al. Constructions and performance of classes of quantum LDPC codes , 2005, quant-ph/0502086.
[66] Gerhard Fettweis,et al. Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity , 2010, 2010 Information Theory and Applications Workshop (ITA).