Fetching the paper…
Reading the bibliography…
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT).
R. Bracewell, The fast Hartley transform, Proc. IEEE 72
1984
Earlier work this paper cites.
G. Beylkin, R. Coifman, and V. Rokhlin, Fast wavelet transforms and numerical algorithms I, Commun. Pure Appl. Math. 44
1991
Earlier work this paper cites.
B. C. Berndt, Ramanujan’s Notebooks. Part III (Springer-Verlag, New York, 1991)
1991
Earlier work this paper cites.
I. Daubechies, Ten Lectures on Wavelets (Society for Industrial and Applied Mathematics, Philadelphia, 1992)
1992
Earlier work this paper cites.
G. Beylkin, On the representation of operators in bases of compactly supported wavelets, SIAM J. Numer. Anal. 29
1992
Earlier work this paper cites.
D. Bini and P. Favati, On a matrix algebra related to the discrete Hartley transform, SIAM J. Matrix Anal. Appl. 14
1993
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators, Science 273
1996
Earlier work this paper cites.
E. Knill, Conventions for Quantum Pseudocode , Technical Report LA-UR-96-2724 (Los Alamos National Lab, 1996)
1996
Earlier work this paper cites.
C. A. Neff and J. H. Reif, An efficient algorithm for the complex roots problem, J. Complex. 12
1996
Earlier work this paper cites.
D. E. Knuth, The Art of Computer Programming , 3rd ed., Vol. 2 (Addison-Wesley, Boston, 1997)
1997
Earlier work this paper cites.
C. K. Chui, Wavelets: A Mathematical Tool for Signal Analysis (Society for Industrial and Applied Mathematics, Philadelphia, 1997)
1997
Earlier work this paper cites.
C. Zalka, Simulating quantum systems on a quantum computer, Proc. Math. Phys. Eng. Sci. 454
1998
Earlier work this paper cites.
M. Benzi and G. H. Golub, Bounds for the entries of matrix functions with applications to preconditioning, BIT Numer. Math. 39
1999
Earlier work this paper cites.
L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions, arXiv:quant-ph/0208112 (2002)
2002
Earlier work this paper cites.
G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, in Quantum Computation and Information , Contemporary Mathematics, Vol. 305 (American Mathematical Society, Washington DC, 2002)
2002
Earlier work this paper cites.
A. Klappenecker and M. Roetteler, Quantum software reusability, Int. J. Found. Comput. Sci. 14
2003
Earlier work this paper cites.
H. J. Rothe, Lattice Gauge Theories: An Introduction , 3rd ed., World Scientific Lecture Notes in Physics, Vol. 74 (World Scientific, Singapore, 2005)
2005
Earlier work this paper cites.
C.-C. Tseng and T.-M. Hwang, Quantum circuit design of discrete Hartley transform using recursive decomposition formula, in 2005 IEEE Int. Symp. Circuits Syst. , Vol. 1 (IEEE, Kobe, 2005) pp. 824–827
2005
Earlier work this paper cites.
T. Byrnes and Y. Yamamoto, Simulating lattice gauge theories on a quantum computer, Phys. Rev. A 73
2006
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, Quantum random access memory, Phys. Rev. Lett. 100
2008
Earlier work this paper cites.
M. Lanzagorta and J. Uhlmann, Quantum Computer Science , Synthesis Lectures on Quantum Computing, Vol. 2 (Morgan & Claypool, 2008) pp. 28–29
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
S. Mallat, A Wavelet Tour of Signal Processing: The Sparse Way , 3rd ed. (Academic Press, Orlando, 2009)
2009
Cited alongside, same era.
N. J. Higham, Cholesky factorization, WIREs Comput. Stat. 1
2009
Cited alongside, same era.
2010
Cited alongside, same era.
M. Blasone, P. Jizba, and G. Vitiello, Quantum Field Theory and Its Macroscopic Manifestations (Imperial College Press, London, 2011)
2011
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, New York, 2011)
2011
Cited alongside, same era.
2018
Later among the works it cites.
Y. R. Sanders, G. H. Low, A. Scherer, and D. W. Berry, Black-box quantum state preparation without arithmetic, Phys. Rev. Lett. 122
2019
Later among the works it cites.
N. Klco and M. J. Savage, Digitization of scalar fields for quantum computing, Phys. Rev. A 99
2019
Later among the works it cites.
R. Babbush, D. W. Berry, J. R. McClean, and H. Neven, Quantum simulation of chemistry with sublinear scaling in basis size, npj Quantum Inf. 5
2019
Later among the works it cites.
C. Gidney, Asymptotically efficient quantum Karatsuba multiplication, arXiv:1904.07356 (2019)
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Arndt, Matters Computational: ideas, algorithms, source code (Springer-Verlag, Berlin, 2011)
2011
Cited alongside, same era.
S. P. Jordan, K. S. M. Lee, and J. Preskill, Quantum algorithms for quantum field theories, Science 336
2012
Cited alongside, same era.
J. A. Miszczak, High-level Structures for Quantum Computing , Synthesis Lectures on Quantum Computing, Vol. 6 (Morgan & Claypool, 2012) pp. 45–48
2012
Cited alongside, same era.
R. A. Horn and C. Johnson, Matrix Analysis , 2nd ed. (Cambridge University Press, New York, 2012)
2012
Cited alongside, same era.
F. Bulut and W. N. Polyzou, Wavelets in field theory, Phys. Rev. D 87
2013
Cited alongside, same era.
M. T. Goodrich and R. Tamassia, Algorithm Design and Applications , 1st ed. (Wiley, Hoboken, 2014)
2014
Cited alongside, same era.
G. K. Brennen, P. Rohde, B. C. Sanders, and S. Singh, Multiscale quantum simulation of quantum field theory using wavelets, Phys. Rev. A 92
2015
Cited alongside, same era.
D. W. Berry, C. Gidney, M. Motta, J. R. McClean, and R. Babbush, Qubitization of arbitrary basis quantum chemistry leveraging sparsity and low rank factorization, Quantum 3
2019
Later among the works it cites.
P. C. S. Costa, S. Jordan, and A. Ostrander, Quantum algorithm for simulating the wave equation, Phys. Rev. A 99
2019
Later among the works it cites.
A. Altland and J. von Delft, Mathematics for Physicists: Introductory Concepts and Methods (Cambridge University Press, Cambridge, 2019)
2019
Later among the works it cites.
A. Roggero, A. C. Y. Li, J. Carlson, R. Gupta, and G. N. Perdue, Quantum computing for neutrino-nucleus scattering, Phys. Rev. D 101
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Lee, J. Bonitati, G. Given, C. Hicks, N. Li, B.-N. Lu, A. Rai, A. Sarkar, and J. Watkins, Projected cooling algorithm for quantum computation, Phys. Lett. B 807
2020
Later among the works it cites.
E. J. Gustafson, Projective cooling for the transverse Ising model, Phys. Rev. D 101
2020
Later among the works it cites.
R. Asaka, K. Sakai, and R. Yahagi, Quantum circuit for the fast Fourier transform, Quantum Inf. Process. 19
2020
Later among the works it cites.
2020
Later among the works it cites.
Q. Wang and M. Ying, Quantum random access stored-program machines, arXiv:2003.03514 (2020)
2020
Later among the works it cites.
2020
Later among the works it cites.
E. J. Gustafson and H. Lamm, Toward quantum simulations of ℤ 2 \mathds{Z}_{2} gauge theory without state preparation, Phys. Rev. D 103
2021
Closest in time.
K. Choi, D. Lee, J. Bonitati, Z. Qian, and J. Watkins, Rodeo algorithm for quantum computing, Phys. Rev. Lett. 127
2021
Closest in time.
J. Alman and V. V. Williams, A refined laser method and faster matrix multiplication, in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (SIAM, Alexandria, 2021) pp. 522–539
2021
Closest in time.
S. Arfaoui, A. B. Mabrouk, and C. Cattani, Wavelet Analysis: Basic Concepts and Applications (CRC Press, Boca Raton, 2021)
2021
Closest in time.
M. Bagherimehrab, Algorithmic quantum-state generation for simulating quantum field theories on a quantum computer , Ph.D. thesis , University of Calgary, Calgary, AB (2022)
2022
Closest in time.