Fetching the paper…
Reading the bibliography…
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis $\{H, P, T\}$, where $H$, $P$ and $T$ denote the Hadamard, Phase and $\pi/8$ gates, respectively.
P. Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factoring”, Proc. 35th FOCS
1994
Earlier work this paper cites.
P. O. Boykin, T. Mor, M. Pulver, V. P. Roychowdhury, F. Vatan, “On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor’s Basis”, Proc. 40th FOCS
1999
Earlier work this paper cites.
M. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information
2000
Cited alongside, same era.
S. Aaronson, D. Gottesman, “Improved Simulation of Stabilizer Circuits”, Physical Review A, 70:052328 (2004)
2004
Cited alongside, same era.
M. B. Elliott, B. Eastin, and C. M. Caves “Graphical description of the action of Clifford operators on stabilizer states”, quant-ph/0703278
Cited in the paper.
H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver and F. Unger, “New Limits on Fault-Tolerant Quantum Computation”, Proc. 47th FOCS
2006
Later among the works it cites.
C. M. Dawson, M. A. Nielsen, “The Solovey-Kitaev Algorithm”, Quantum Inf. Comput
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…