Fetching the paper…
Reading the bibliography…
We give a construction of quantum LDPC codes of dimension $\Theta(\log N)$ and distance $\Theta(N/\log N)$ as the code length $N\to\infty$.
R. G. Gallager, Low-Density Parity-Check Codes . M.I.T. Press, Cambridge, MA, 1963
1963
Earlier work this paper cites.
R. M. 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.
Y. Drozd and V. Kirichenko, Finite Dimensional Algebras . Springer Berlin Heidelberg, 1994. [Online]. Available: https://www.springer.com/gp/book/9783642762468
1994
Earlier work this paper cites.
M. Sipser and D. A. Spielman, “Expander codes,” IEEE Transactions on Information Theory , vol. 42, no. 6, pp. 1710–1722, 1996
1996
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.
G. Zémor, “On expander codes,” IEEE Transactions on Information Theory , vol. 47, no. 2, pp. 835–837, 2001
2001
Earlier work this paper cites.
R. M. Tanner, D. Sridhara, and T. Fuja, “A class of group-structured LDPC codes,” in Proc. ISTA , 2001, pp. 365–370
2001
Earlier work this paper cites.
A. Barg and G. Zémor, “Error exponents of expander codes,” IEEE Transactions on Information Theory , vol. 48, no. 6, pp. 1725–1729, 2002
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. [Online]. Available: https://doi.org/10.1063/1.1499754
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.
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. Thorpe, “Low-density parity-check (LDPC) codes constructed from protographs,” IPN progress report , vol. 42, no. 154, pp. 42–154, 2003
2003
Earlier work this paper cites.
D. Dummit and R. Foote, Abstract Algebra , 3rd ed. Wiley, 2003
2003
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
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.
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.
M. Hagiwara and H. Imai, “Quantum quasi-cyclic ldpc codes,” in 2007 IEEE International Symposium on Information Theory , June 2007, pp. 806–810
2007
Cited alongside, same era.
Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, “Fifteen years of quantum LDPC coding and improved decoding strategies,” IEEE Access , vol. 3, pp. 2492–2519, 2015
2015
Later among the works it cites.
D. Puder, “Expansion of random graphs: new proofs, new results,” Inventiones mathematicae , vol. 201, pp. 845–908, 2015
2015
Later among the works it cites.
M. B. Hastings, “Weight reduction for quantum codes,” Quantum Info. Comput. , vol. 17, no. 15–16, p. 1307–1334, Dec. 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.
O. Fawzi, A. Grospellier, and A. Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , 2018, pp. 743–754
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
J. Haah, “Local stabilizer codes in three dimensions without string logical operators,” Phys. Rev. A , vol. 83, p. 042330, Apr 2011. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.83.042330
2011
Cited alongside, same era.
R. Smarandache and P. Vontobel, “Quasi-cyclic LDPC codes: Influence of proto- and tanner-graph structure on minimum Hamming distance upper bounds,” IEEE Transactions on Information Theory , vol. 58, no. 2, pp. 585–607, 2012
2012
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Quantum kronecker sum-product low-density parity-check codes with finite rate,” Phys. Rev. A , vol. 88, p. 012311, Jul 2013. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.88.012311
2013
Cited alongside, same era.
B. K. Butler and P. H. Siegel, “Bounds on the minimum distance of punctured quasi-cyclic LDPC codes,” IEEE Transactions on Information Theory , vol. 59, no. 7, pp. 4584–4597, 2013
2013
Cited alongside, same era.
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quantum Info. Comput. , vol. 14, no. 15–16, pp. 1338–1372, Nov. 2014
2014
Cited alongside, same era.
S. Bravyi, M. Suchara, and A. Vargo, “Efficient algorithms for maximum likelihood decoding in the surface code,” Phys. Rev. A , vol. 90, p. 032326, Sep 2014. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.90.032326
2014
Cited alongside, same era.
J. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Transactions on Information Theory , vol. 60, no. 2, pp. 1193–1202, Feb 2014
2014
Cited alongside, same era.
2018
Later among the works it cites.
W. Zeng and L. P. Pryadko, “Higher-dimensional quantum hypergraph-product codes with finite rates,” Phys. Rev. Lett. , vol. 122, p. 230501, Jun 2019. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.122.230501
2019
Later among the works it cites.
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.
E. T. Campbell, “A theory of single-shot error correction for adversarial noise,” Quantum Science and Technology , vol. 4, no. 2, p. 025006, 2019
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
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.
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.
N. Alon, “Explicit expanders of every degree and size,” Combinatorica , Feb. 2021
2021
Closest in time.