Fetching the paper…
Reading the bibliography…
CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate.
E. Assmus and J. Key, “Affine and projective planes,” Discrete Mathematics , vol. 83, no. 2, pp. 161–187, 1990. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0012365X9090003Z
1990
Earlier work this paper cites.
J. L. Massey, “Linear codes with complementary duals,” Discrete Mathematics , vol. 106-107, pp. 337–342, 1992. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0012365X9290563U
1992
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,” Physical Review Letters , vol. 77, no. 5, p. 793, 1996
1996
Earlier work this paper cites.
W. Bosma, J. Cannon, and C. Playoust, “The Magma algebra system. I. The user language,” J. Symbolic Comput. , vol. 24, no. 3-4, pp. 235–265, 1997. [Online]. Available: http://dx.doi.org/10.1006/jsco.1996.0125
1996
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, “Quantum codes on a lattice with boundary,” 1998
1998
Earlier work this paper cites.
S. Myung, K. Yang, and J. Kim, “Quasi-cyclic LDPC codes for fast encoding,” IEEE Transactions on Information Theory , vol. 51, no. 8, pp. 2894–2901, 2005
2005
Earlier work this paper cites.
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quantum Info. Comput. , vol. 14, no. 15–16, p. 1338–1372, nov 2014
2014
Earlier work this paper cites.
J.-P. 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, 2014
2014
Cited alongside, same era.
G. Luo, X. Cao, and X. Chen, “MDS codes with hulls of arbitrary dimensions and their quantum error correction,” IEEE Transactions on Information Theory , vol. 65, no. 5, pp. 2944–2952, 2019
2019
Cited alongside, same era.
N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “Classical coding problem from transversal T gates,” in 2020 IEEE International Symposium on Information Theory (ISIT) , 2020, pp. 1891–1896
2020
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum , vol. 2, p. 040101, Oct 2021. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.2.040101
2021
Cited alongside, same era.
E. Berardini, A. Caminata, and A. Ravagnani, “Structure of CSS and CSS-T quantum codes,” ArXiv 2310.16504 , 2023
2023
Later among the works it cites.
E. Camps-Moreno, H. H. López, G. L. Matthews, D. Ruano, R. San-José, and I. Soprunov, “The poset of binary CSS-T quantum codes and cyclic codes,” 2023
2023
Later among the works it cites.
Q. Xu, J. P. B. Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasic, M. D. Lukin, L. Jiang, and H. Zhou, “Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays,” 2023
2023
Later among the works it cites.
A. Krishna, I. L. Navon, and M. Wootters, “Viderman’s algorithm for quantum LDPC codes,” 2023
2023
Later among the works it cites.
S. E. Anderson, E. Camps-Moreno, H. H. López, G. L. Matthews, D. Ruano, and I. Soprunov, “Relative hulls and quantum codes,” 2023
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Panteleev and G. Kalachev, “Asymptotically good quantum and locally testable classical LDPC codes,” in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , ser. STOC 2022. New York, NY, USA: Association for Computing Machinery, 2022, p. 375–388. [Online]. Available: https://doi.org/10.1145/3519935.3520017
2022
Cited alongside, same era.
A. Leverrier and G. Zemor, “Quantum tanner codes,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) . Los Alamitos, CA, USA: IEEE Computer Society, nov 2022, pp. 872–883. [Online]. Available: https://doi.ieeecomputersociety.org/10.1109/FOCS54457.2022.00117
2022
Cited alongside, same era.
E. Andrade, J. Bolkema, T. Dexter, H. Eggers, V. Luongo, F. Manganiello, and L. Szramowski, “CSS-T codes from Reed Muller codes for quantum fault tolerance,” ArXiv 2305.06423 , 2023
2023
Cited alongside, same era.
S. Evra, T. Kaufman, and G. Zémor, “Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high-dimensional expanders,” SIAM Journal on Computing , vol. 0, no. 0, pp. FOCS20–276–FOCS20–316, 0. [Online]. Available: https://doi.org/10.1137/20M1383689
Cited in the paper.
D. R. Grayson and M. E. Stillman, “Macaulay2, a software system for research in algebraic geometry.” [Online]. Available: http://www.math.uiuc.edu/Macaulay2/
Cited in the paper.
Cited in the paper.
Later among the works it cites.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory,” 2024
2024
Closest in time.
R. Misoczki, J.-P. Tillich, N. Sendrier, and P. S. L. M. Barreto, “MDPC-McEliece: New McEliece variants from moderate density parity-check codes,” in 2013 IEEE International Symposium on Information Theory , 2013, pp. 2069–2073
2073
Closest in time.