Fetching the paper…
Reading the bibliography…
An important task required to build a scalable, fault-tolerant quantum computer is to efficiently represent an arbitrary single-qubit rotation by fault-tolerant quantum operations.
M. H. Freedman, Proc. Natl. Acad. Sci. 95
1998
Earlier work this paper cites.
J. Preskill, in Introduction to Quantum Computation , edited by H.-K. Lo, S. Popescu, and T. Spiller (1998) arxiv:quant-ph/9712048
1998
Earlier work this paper cites.
D. Gottesman, The Heisenberg Representation of Quantum Computers , Ph.D. thesis, Caltech (1998), arXiv:quant-ph/9807006v1
1998
Earlier work this paper cites.
M.A.Nielsen and I.L.Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2000)
2000
Earlier work this paper cites.
M. H. Freedman, M. Larsen, and Z. Wang, Commun. Math. Phys. 227
2002
Earlier work this paper cites.
A. Kitaev et al., Classical and Quantum Computation (American Mathematical Society, Providence, RI, 2002)
2002
Earlier work this paper cites.
A. Kitaev, Ann. Phys. 303
2003
Cited alongside, same era.
S. Aaronson and D. Gottesman, Phys. Rev. A 70
2004
Cited alongside, same era.
S. Bravyi and A. Kitaev, Phys. Rev. A 71
2005
Cited alongside, same era.
C. M. Dawson and M. A. Nielsen, (2005)
2005
Cited alongside, same era.
C. Nayak, S. Simon, A. Stern, M. Freedman, and S. D. Sarma, Rev. Mod. Phys. 80
2008
Cited alongside, same era.
H. Bombin and M. A. Martin-Delgado, Journal of Physics A Mathematical General 42
2009
Later among the works it cites.
A. G. Fowler, A. M. Stephens, and P. Groszkowski, Phys. Rev. A 80
2009
Later among the works it cites.
A. M. Meier, B. Eastin, and E. Knill, arXiv:1204.4221v1 (2012)
2012
Closest in time.
S. Bravyi and J. Haah, (2012) , 1209.2426
2012
Closest in time.
A. Bocharov and K. M. Svore, arXiv:1206.3223v1 (2012)
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…