Transversal Clifford and T-gate codes of short length and high distance

Marcel J.E. Golay, “Notes on Digital Coding,” Proceedings of the IRE , vol. 37, no. 6, pp. 657–657, Jun. 1949, conference Name: Proceedings of the IRE. [Online]. Available: https://ieeexplore.ieee.org/document/1698056/?arnumber=1698056

1949

Earlier work this paper cites.

T. M. Apostol, Introduction to Analytic Number Theory , ser. Undergraduate Texts in Mathematics, S. Axler, F. W. Gehring, and K. A. Ribet, Eds. New York, NY: Springer, 1976. [Online]. Available: http://link.springer.com/10.1007/978-1-4757-5579-4

1976

Earlier work this paper cites.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes . Elsevier, 1977

1977

Earlier work this paper cites.

H. N. Ward, “Divisible codes,” Archiv der Mathematik , vol. 36, no. 1, pp. 485–494, Dec. 1981. [Online]. Available: https://doi.org/10.1007/BF01223730

1981

Earlier work this paper cites.

H. N. Ward, “Weight polarization and divisibility,” Discrete Mathematics , vol. 83, no. 2, pp. 315–326, Aug. 1990. [Online]. Available: https://www.sciencedirect.com/science/article/pii/0012365X9090015A

1990

Earlier work this paper cites.

A. Steane, “Multiple Particle Interference and Quantum Error Correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences , vol. 452, no. 1954, pp. 2551–2577, Nov. 1996, arXiv:quant-ph/9601029. [Online]. Available: http://arxiv.org/abs/quant-ph/9601029

1996

Earlier work this paper cites.

A. Steane, “Simple Quantum Error Correcting Codes,” Physical Review A , vol. 54, no. 6, pp. 4741–4751, Dec. 1996, arXiv:quant-ph/9605021. [Online]. Available: http://arxiv.org/abs/quant-ph/9605021

1996

Earlier work this paper cites.

A. R. Calderbank and P. W. Shor, “Good Quantum Error-Correcting Codes Exist,” Physical Review A , vol. 54, no. 2, pp. 1098–1105, Aug. 1996, arXiv:quant-ph/9512032. [Online]. Available: http://arxiv.org/abs/quant-ph/9512032

1996

Earlier work this paper cites.

A. M. Steane, “Error Correcting Codes in Quantum Theory,” Physical Review Letters , vol. 77, no. 5, pp. 793–797, Jul. 1996. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.77.793

1996

Earlier work this paper cites.

D. Gottesman, “Stabilizer Codes and Quantum Error Correction,” May 1997, arXiv:quant-ph/9705052. [Online]. Available: http://arxiv.org/abs/quant-ph/9705052

1997

Earlier work this paper cites.

A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum Error Correction and Orthogonal Geometry,” Physical Review Letters , vol. 78, no. 3, pp. 405–408, Jan. 1997, arXiv:quant-ph/9605005. [Online]. Available: http://arxiv.org/abs/quant-ph/9605005

1997

Earlier work this paper cites.

I. Krasikov and S. Litsyn, “Linear programming bounds for doubly-even self-dual codes,” IEEE Transactions on Information Theory , vol. 43, no. 4, pp. 1238–1244, Jul. 1997. [Online]. Available: http://ieeexplore.ieee.org/document/605587/

1997

Earlier work this paper cites.

T. A. Gulliver and M. Harada, “The existence of a formally self-dual even [70, 35, 14] code,” Applied Mathematics Letters , vol. 11, no. 1, pp. 95–98, Jan. 1998. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0893965997001407

1998

Earlier work this paper cites.

M. Grassl and T. Beth, “Quantum BCH Codes,” Oct. 1999, arXiv:quant-ph/9910060. [Online]. Available: http://arxiv.org/abs/quant-ph/9910060

1999

Earlier work this paper cites.

M. Harada and M. Ozeki, “Extremal self-dual codes with the smallest covering radius,” Discrete Mathematics , vol. 215, no. 1-3, pp. 271–281, Mar. 2000. [Online]. Available: https://linkinghub.elsevier.com/retrieve/pii/S0012365X99003180

2000

Earlier work this paper cites.

——, “Classical Coding Problem from Transversal $T$ Gates,” in 2020 IEEE International Symposium on Information Theory (ISIT) , Jun. 2020, pp. 1891–1896, arXiv:2001.04887 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2001.04887

Original

2001

Earlier work this paper cites.

E. M. Rains and N. J. A. Sloane, “Self-Dual Codes,” Jul. 2002, arXiv:math/0208001. [Online]. Available: http://arxiv.org/abs/math/0208001

2002

Earlier work this paper cites.

S. Bravyi and A. Kitaev, “Universal Quantum Computation with ideal Clifford gates and noisy ancillas,” Physical Review A , vol. 71, no. 2, p. 022316, Feb. 2005, arXiv:quant-ph/0403025. [Online]. Available: http://arxiv.org/abs/quant-ph/0403025

2005

Earlier work this paper cites.

A. Ketkar, A. Klappenecker, S. Kumar, and P. K. Sarvepalli, “Nonbinary stabilizer codes over finite fields,” Aug. 2005, arXiv:quant-ph/0508070. [Online]. Available: http://arxiv.org/abs/quant-ph/0508070

2005

Earlier work this paper cites.

B. W. Reichardt, “Quantum Universality from Magic States Distillation Applied to CSS Codes,” Quantum Information Processing , vol. 4, no. 3, pp. 251–264, Aug. 2005. [Online]. Available: https://doi.org/10.1007/s11128-005-7654-8

2005

Earlier work this paper cites.

H. Bombin and M. A. Martin-Delgado, “Topological Quantum Distillation,” Physical Review Letters , vol. 97, no. 18, p. 180501, Oct. 2006, arXiv:quant-ph/0605138. [Online]. Available: http://arxiv.org/abs/quant-ph/0605138

2006

Earlier work this paper cites.

G. Philippe and A. Otmani, “TABLES OF SELF-DUAL CODES,” 2007. [Online]. Available: https://www.unilim.fr/pages_perso/philippe.gaborit/SD/index.html

2007

Earlier work this paper cites.

Grassl, Markus, “Bounds on the minimum distance of linear codes and quantum codes,” 2007. [Online]. Available: http://www.codetables.de

2007

Earlier work this paper cites.

H. Bombin and M. A. Martin-Delgado, “Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates,” Physical Review B , vol. 75, no. 7, p. 075103, Feb. 2007, arXiv:cond-mat/0607736. [Online]. Available: http://arxiv.org/abs/cond-mat/0607736

2007

Cited alongside, same era.

A. W. Cross, D. P. DiVincenzo, and B. M. Terhal, “A comparative code study for quantum fault-tolerance,” Feb. 2009, arXiv:0711.1556 [quant-ph]. [Online]. Available: http://arxiv.org/abs/0711.1556

Original

2009

Cited alongside, same era.

——, “Error-Detection-Based Quantum Fault-Tolerance Threshold,” Algorithmica , vol. 55, no. 3, pp. 517–556, Nov. 2009. [Online]. Available: https://doi.org/10.1007/s00453-007-9069-7

2009

Cited alongside, same era.

——, “Quantum universality by state distillation,” Jul. 2009, arXiv:quant-ph/0608085. [Online]. Available: http://arxiv.org/abs/quant-ph/0608085

2009

Cited alongside, same era.

T. Jochym-O’Connor, “Fault-tolerant gates via homological product codes,” Jan. 2019, arXiv:1807.09783 [quant-ph]. [Online]. Available: http://arxiv.org/abs/1807.09783

Original

2019

Later among the works it cites.

N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “On Optimality of CSS Codes for Transversal T,” IEEE Journal on Selected Areas in Information Theory , vol. 1, no. 2, pp. 499–514, Aug. 2020, conference Name: IEEE Journal on Selected Areas in Information Theory. [Online]. Available: https://ieeexplore.ieee.org/document/9153001

2020

Later among the works it cites.

S. Koutsioumpas, D. Banfield, and A. Kay, “The Smallest Code with Transversal T,” Oct. 2022, arXiv:2210.14066 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2210.14066

Original

2022

Later among the works it cites.

M. Vasmer and A. Kubica, “Morphing quantum codes,” PRX Quantum , vol. 3, no. 3, p. 030319, Aug. 2022, arXiv:2112.01446 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2112.01446

Original