Climbing the Diagonal Clifford Hierarchy

F. J. MacWilliams and N. J. A. Sloane, The theory of error correcting codes . Elsevier, 1977, vol. 16

1977

Earlier work this paper cites.

P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings 35th annual symposium on foundations of computer science . Ieee, 1994, pp. 124–134

1994

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

1996

Earlier work this paper cites.

A. M. Steane, “Simple quantum error-correcting codes,” Phys. Rev. A , vol. 54, no. 6, pp. 4741–4751, 1996

1996

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, 1996

1996

Earlier work this paper cites.

E. Knill, R. Laflamme, and W. Zurek, “Accuracy threshold for quantum computation,” arXiv quant-ph/9610011 , 1996

1996

Earlier work this paper cites.

D. Gottesman, Stabilizer codes and quantum error correction . California Institute of Technology, 1997

1997

Earlier work this paper cites.

A. R. Calderbank, E. M. Rains, P. Shor, and N. J. Sloane, “Quantum error correction via codes over GF(4),” IEEE Transactions on Information Theory , vol. 44, no. 4, pp. 1369–1387, 1998

1998

Earlier work this paper cites.

P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, “On universal and fault-tolerant quantum computing,” arXiv preprint quant-ph/9906054 , 1999

1999

Earlier work this paper cites.

D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature , vol. 402, no. 6760, pp. 390–393, 1999

1999

Earlier work this paper cites.

——, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review , vol. 41, no. 2, pp. 303–332, 1999

1999

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, 2005

2005

Cited alongside, same era.

B. W. Reichardt, “Quantum universality from magic states distillation applied to css codes,” Quantum Information Processing , vol. 4, no. 3, pp. 251–264, 2005

2005

Cited alongside, same era.

B. Zeng, X. Chen, and I. L. Chuang, “Semi-Clifford operations, structure of 𝒞 k \mathcal{C}_{k} hierarchy, and gate complexity for fault-tolerant quantum computation,” Physical Review A , vol. 77, no. 4, p. 042313, 2008

2008

Cited alongside, same era.

S. Beigi and P. W. Shor, “ 𝒞 3 \mathcal{C}_{3} , semi-Clifford and generalized semi-Clifford operations,” arXiv preprint arXiv:0810.5108 , 2008

Original

2008

Cited alongside, same era.

E. T. Campbell and M. Howard, “Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost,” Physical Review A , vol. 95, no. 2, p. 022316, 2017

2017

Later among the works it cites.

J. Haah and M. B. Hastings, “Codes and protocols for distilling t t , controlled- s s , and toffoli gates,” Quantum , vol. 2, p. 71, 2018

2018

Later among the works it cites.

J. Haah, “Towers of generalized divisible quantum codes,” Physical Review A , vol. 97, no. 4, p. 042327, 2018

2018

Later among the works it cites.

N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Unifying the Clifford hierarchy via symmetric matrices over rings,” Physical Review A , vol. 100, no. 2, p. 022304, 2019

2019

Later among the works it cites.

A. Krishna and J.-P. Tillich, “Towards low overhead magic state distillation,” Physical review letters , vol. 123, no. 7, p. 070507, 2019