Fetching the paper…
Reading the bibliography…
We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups.
1911
Earlier work this paper cites.
P. J. Hilton and S. Wylie, “Homology theory of a simplicial complex,” in Homology Theory: An Introduction to Algebraic Topology . Cambridge: Cambridge University Press, 1960, pp. 53–94
1960
Earlier work this paper cites.
R. G. Gallager, Low-density parity-check codes . M.I.T. Press, Cambridge, MA, 1963
1963
Earlier work this paper cites.
J. Wolf, “On codes derivable from the tensor product of check matrices,” IEEE Transactions on Information Theory , vol. 11, no. 2, pp. 281–284, Apr. 1965
1965
Earlier work this paper cites.
E. R. Berlekamp, Algebraic Coding Theory . New York: McGraw-Hill, 1968
1968
Earlier work this paper cites.
R. Chien and S. Ng, “Dual product codes for correction of multiple low-density burst errors,” IEEE Transactions on Information Theory , vol. 19, no. 5, pp. 672–677, Sep. 1973
1973
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes , 1st ed. Amsterdam: North Holland Publishing Co., Jan. 1977
1977
Earlier work this paper cites.
R. Tanner, “A recursive approach to low complexity codes,” Information Theory, IEEE Transactions on , vol. 27, no. 5, pp. 533–547, 1981
1981
Earlier work this paper cites.
K. S. Brown, “Some homological algebra,” in Cohomology of Groups , ser. Graduate Texts in Mathematics, K. S. Brown, Ed. New York, NY: Springer, 1982, pp. 4–32
1982
Earlier work this paper cites.
J. L. Gross and T. W. Tucker, Topological graph theory , ser. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, 1987
1987
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan graphs,” Combinatorica , vol. 8, no. 3, pp. 261–277, Sep. 1988. [Online]. Available: https://doi.org/10.1007/BF02126799
1988
Earlier work this paper cites.
G. A. Margulis, “Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators,” Problemy peredachi informatsii , vol. 24, no. 1, pp. 51–60, 1988
1988
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, pp. 1098–1105, Aug 1996. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.54.1098
1996
Earlier work this paper cites.
A. M. Steane, “Error correcting codes in quantum theory,” Phys. Rev. Lett. , vol. 77, pp. 793–797, Jul 1996. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.77.793
1996
Earlier work this paper cites.
M. Sipser and D. Spielman, “Expander codes,” IEEE Transactions on Information Theory , vol. 42, no. 6, pp. 1710–1722, Nov. 1996
1996
Earlier work this paper cites.
N. Aydin, I. Siap, and D. K. Ray-Chaudhuri, “The structure of 1-generator quasi-twisted codes and new linear codes,” Designs, Codes and Cryptography , vol. 24, no. 3, pp. 313–326, Dec. 2001
2001
Earlier work this paper cites.
O. Goldreich and M. Sudan, “Locally testable codes and PCPs of almost-linear length,” in The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. , Nov. 2002, pp. 13–22
2002
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathematical Physics , vol. 43, no. 9, pp. 4452–4505, 2002
2002
Earlier work this paper cites.
M. H. Freedman, D. A. Meyer, and F. Luo, “ ℤ 2 \mathbb{Z}_{2} -systolic freedom and quantum codes,” in Mathematics of quantum computation , R. K. Brylinski and G. Chen, Eds. New York: Chapman & Hall/CRC, 2002, ch. 12, pp. 287–320
2002
Earlier work this paper cites.
P. McMullen and E. Schulte, Abstract Regular Polytopes . Cambridge University Press, Dec. 2002
2002
Earlier work this paper cites.
A. Barg and G. D. Forney, “Random codes: minimum distances and error exponents,” IEEE Transactions on Information Theory , vol. 48, no. 9, pp. 2568–2573, 2002
2002
Earlier work this paper cites.
J. Friedman, “A proof of Alon’s second eigenvalue conjecture,” in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing , ser. STOC ’03. New York, NY, USA: Association for Computing Machinery, 2003, pp. 720–724. [Online]. Available: https://doi.org/10.1145/780542.780646
2003
Earlier work this paper cites.
G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory and Ramanujan Graphs , ser. London Mathematical Society Student Texts. Cambridge: Cambridge University Press, 2003
2003
Cited alongside, same era.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Transactions on Information Theory , vol. 50, no. 10, pp. 2315–2330, Oct. 2004
2004
Cited alongside, same era.
2005
Cited alongside, same era.
E. Ben-Sasson and M. Sudan, “Robust locally testable codes and products of codes,” Random Structures & Algorithms , vol. 28, no. 4, pp. 387–402, 2006. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20120
2006
Cited alongside, same era.
A. Leverrier, J.-P. Tillich, and G. Zémor, “Quantum expander codes,” in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science , Oct. 2015, pp. 810–824
2015
Later among the works it cites.
L. Eldar and A. W. Harrow, “Local hamiltonians whose ground states are hard to approximate,” 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pp. 427–438, Oct. 2017
2017
Later among the works it cites.
D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi, “Sparse quantum codes from quantum circuits,” IEEE Transactions on Information Theory , vol. 63, no. 4, pp. 2464–2479, 2017
2017
Later among the works it cites.
L. Eldar and A. W. Harrow, “Local hamiltonians whose ground states are hard to approximate,” in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , Oct. 2017, pp. 427–438
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Dinur, M. Sudan, and A. Wigderson, “Robust local testability of tensor products of ldpc codes,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , ser. Lecture Notes in Computer Science, J. Díaz, K. Jansen, J. D. P. Rolim, and U. Zwick, Eds. Berlin, Heidelberg: Springer, 2006, pp. 304–315
2006
Cited alongside, same era.
S. Hoory, N. Linial, and A. Wigderson, “Expander graphs and their applications,” Bull. Amer. Math. Soc. , vol. 43, no. 04, pp. 439–562, Aug. 2006
2006
Cited alongside, same era.
T. Kaufman and M. Sudan, “Sparse random linear codes are locally decodable and testable,” in 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07) , Oct. 2007, pp. 590–600
2007
Cited alongside, same era.
I. Dinur, “The PCP theorem by gap amplification,” Journal of the ACM , vol. 54, no. 3, pp. 12–es, Jun. 2007
2007
Cited alongside, same era.
D. T. Wise, “Complete square complexes,” Commentarii Mathematici Helvetici , vol. 82, no. 4, pp. 683–724, Dec. 2007. [Online]. Available: https://ems.press/journals/cmh/articles/1470
2007
Cited alongside, same era.
M. Hagiwara and H. Imai, “Quantum quasi-cyclic LDPC codes,” in 2007 IEEE international symposium on information theory , Jun. 2007, pp. 806–810
2007
Cited alongside, same era.
J. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to n 1 / 2 n^{1/2} ,” in 2009 IEEE International Symposium on Information Theory , June 2009, pp. 799–803
2009
Cited alongside, same era.
O. Goldreich, “Short locally testable codes and proofs: A survey in two parts,” in Property Testing: Current Research and Surveys , ser. Lecture Notes in Computer Science, O. Goldreich, Ed. Berlin, Heidelberg: Springer, 2010, pp. 65–104
2010
Cited alongside, same era.
2018
Later among the works it cites.
A. Lubotzky, “High dimensional expanders,” in Proceedings of the International Congress of Mathematicians (ICM 2018) . WORLD SCIENTIFIC, Jun. 2018, pp. 705–730
2018
Later among the works it cites.
T. C. Bohdanowicz, E. Crosson, C. Nirkhe, and H. Yuen, “Good approximate quantum ldpc codes from spacetime circuit hamiltonians,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2019. New York, NY, USA: Association for Computing Machinery, Jun. 2019, pp. 481–490. [Online]. Available: https://doi.org/10.1145/3313276.3316384
2019
Later among the works it cites.
W. Zeng and L. P. Pryadko, “Higher-dimensional quantum hypergraph-product codes with finite rates,” Physical Review Letters , vol. 122, no. 23, p. 230501, Jun. 2019
2019
Later among the works it cites.
N. Agarwal, K. Chandrasekaran, A. Kolla, and V. Madan, “On the expansion of group-based lifts,” SIAM Journal on Discrete Mathematics , vol. 33, no. 3, pp. 1338–1373, 2019. [Online]. Available: https://doi.org/10.1137/17M1141047
2019
Later among the works it cites.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders,” in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , Nov. 2020, pp. 218–227
2020
Later among the works it cites.
J. Lv, R. Li, and J. Wang, “Constructions of quasi-twisted quantum codes,” Quantum Information Processing , vol. 19, no. 8, p. 274, Jul. 2020
2020
Later among the works it cites.
N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum , vol. 2, no. 4, p. 040101, Oct. 2021
2021
Closest in time.
M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: breaking the N 1 / 2 polylog ( N ) N^{1/2}\operatorname{polylog}(N) barrier for quantum LDPC codes,” in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . New York, NY, USA: Association for Computing Machinery, Jun. 2021, pp. 1276–1288
2021
Closest in time.
P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Transactions on Information Theory , pp. 1–1, 2021
2021
Closest in time.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Transactions on Information Theory , vol. 67, no. 10, pp. 6653–6674, Oct. 2021
2021
Closest in time.
2021
Closest in time.
T. Kaufman and R. J. Tessler, “New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω ( n log k n ) \Omega(\sqrt{n}\log^{k}n) distance,” in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . New York, NY, USA: Association for Computing Machinery, Jun. 2021, pp. 1317–1329
2021
Closest in time.
P. Panteleev and G. Kalachev, “Degenerate quantum ldpc codes with good finite length performance,” Quantum , vol. 5, p. 585, Nov. 2021. [Online]. Available: https://quantum-journal.org/papers/q-2021-11-22-585/
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
E. T. Campbell, “A theory of single-shot error correction for adversarial noise,” Quantum Science and Technology , vol. 4, no. 2, p. 025006, Feb. 2019. [Online]. Available: https://doi.org/10.1088/2058-9565/aafc8f
2058
Closest in time.