Fetching the paper…
Reading the bibliography…
We propose a new systematic construction of CSS-T codes from any given CSS code using a map $\phi$.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A , vol. 54, no. 2, pp. 1098–1105, 1996
1996
Earlier work this paper cites.
A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys , vol. 52, pp. 1191 – 1249, 1997
1997
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction. caltech Ph. D,” Ph.D. dissertation, Thesis, eprint: quant-ph/9705052, 1997
1997
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
1997
Earlier work this paper cites.
D. Gottesman, “The Heisenberg representation of quantum computers,” in 22nd International Colloquium on Group Theoretical Methods in Physics , 7 1998, pp. 32–43
1998
Earlier work this paper cites.
E. M. Rains and N. J. A. Sloane, “Self-dual codes,” in Handbook of coding theory, Vol. I, II . North-Holland, Amsterdam, 1998, pp. 177–294
1998
Earlier work this paper cites.
A. M. Steane, “Efficient fault-tolerant quantum computing,” Nature , vol. 399, no. 6732, pp. 124–126, 1999
1999
Earlier work this paper cites.
M. Grassl and T. Beth, “Cyclic quantum error–correcting codes and quantum shift registers,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences , vol. 456, no. 2003, pp. 2689–2706, 2000
2000
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information . Cambridge University Press, Cambridge, 2000
2000
Earlier work this paper cites.
A. Ashikhmin, S. Litsyn, and M. A. Tsfasman, “Asymptotically good quantum codes,” Physical Review A , vol. 63, no. 3, p. 032311, 2001
2001
Earlier work this paper cites.
H. Chen, S. Ling, and C. Xing, “Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound,” IEEE Trans. Inform. Theory , vol. 47, no. 5, pp. 2055–2058, 2001
2001
Earlier work this paper cites.
G. Alber, T. Beth, C. Charnes, A. Delgado, M. Grassl, and M. Mussinger, “Stabilizing distinguishable qubits against spontaneous decay by detected-jump correcting quantum codes,” Physical Review Letters , vol. 86, no. 19, p. 4402, 2001
2001
Earlier work this paper cites.
J. Kempe, D. Bacon, D. A. Lidar, and K. B. Whaley, “Theory of decoherence-free fault-tolerant universal quantum computation,” Physical Review A , vol. 63, no. 4, p. 042307, 2001
2001
Earlier work this paper cites.
P. Gaborit and A. Otmani, “Experimental constructions of self-dual codes,” Finite Fields and Their Applications , vol. 9, no. 3, pp. 372–394, 2003
2003
Earlier work this paper cites.
B. Eastin and E. Knill, “Restrictions on transversal encoded quantum gate sets,” Physical review letters , vol. 102, no. 11, p. 110502, 2009
2009
Earlier work this paper cites.
W. C. Huffman and V. Pless, Fundamentals of error-correcting codes . Cambridge university press, 2010
2010
Cited alongside, same era.
S. Bravyi and J. Haah, “Magic-state distillation with low overhead,” Physical Review A—Atomic, Molecular, and Optical Physics , vol. 86, no. 5, p. 052329, 2012
2012
Cited alongside, same era.
K. Betsumiya and A. Munemasa, “On triply even binary codes,” Journal of the London Mathematical Society , vol. 86, no. 1, pp. 1–16, 2012
2012
Cited alongside, same era.
H. Randriambololona, “On products and powers of linear codes under componentwise multiplication,” Algorithmic arithmetic, geometry, and coding theory , vol. 637, pp. 3–78, 2015
2015
Cited alongside, same era.
S. Bravyi and A. Cross, “Doubled color codes,” arXiv preprint arXiv:1509.03239 , 2015
2015
I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, “Good quantum LDPC codes with linear time decoders,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing , ser. STOC 2023. New York, NY, USA: Association for Computing Machinery, 2023, p. 905–918
2023
Later among the works it cites.
2023
Later among the works it cites.
2024
Closest in time.
2024
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
E. T. Campbell, B. M. Terhal, and C. Vuillot, “Roads towards fault-tolerant universal quantum computation,” Nature , vol. 549, no. 7671, pp. 172–179, Sep 2017
2017
Cited alongside, same era.
D. Litinski, “Magic State Distillation: Not as Costly as You Think,” Quantum , vol. 3, p. 205, Dec. 2019. [Online]. Available: https://doi.org/10.22331/q-2019-12-02-205
2019
Cited alongside, same era.
N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “Classical coding problem from transversal T T -gates,” in 2020 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2020, pp. 1891–1896
2020
Cited alongside, same era.
——, “On optimality of CSS codes for transversal T T ,” IEEE Journal on Selected Areas in Information Theory , vol. 1, no. 2, pp. 499–514, 2020
2020
Cited alongside, same era.
J. Hu, Q. Liang, N. Rengaswamy, and R. Calderbank, “Mitigating coherent noise by balancing weight- 2 2 Z Z -stabilizers,” IEEE Trans. Inform. Theory , vol. 68, no. 3, pp. 1795–1808, 2021
2021
Cited alongside, same era.
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 , 2022, pp. 375–388
2022
Cited alongside, same era.
A. Leverrier and G. Zémor, “Quantum Tanner codes,” in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , 2022, pp. 872–883
2022
Cited alongside, same era.
R. Dastbasteh, O. Sanz Larrarte, J. Etxezarreta Martinez, A. deMarti iOlius, J. Oliva del Moral, and P. Crespo Bofill, “Quantum CSS duadic and triadic codes: New insights and properties,” International Workshop on the Arithmetic of Finite Fields , pp. 70–87, 2024
2024
Closest in time.
E. Berardini, A. Caminata, and A. Ravagnani, “Structure of CSS and CSS-T quantum codes,” Des. Codes Cryptogr. , pp. 1–23, 2024
2024
Closest in time.
E. Camps-Moreno, H. H. López, G. L. Matthews, D. Ruano, R. San-José, and I. Soprunov, “An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance,” Quantum Inf. Process. , vol. 23, no. 6, pp. 1–24, 2024
2024
Closest in time.
——, “Binary triorthogonal and CSS-T codes for quantum error correction,” in 2024 60th Annual Allerton Conference on Communication, Control, and Computing . IEEE, 2024, pp. 01–06
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
R. Dastbasteh and P. Lisoněk, “New quantum codes from self-dual codes over 𝔽 4 \mathbb{F}_{4} ,” Des. Codes Cryptogr. , vol. 92, no. 3, pp. 787–801, 2024
2024
Closest in time.
P. Gaborit and A. Otmani, “Tables of self-dual codes,” https://www.unilim.fr/pages_perso/philippe.gaborit/SD/index.html , accessed: April 28, 2025
2025
Closest in time.
M. Harada and A. Munemasa, “Database of binary self-dual codes,” https://www.math.is.tohoku.ac.jp/~munemasa/research/codes/sd2.htm , accessed: April 28, 2025
2025
Closest in time.