Fetching the paper…
Reading the bibliography…
This paper proposes a method of quantum Monte Carlo integration that retains the full quadratic quantum advantage, without requiring any arithmetic or quantum phase estimation to be performed on the quantum computer.
G. Brassard, P. Høyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” pp. 53–74, 2002. [Online]. Available: https://doi.org/10.1090/conm/305/05215
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” 2002. [Online]. Available: https://doi.org/10.48550/arxiv.quant-ph/0208112
2002
Earlier work this paper cites.
A. Bouland, W. van Dam, H. Joorati, I. Kerenidis, and A. Prakash, “Prospects and challenges of quantum finance,” 2020. [Online]. Available: https://doi.org/10.48550/arxiv.2011.06492
2011
Earlier work this paper cites.
A. Montanaro, “Quantum speedup of Monte Carlo methods,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 471, no. 2181, p. 20150301, 2015. [Online]. Available: https://doi.org/10.1098/rspa.2015.0301
2015
Earlier work this paper cites.
P. Rebentrost and S. Lloyd, “Quantum computational finance: quantum algorithm for portfolio optimization,” 2018. [Online]. Available: https://doi.org/10.48550/arxiv.1811.03975
2018
Earlier work this paper cites.
P. Rebentrost, B. Gupt, and T. R. Bromley, “Quantum computational finance: Monte Carlo pricing of financial derivatives,” Physical Review A , vol. 98, no. 2, Aug 2018. [Online]. Available: https://doi.org/10.1103/physreva.98.022321
2018
Earlier work this paper cites.
T. Häner, M. Roetteler, and K. M. Svore, “Optimizing quantum circuits for arithmetic,” 2018. [Online]. Available: https://doi.org/10.48550/arxiv.1805.12445
2018
Earlier work this paper cites.
J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum , vol. 2, p. 79, Aug 2018. [Online]. Available: http://doi.org/10.22331/q-2018-08-06-79
2018
Earlier work this paper cites.
R. Orús, S. Mugel, and E. Lizaso, “Quantum computing for finance: Overview and prospects,” Reviews in Physics , vol. 4, p. 100028, 2019. [Online]. Available: https://doi.org/10.1016/j.revip.2019.100028
2019
Earlier work this paper cites.
S. Woerner and D. J. Egger, “Quantum risk analysis,” npj Quantum Information , vol. 5, no. 1, Feb 2019. [Online]. Available: http://doi.org/10.1038/s41534-019-0130-6
2019
Earlier work this paper cites.
D. J. Egger, R. García Gutiérrez, J. C. Mestre, and S. Woerner, “Credit risk analysis using quantum computers,” IEEE Transactions on Computers , vol. 70, no. 12, pp. 2136–2145, 2021. [Online]. Available: https://doi.org/10.1109/TC.2020.3038063
2020
Cited alongside, same era.
D. J. Egger, C. Gambella, J. Marecek, S. McFaddin, M. Mevissen, R. Raymond, A. Simonetto, S. Woerner, and E. Yndurain, “Quantum computing for finance: State-of-the-art and future prospects,” IEEE Transactions on Quantum Engineering , vol. 1, pp. 1–24, 2020. [Online]. Available: https://doi.org/10.1109/TQE.2020.3030314
2020
Cited alongside, same era.
K. Miyamoto and K. Shiohara, “Reduction of qubits in a quantum algorithm for monte carlo simulation by a pseudo-random-number generator,” Physical Review A , vol. 102, no. 2, Aug 2020. [Online]. Available: https://doi.org/10.1103/PhysRevA.102.022424
2020
Cited alongside, same era.
C. Blank, D. K. Park, and F. Petruccione, “Quantum-enhanced analysis of discrete stochastic processes,” NPJ Quantum Information , vol. 7, no. 126, 2021. [Online]. Available: https://doi.org/10.1038/s41534-021-00459-2
2021
Closest in time.
D. An, N. Linden, J.-P. Liu, A. Montanaro, C. Shao, and J. Wang, “Quantum-accelerated multilevel monte carlo methods for stochastic differential equations in mathematical finance,” Quantum , vol. 5, p. 481, jun 2021. [Online]. Available: https://doi.org/10.22331/q-2021-06-24-481
2021
Closest in time.
S. Chakrabarti, R. Krishnakumar, G. Mazzola, N. Stamatopoulos, S. Woerner, and W. J. Zeng, “A threshold for quantum advantage in derivative pricing,” Quantum , vol. 5, p. 463, jun 2021. [Online]. Available: https://doi.org/10.22331/q-2021-06-01-463
2021
Closest in time.
K. Kubo, Y. O. Nakagawa, S. Endo, and S. Nagayama, “Variational quantum simulations of stochastic differential equations,” Phys. Rev. A , vol. 103, p. 052425, May 2021. [Online]. Available: https://doi.org/10.1103/PhysRevA.103.052425
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
S. Aaronson and P. Rall, “Quantum approximate counting, simplified,” Symposium on Simplicity in Algorithms , p. 24–32, Jan 2020. [Online]. Available: http://doi.org/10.1137/1.9781611976014.5
2020
Cited alongside, same era.
K. Nakaji, “Faster amplitude estimation,” Quantum Information and Computation , vol. 20, no. 13&14, pp. 1109–1123, nov 2020. [Online]. Available: https://doi.org/10.26421/qic20.13-14-2
2020
Cited alongside, same era.
I. Kerenidis and A. Prakash, “A method for amplitude estimation with noisy intermediate-scale quantum computers. U.S. Patent Application No. 16/892,229,” 2020
2020
Cited alongside, same era.
N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, “Option pricing using quantum computers,” Quantum , vol. 4, p. 291, Jul 2020. [Online]. Available: http://doi.org/10.22331/q-2020-07-06-291
2020
Cited alongside, same era.
N. d. Beaudrap and S. Herbert, “Quantum linear network coding for entanglement distribution in restricted architectures,” Quantum , vol. 4, p. 356, Nov 2020. [Online]. Available: http://doi.org/10.22331/q-2020-11-01-356
2020
Cited alongside, same era.
S. Herbert and N. de Beaudrap, “Method of Operating a Quantum Information Processing System. U.S. Patent Application No. 17/064,980,” 2020
2020
Cited alongside, same era.
2021
Closest in time.
S. Herbert, “No quantum speedup with Grover-Rudolph state preparation for quantum Monte Carlo integration,” Physical Review E , vol. 103, no. 6, jun 2021. [Online]. Available: https://doi.org/10.1103/physreve.103.063302
2021
Closest in time.
D. Grinko, J. Gacon, C. Zoufal, and S. Woerner, “Iterative quantum amplitude estimation,” npj Quantum Information , vol. 7, no. 1, mar 2021. [Online]. Available: https://doi.org/10.1038/s41534-021-00379-1
2021
Closest in time.
S. Herbert, “Quantum Computing System and Method: Patent application GB2102902.0 and SE2130060-3,” 2021
2021
Closest in time.
“IBM quantum roadmap.” [Online]. Available: https://www.ibm.com/blogs/research/2021/02/quantum-development-roadmap
2021
Closest in time.
K. Kaneko, K. Miyamoto, N. Takeda, and K. Yoshino, “Quantum pricing with a smile: Implementation of local volatility model on quantum computer,” 2022. [Online]. Available: https://doi.org/10.1140/epjqt/s40507-022-00125-2
2022
Closest in time.
T. Giurgica-Tiron, I. Kerenidis, F. Labib, A. Prakash, and W. Zeng, “Low depth algorithms for quantum amplitude estimation,” Quantum , vol. 6, p. 745, jun 2022. [Online]. Available: https://doi.org/10.22331/q-2022-06-27-745
2022
Closest in time.