Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count

E. F. Assmus and J. D. Key, Designs and their Codes , 103 (Cambridge University Press, 1992)

1992

Earlier work this paper cites.

Z. Furedi, F. Lazebnik, A. Seress, V. A. Ustimenko, and A. J. Woldar, “Graphs of prescribed girth and bi-degree,” Journal of Combinatorial Theory, Series B 64

1995

Earlier work this paper cites.

P. W. Shor, “Fault-tolerant quantum computation,” in Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on (1996) pp. 56–65, quant-ph/9605011

1996

Earlier work this paper cites.

E. Knill, R. Laflamme, and W. Zurek, “Threshold accuracy for quantum computation,” (1996), quant-ph/9610011

1996

Earlier work this paper cites.

D. Gottesman, “A class of quantum error-correcting codes saturating the quantum hamming bound,” Phys. Rev. A 54

1996

Earlier work this paper cites.

A. M. Steane, “Error correcting codes in quantum theory,” Physical Review Letters 77

1996

Earlier work this paper cites.

A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A 54

1996

Earlier work this paper cites.

M. Sipser and D. A. Spielman, “Expander codes,” IEEE Transactions on Information Theory 42

1996

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,” Phys. Rev. Lett. 78

1997

Earlier work this paper cites.

D. Gottesman, “Stabilizer codes and quantum error correction,” (1997), quant-ph/9705052

1997

Earlier work this paper cites.

I. L. Chuang and D. Gottesman, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402

1999

Earlier work this paper cites.

M. Grassl and T. Beth, “Quantum bch codes,” in Proceedings X. International Symposium on Theoretical Electrical Engineering, Magdeburg (1999) pp. 207–212, quant-ph/9910060

1999

Earlier work this paper cites.

G. Nebe, E. M. Rains, and N. J. A. Sloane, “The invariants of the clifford groups,” Designs, Codes and Cryptography 24

2001

Earlier work this paper cites.

S. Lang, Algebra , revised 3rd ed. (Springer, 2002)

2002

Earlier work this paper cites.

S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A 71

2005

Earlier work this paper cites.

B. W. Reichardt, “Improved magic states distillation for quantum universality,” Quant. Inf. Proc. 4

2005

Cited alongside, same era.

H. Bombin and M. A. Martin-Delgado, “Topological quantum distillation,” Physical Review Letters 97

2006

Cited alongside, same era.

G. Nebe, E. M. Rains, and N. J. A. Sloane, Self-Dual Codes and Invariant Theory (Springer-Verlag, 2006)

2006

Cited alongside, same era.

R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault-tolerance in cluster state quantum computation,” New Journal of Physics 9

2007

Cited alongside, same era.

D. Aharonov and M. Ben-Or, “Fault tolerant quantum computation with constant error,” SIAM J. Comput. 38

2008

Cited alongside, same era.

B. Eastin and E. Knill, “Restrictions on transversal encoded quantum gate sets,” Phys. Rev. Lett. 102

S. Bravyi and R. König, “Classification of topologically protected gates for local stabilizer codes,” Phys. Rev. Lett 110

Original

2013

Later among the works it cites.

B. Eastin, “Distilling one-qubit magic states into toffoli states,” Phys. Rev. A 87

Original

2013

Later among the works it cites.

T. Jochym-O’Connor and R. Laflamme, “Using concatenated quantum codes for universal fault-tolerant quantum gates,” Phys. Rev. Lett. 112

Original

2014

Later among the works it cites.

J. T. Anderson, G. Duclos-Cianci, and D. Poulin, “Fault-tolerant conversion between the steane and reed-muller quantum codes,” Phys. Rev. Lett. 113

Original

2014

Later among the works it cites.

E. T. Campbell, “Enhanced fault-tolerant quantum computing in d d -level systems,” Phys. Rev. Lett. 113