Fetching the paper…
Reading the bibliography…
An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary.
A. Fletcher, J. C. P. Miller, L. Rosenhead, and L. J. Comrie, An Index of Mathematical Tables
1962
Earlier work this paper cites.
E. Fredkin and T. Toffoli, “ Conservative logic
1982
Earlier work this paper cites.
L. B. Almeida, “ The fractional Fourier transform and time-frequency representations
1994
Earlier work this paper cites.
A. Kitaev, “ Quantum measurements and the Abelian Stabilizer Problem
1995
Earlier work this paper cites.
L. K. Grover, “ A fast quantum mechanical algorithm for database search
1996
Earlier work this paper cites.
I. Chuang and M. Nielsen, “ Prescription for experimental determination of the dynamics of a quantum black box
1997
Earlier work this paper cites.
C. Bennett, E. Bernstein, G. Brassard, U. Vazirani, “ Strengths and Weaknesses of Quantum Computing
1997
Earlier work this paper cites.
P. Shor, “ Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
1997
Earlier work this paper cites.
E. Farhi and S. Gutmann, “ Analog analogue of a digital quantum computation
1998
Cited alongside, same era.
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, “ Quantum algorithms revisited
1998
Cited alongside, same era.
C. Zalka, “ Efficient simulation of quantum systems by quantum computers
1998
Cited alongside, same era.
M. Nielsen and I. Chuang, Quantum Computation and Quantum Information
2000
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, “ A numerical study of the performance of a quantum adiabatic evolution algorithm for satisfiability
2000
Cited alongside, same era.
L. Ioannou, “ Continuous-time Quantum Algorithms: Searching and Adiabatic Computation
2002
A. Klappenecker and M. Rötteler, “ Quantum Software Reusability
2003
Later among the works it cites.
S. Aaronson, “ The learnability of quantum states
2006
Later among the works it cites.
C. Mochon, “ Hamiltonian Oracles
2007
Later among the works it cites.
P. Kaye, R. Laflamme, and M. Mosca, “ An Introduction to Quantum Computing
2007
Later among the works it cites.
W. van Dam, G. M. D’Ariano, E. Ekert, C. Macchiavello, and M. Mosca, “ Optimal quantum circuits for general phase estimation
2007
Later among the works it cites.
A. Ambainis and J. Emerson, “ Quantum t-designs: t-wise Independence in the Quantum World
2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
G. Brassard, P. Høyer, M. Mosca and A. Tapp, “ Quantum Amplitude Amplification and Estimation
2002
Cited alongside, same era.
J. Roland and N. J. Cerf, “ Quantum circuit implementation of the Hamiltonian versions of Grover’s algorithm
2003
Cited alongside, same era.
2008
Closest in time.
R. Cleve, D. Gottesman, M. Mosca, R. Somma, D. Yonge-Malo, “ Efficient discrete-time simulations of continuous-time quantum query algorithms
2009
Closest in time.