Fetching the paper…
Reading the bibliography…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over Abelian groups, solving systems of linear equations, and phase estimation, to name a few.
Quantum algorithm for molecular properties and geometry optimization,
I. Kassal and A. Aspuru-Guzik, · 1921
Earlier work this paper cites.
Quantum measurements and the Abelian Stabilizer Problem,
A. Kitaev, · 1995
Earlier work this paper cites.
Approximate quantum Fourier transform and decoherence,
A. Barenco, A. Ekert, K.-A. Suominen, and P. Törmä, · 1996
Earlier work this paper cites.
Semiclassical Fourier transform for quantum computation,
R. B. Griffiths and C. S. Niu, · 1996
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,
P. Shor, · 1997
Earlier work this paper cites.
An exact quantum polynomial-time slgorithm for Simon’s Problem,
G. Brassard and P. Hoyer, · 1997
Earlier work this paper cites.
Quantum computers can search rapidly by using almost any transformation,
L. Grover, · 1998
Earlier work this paper cites.
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,
D. S. Abrams and S. Lloyd, · 1999
Earlier work this paper cites.
Addition on a quantum computer,
T. G. Draper, · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang, · 2000
Earlier work this paper cites.
An approximate Fourier transform useful in quantum factoring,
D. Coppersmith, (2002), · 2002
Earlier work this paper cites.
General-purpose parallel simulator for quantum computing,
J. Niwa, K. Matsumoto, and H. Imai, · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi, · 2002
Earlier work this paper cites.
Quantum software reusability,
A. Klappenecker and M. Roetteler, · 2003
Cited alongside, same era.
Scalability of Shor’s algorithm with a limited set of rotation gates,
A. Fowler and L. C. L. Hollenberg, · 2004
Cited alongside, same era.
PSLQ integer relation algorithm implementation, (2004),
P. Bertok, (2004), · 2004
Cited alongside, same era.
Universal quantum computation with ideal Clifford gates and noisy ancillas,
S. Bravyi and A. Kitaev, · 2005
Cited alongside, same era.
The quantum Fourier transform on a linear nearest neighbor architecture,
Y. Takahashi, N. Kunihiro, and K. Ohta, · 2007
Cited alongside, same era.
Linear depth stabilizer and quantum Fourier transformation circuits with no auxiliary qubits in finite neighbor quantum architectures,
D. Maslov, · 2007
Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates,
V. Kliuchnikov, D. Maslov, and M. Mosca, · 2013
Later among the works it cites.
Quantum cryptographic algorithm for color images using quantum Fourier transform and double random-phase encoding,
Y.–G. Yang, X. Jia, S.–J. Sun, and Q.–X. Pan, · 2014
Later among the works it cites.
Resource requirements for a fault-tolerant quantum Fourier transform,
H. Goto, · 2014
Later among the works it cites.
NIST Speical Publication 800-131A Revision 1
E. Barker and A. Roginsky, · 2015
Later among the works it cites.
Analytical formulas for the performance scaling of quantum processors with a large number of defective gates,
Y. S. Nam and R. Blümel, · 2015
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.
Approximating fractional time quantum evolution,
L. Sheridan, D. Maslov, and M. Mosca, · 2009
Cited alongside, same era.
Quantum algorithm for linear systems of equations,
A. W. Harrow, A. Hassidim, and S. Lloyd, · 2009
Cited alongside, same era.
Simulating chemistry using quantum computers,
I. Kassal, J. D. Whitfield, A. Perdomo-Ortiz, M.-H. Yung, and A. Aspuru-Guzik, · 2011
Cited alongside, same era.
Scaling laws for Shor’s algorithm with a banded quantum Fourier transform,
Y. S. Nam and R. Blümel, · 2013
Cited alongside, same era.
Robustness and performance scaling of a quantum computer with respect to a class of static defects,
Y. S. Nam and R. Blümel, · 2013
Cited alongside, same era.
Novel constructions for the fault-tolerant Toffoli gate,
C. Jones, · 2013
Cited alongside, same era.
A. Bocharov, M. Roetteler, and K. M. Svore,
2015
Later among the works it cites.
Optimal ancilla-free Clifford+T approximation of z-rotations,
N. J. Ross and P. Selinger, · 2016
Later among the works it cites.
Quantum arithmetic with the quantum Fourier transform,
L. Ruiz-Perez and J. C. Garcia-Escartin, · 2017
Later among the works it cites.
Use of global interactions in efficient quantum circuit constructions,
D. Maslov and Y. S. Nam, · 2018
Closest in time.
Halving the cost of quantum addition,
C. Gidney, · 2018
Closest in time.
Automated optimization of large quantum circuits with continuous parameters,
Y. S. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, · 2018
Closest in time.
(2018), https://github.com/y-nam/QFT
Y. S. Nam, Y. Su, and D. Maslov, · 2018
Closest in time.