Optimal Ancilla-free Pauli+V Circuits for Axial Rotations

A. Y. Khinchin, “Continued Fractions,” The University of Chicago Press, 1964

1964

Earlier work this paper cites.

G. L. Miller, “Riemann’s hypothesis and tests for primality,” Computer and System Sciences 13, 300–317 (1976)

1976

Earlier work this paper cites.

G. Hardy and E. Wright, “An Introduction to the Theory of Numbers,” Clarendon Press, 1979

1979

Earlier work this paper cites.

M. O. Rabin, “Probabilistic algorithm for testing primality,” Journal of Number Theory 12, 128–138 (1980)

1980

Earlier work this paper cites.

M. O. Rabin, “Probabilistic algorithms in finite fields,” SIAM J. Comput. 9:2, 273–280 (1980)

1980

Earlier work this paper cites.

A. Lubotsky, R. Phillips and P. Sarnak, “Hecke operators and distributing points on S 2 S^{2} , I,” Comm. Pure and Appl. Math. 34, 149–186 (1986)

1986

Earlier work this paper cites.

M. O. Rabin and J. O. Shallit, “Randomized algorithms in number theory,” Comm. Pure and Appl. Math. 39, 239–256 (1986)

1986

Earlier work this paper cites.

A. Lubotsky, R. Phillips and P. Sarnak, “Hecke operators and distributing points on S 2 S^{2} , II,” Comm. Pure and Appl. Math. 40, 401–420 (1987)

1987

Earlier work this paper cites.

M. Grötschel, L. Lovász and A. Schrijver, “Geometric algorithms and combinatorial optimization,” 2nd corrected edition, Springer 1994

1994

Cited alongside, same era.

M. N. Huxley, “Area, Lattice points and Exponential Sums,” Clarendon Press, 1996

1996

Cited alongside, same era.

P. W. Shor, “Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing 26, 1484–1509 (1997)

1997

Cited alongside, same era.

M. A. Nielsen and I. Chuang, “Quantum Computation and Quantum Information,” Cambridge University Press, 2000

2000

Cited alongside, same era.

A. W. Harrow, B. Recht and I. L. Chuang, “Efficient discrete approximations of quantum gates,” J. Math. Phys. 43:9, 4445 (2002)

2002

Cited alongside, same era.

P. Selinger, “Efficient Clifford+T approximation of single-qubit operators,” arXive 1212.6253 (2012)

Original

2012

Later among the works it cites.

A. Bocharov, Y. Gurevich and K. Svore, “Efficient decomposition of single-qubit gates into V basis circuits,” Physical Review A 88, 012313 (2013)

2013

Later among the works it cites.

V. Kliuchnikov, A. Bocharov and K. Svore, “Asymptotically optimal topological quantum compiling, arXiv 1310.4150 (2013)

2013

Later among the works it cites.

Mathematics Stack Exchange, #421353, “Are primes randomly distributed?” (2013), http://math.stackexchange.com/questions/421353/

2013

Later among the works it cites.

A. Bocharov, M. Roetteler, and K. Svore, “Efficient synthesis of probabilistic quantum circuits with fallback,” arXiv 1409.3552 (2014)

2014

Closest in time.