Fetching the paper…
Reading the bibliography…
Quantum computers will be able solve important problems with significant polynomial and exponential speedups over their classical counterparts, for instance in option pricing in finance, and in real-space molecular chemistry simulations.
F. B. Hildebrand, Introduction to numerical analysis (Courier Corporation, 1987)
1987
Earlier work this paper cites.
E. L. Crow and K. Shimizu, Lognormal distributions (Marcel Dekker New York, 1987)
1987
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996) pp. 212–219
1996
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert, Quantum networks for elementary arithmetic operations, Physical Review A 54
1996
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum computation by adiabatic evolution, arXiv preprint quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
P. Borwein, An efficient algorithm for the Riemann zeta function, in Canadian Mathematical Society Conference Proceedings , Vol. 27 (2000) pp. 29–34
2000
Earlier work this paper cites.
T. G. Draper, Addition on a quantum computer, arXiv preprint quant-ph/0008033 (2000)
2000
Earlier work this paper cites.
W. Van Dam, M. Mosca, and U. Vazirani, How powerful is adiabatic quantum computation?, in Proceedings 42nd IEEE Symposium on Foundations of Computer Science (IEEE, 2001) pp. 279–287
2001
Earlier work this paper cites.
L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions, arXiv preprint quant-ph/0208112 (2002)
2002
Earlier work this paper cites.
M. A. Nielsen and I. Chuang, Quantum computation and quantum information (2002)
2002
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) pp. 20–29
2003
Earlier work this paper cites.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk, in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) pp. 59–68
2003
Earlier work this paper cites.
A. M. Childs, Quantum information processing in continuous time , Ph.D. thesis, Massachusetts Institute of Technology (2004)
2004
Earlier work this paper cites.
T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, A logarithmic-depth quantum carry-lookahead adder, arXiv preprint quant-ph/0406142 (2004)
2004
Earlier work this paper cites.
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse hamiltonians, Communications in Mathematical Physics 270
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Physical review letters 103
2009
Earlier work this paper cites.
N. J. Ward, I. Kassal, and A. Aspuru-Guzik, Preparation of many-body states for quantum simulation, The Journal of chemical physics 130
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
H. Tasaki, Convergence rates of approximate sums of riemann integrals, Journal of approximation theory 161
2009
Earlier work this paper cites.
M. Plesch and Č. Brukner, Quantum-state preparation with universal gate decompositions, Physical Review A 83
2011
Cited alongside, same era.
F. Casas, A. Murua, and M. Nadinic, Efficient computation of the zassenhaus formula, Computer Physics Communications 183
2012
Cited alongside, same era.
S. P. Jordan, K. S. Lee, and J. Preskill, Quantum algorithms for quantum field theories, Science 336
2012
Cited alongside, same era.
2013
Cited alongside, same era.
S. Lloyd, M. Mohseni, and P. Rebentrost, Quantum principal component analysis, Nature Physics 10
2014
Cited alongside, same era.
H.-S. Zhong, Y.-H. Deng, J. Qin, H. Wang, M.-C. Chen, L.-C. Peng, Y.-H. Luo, D. Wu, S.-Q. Gong, H. Su, Y. Hu, P. Hu, X.-Y. Yang, W.-J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.-L. Liu, J. J. Renema, C.-Y. Lu, and J.-W. Pan, Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light, Physical Review Letters 127
2021
Later among the works it cites.
Y. Wu, W.-S. Bao, S. Cao, F. Chen, M.-C. Chen, X. Chen, T.-H. Chung, H. Deng, Y. Du, D. Fan, M. Gong, C. Guo, C. Guo, S. Guo, L. Han, L. Hong, H.-L. Huang, Y.-H. Huo, L. Li, N. Li, S. Li, Y. Li, F. Liang, C. Lin, J. Lin, H. Qian, D. Qiao, H. Rong, H. Su, L. Sun, L. Wang, S. Wang, D. Wu, Y. Xu, K. Yan, W. Yang, Y. Yang, Y. Ye, J. Yin, C. Ying, J. Yu, C. Zha, C. Zhang, H. Zhang, K. Zhang, Y. Zhang, H. Zhao, Y. Zhao, L. Zhou, Q. Zhu, C.-Y. Lu, C.-Z. Peng, X. Zhu, and J.-W. Pan, Strong Quantum Computational Advantage Using a Superconducting Quantum Processor, Physical Review Letters 127
2021
Later among the works it cites.
S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, S. Choi, S. Sachdev, M. Greiner, V. Vuletić, and M. D. Lukin, Quantum phases of matter on a 256-atom programmable quantum simulator, Nature 595
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Owens, Exploring the rate of convergence of approximations to the riemann integral (2014)
2014
Cited alongside, same era.
A. Montanaro, Quantum speedup of monte carlo methods, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471
2015
Cited alongside, same era.
D. W. Berry, A. M. Childs, and R. Kothari, Hamiltonian simulation with nearly optimal dependence on all parameters, in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (IEEE, 2015) pp. 792–809
2015
Cited alongside, same era.
2015
Cited alongside, same era.
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Quantum circuit learning, Physical Review A 98
2018
Cited alongside, same era.
P. Rebentrost, A. Steffens, I. Marvian, and S. Lloyd, Quantum singular-value decomposition of nonsparse low-rank matrices, Physical review A 97
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2021
Later among the works it cites.
M. Gong, S. Wang, C. Zha, M.-C. Chen, H.-L. Huang, Y. Wu, Q. Zhu, Y. Zhao, S. Li, S. Guo, H. Qian, Y. Ye, F. Chen, C. Ying, J. Yu, D. Fan, D. Wu, H. Su, H. Deng, H. Rong, K. Zhang, S. Cao, J. Lin, Y. Xu, L. Sun, C. Guo, N. Li, F. Liang, V. M. Bastidas, K. Nemoto, W. J. Munro, Y.-H. Huo, C.-Y. Lu, C.-Z. Peng, X. Zhu, and J.-W. Pan, Quantum walks on a programmable two-dimensional 62-qubit superconducting processor, Science 372
2021
Later among the works it cites.
S. Chakrabarti, R. Krishnakumar, G. Mazzola, N. Stamatopoulos, S. Woerner, and W. J. Zeng, A threshold for quantum advantage in derivative pricing, Quantum 5
2021
Later among the works it cites.
M. Pistoia, S. F. Ahmad, A. Ajagekar, A. Buts, S. Chakrabarti, D. Herman, S. Hu, A. Jena, P. Minssen, P. Niroula, et al. , Quantum machine learning for finance iccad special session paper, in 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD) (IEEE, 2021) pp. 1–9
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
A. C. Vazquez and S. Woerner, Efficient state preparation for quantum amplitude estimation, Physical Review Applied 15
2021
Later among the works it cites.
S. Herbert, No quantum speedup with grover-rudolph state preparation for quantum monte carlo integration, Physical Review E 103
2021
Later among the works it cites.
2021
Later among the works it cites.
A. G. Rattew, Y. Sun, P. Minssen, and M. Pistoia, The efficient preparation of normal distributions in quantum registers, Quantum 5
2021
Later among the works it cites.
B. Koczor, Exponential error suppression for near-term quantum devices, Physical Review X 11
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
G. Agliardi and E. Prati, Optimal tuning of quantum generative adversarial networks for multivariate distribution loading, Quantum Reports 4
2022
Closest in time.