Fetching the paper…
Reading the bibliography…
We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian.
I. G. Connell, “On the group ring,” Canadian Journal of Mathematics , vol. 15, p. 650–685, 1963
1963
Earlier work this paper cites.
C. D. Meyer, “Generalized inverses of block triangular matrices,” SIAM Journal on Applied Mathematics , vol. 19, no. 4, pp. 741–750, 1970. [Online]. Available: http://www.jstor.org/stable/2100157
1970
Earlier work this paper cites.
——, “Generalized inverses and ranks of block matrices,” SIAM Journal on Applied Mathematics , vol. 25, pp. 597–602, 1973. [Online]. Available: http://www.jstor.org/stable/2100027
1973
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes . Amsterdam: North-Holland, 1981
1981
Earlier work this paper cites.
Y. A. Drozd and V. V. Kirichenko, Finite Dimensional Algebras . Springer-Verlag, 1994. [Online]. Available: https://doi.org/10.1007/978-3-642-76244-4
1994
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, no. 2, pp. 1098–1105, Aug 1996
1996
Earlier work this paper cites.
A. M. Steane, “Simple quantum error-correcting codes,” Phys. Rev. A , vol. 54, pp. 4741–4751, 1996. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.54.4741
1996
Earlier work this paper cites.
A. R. Calderbank, E. M. Rains, P. M. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF(4),” IEEE Trans. Info. Theory , vol. 44, pp. 1369–1387, 1998. [Online]. Available: http://dx.doi.org/10.1109/18.681315
1998
Earlier work this paper cites.
A. Thangaraj and S. W. McLaughlin, “Quantum codes from cyclic codes over GF( 4 m 4^{m} ),” IEEE Transactions on Information Theory , vol. 47, no. 3, pp. 1176–1178, 2001
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys. , vol. 43, p. 4452, 2002. [Online]. Available: http://dx.doi.org/10.1063/1.1499754
2002
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Info. Th. , vol. 59, pp. 2315–30, 2004. [Online]. Available: http://dx.doi.org/10.1109/TIT.2004.834737
2004
Earlier work this paper cites.
L. M. Bazzi and S. K. Mitter, “Some randomized code constructions from group actions,” IEEE Transactions on Information Theory , vol. 52, no. 7, pp. 3210–3219, 2006
2006
Earlier work this paper cites.
A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields,” IEEE Trans. Info. Th. , vol. 52, no. 11, pp. 4892–4914, Nov 2006
2006
Earlier work this paper cites.
S. A. Aly, A. Klappenecker, and P. K. Sarvepalli, “On quantum and classical BCH codes,” IEEE Transactions on Information Theory , vol. 53, no. 3, pp. 1183–1188, 2007
2007
Earlier work this paper cites.
J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to n \sqrt{n} ,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , June 2009, pp. 799–803
2009
Earlier work this paper cites.
S. Bravyi and B. Terhal, “A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes,” New Journal of Physics , vol. 11, no. 4, p. 043029, 2009. [Online]. Available: http://stacks.iop.org/1367-2630/11/i=4/a=043029
2009
Cited alongside, same era.
S. Bravyi, D. Poulin, and B. Terhal, “Tradeoffs for reliable quantum information storage in 2D systems,” Phys. Rev. Lett. , vol. 104, p. 050503, Feb 2010. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.104.050503
2010
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Fault tolerance of quantum low-density parity check codes with sublinear distance scaling,” Phys. Rev. A , vol. 87, p. 020304(R), Feb 2013. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.87.020304
2013
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, 2013. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.88.012311
W. Zeng, A. Ashikhmin, M. Woolls, and L. P. Pryadko, “Quantum convolutional data-syndrome codes,” in 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) , 2019, pp. 1–5
2019
Later among the works it cites.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high dimensional expanders,” 2020, unpublished
2020
Later among the works it cites.
——, “Minimal distances for certain quantum product codes and tensor products of chain complexes,” Phys. Rev. A , vol. 102, p. 062402, 2020. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.102.062402
2020
Later among the works it cites.
G. V. Kalachev and P. A. Panteleev, “On the minimum distance in one class of quantum LDPC codes,” Intelligent systems. Theory and applications , vol. 24, p. 87–117, 2020, [In Russian]. [Online]. Available: http://mi.mathnet.ru/eng/ista284
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quant. Information and Computation , vol. 14, pp. 1338–1371, 2014. [Online]. Available: http://www.rintonpress.com/journals/qicabstracts/qicabstracts14-1516.html
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. Fujiwara, “Ability of stabilizer quantum error correction to protect itself from its own imperfection,” Phys. Rev. A , vol. 90, p. 062304, Dec 2014. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.90.062304
2014
Cited alongside, same era.
A. Ashikhmin, C. Y. Lai, and T. A. Brun, “Robust quantum error syndrome extraction by classical coding,” in 2014 IEEE International Symposium on Information Theory , 2014, pp. 546–550
2014
Cited alongside, same era.
I. Dumer, A. A. Kovalev, and L. P. Pryadko, “Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes,” Phys. Rev. Lett. , vol. 115, p. 050502, Jul 2015. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevLett.115.050502
2015
Cited alongside, same era.
G. Olteanu and I. Van Gelder, “Construction of minimal non-abelian left group codes,” Designs, Codes and Cryptography , vol. 75, pp. 359–373, 2015. [Online]. Available: https://doi.org/10.1007/s10623-014-9922-z
2015
Cited alongside, same era.
A. Naghipour, M. A. Jafarizadeh, and S. Shahmorad, “Quantum stabilizer codes from abelian and non-abelian groups association schemes,” International Journal of Quantum Information , vol. 13, p. 1550021, 2015. [Online]. Available: https://doi.org/10.1142/S0219749915500215
2015
Cited alongside, same era.
H. Bombín, “Single-shot fault-tolerant quantum error correction,” Phys. Rev. X , vol. 5, p. 031043, Sep 2015. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.5.031043
2015
Cited alongside, same era.
P. Panteleev and G. Kalachev, “Degenerate quantum LDPC codes with good finite length performance,” Quantum , vol. 5, p. 585, 2021
2021
Later among the works it cites.
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 . New York, NY, USA: Association for Computing Machinery, 2021, p. 1317–1329
2021
Later among the works it cites.
M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: Breaking the N 1 / 2 polylog ( N ) N^{1/2}\mathop{\rm polylog}(N) barrier for quantum LDPC codes,” in STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . New York, NY, USA: Association for Computing Machinery, June 2021, p. 1276–1288
2021
Later among the works it cites.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Transactions on Information Theory , vol. 67, no. 10, pp. 6653–6674, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Transactions on Information Theory , vol. 68, no. 1, pp. 213–229, 2022
2022
Later among the works it cites.
M. Borello, J. De La Cruz, and W. Willems, “On checkable codes in group algebras,” Journal of Algebra and Its Applications , vol. 21, p. 2250125, 2022. [Online]. Available: https://doi.org/10.1142/S0219498822501250
2022
Later among the works it cites.
“Galois-qudit code,” in The Error Correction Zoo , V. V. Albert and P. Faist, Eds., 2022. [Online]. Available: https://errorcorrectionzoo.org/c/galois_into_galois
2022
Later among the works it cites.
2023
Closest in time.
E. T. Campbell, “A theory of single-shot error correction for adversarial noise,” Quantum Science and Technology , vol. 4, p. 025006, 2019. [Online]. Available: https://doi.org/10.1088/2058-9565/aafc8f
2058
Closest in time.
R. Wang and L. P. Pryadko, “Distance bounds for generalized bicycle codes,” Symmetry , vol. 14, no. 7, p. 1348, 2022. [Online]. Available: https://www.mdpi.com/2073-8994/14/7/1348
2073
Closest in time.