Risk-Adapted Investment Strategies using Quantum-enhanced Machine Learning Models
Keywords:
Quantum computing, ensemble learning, portfolio optimization, risk assessment, financial modelingAbstract
In financial modeling offering unparalleled computational advantages in risk-adapted investment strategies is a significant cultural shift which is represented by Quantum-enhanced machine learning. The objective of this research is to introduce QuantumBoost which is a quantum-enhanced in ensemble learning framework which is design to optimise portfolio for risk assessment and predict accuracy in volatile financial markets.
Downloads
References
P. Rebentrost, M. Mohseni, and S. Lloyd, “Quantum support vector machine for big data classification,” Physical Review Letters, vol. 113, no. 13, p. 130503, 2014.
M. Benedetti, J. Realpe-Gómez, R. Biswas, and A. Perdomo-Ortiz, “A generative modeling approach for benchmarking and training shallow quantum circuits,” npj Quantum Information, vol. 5, no. 1, p. 45, 2019.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint arXiv:1411.4028, 2014.
S. Bravyi, D. Gosset, and R. König, “Quantum advantage with shallow circuits,” Science, vol. 362, no. 6412, pp. 308–311, 2018.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, “On the complexity and verification of quantum random circuit sampling,” Nature Physics, vol. 15, no. 2, pp. 159–163, 2019.
W. Zeng et al., “Exploring quantum advantage in reinforcement learning,” Nature Physics, vol. 18, no. 8, pp. 891–897, 2022.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Physical Review E, vol. 58, no. 5, pp. 5355–5363, 1998.
S. Lloyd, “Quantum algorithms for supervised and unsupervised machine learning,” arXiv preprint arXiv:1812.11075, 2018.
G. E. Santoro, R. Martonak, E. Tosatti, and R. Car, “Theory of quantum annealing of an Ising spin glass,” Science, vol. 295, no. 5564, pp. 2427–2430, 2002.
A. Perdomo-Ortiz, M. Benedetti, J. Realpe-Gómez, and R. Biswas, “Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers,” Quantum Science and Technology, vol. 3, no. 3, p. 030502, 2018.
J. R. McClean et al., “OpenFermion: The electronic structure package for quantum computers,” Quantum Science and Technology, vol. 5, no. 3, p. 034014, 2020.
S. Arunachalam and R. de Wolf, “Optimal quantum sample complexity of learning algorithms,” Journal of Machine Learning Research, vol. 19, no. 1, pp. 2879–2879, 2018.
D. Venturelli, A. Kondratyev, and G. Trummer, “Quantum optimization for finance: Lessons from portfolio optimization,” IEEE Transactions on Quantum Engineering, vol. 1, pp. 1–12, 2020.
M. Schuld and N. Killoran, “Quantum machine learning in feature Hilbert spaces,” Physical Review Letters, vol. 122, no. 4, p. 040504, 2019.
J. Preskill, “Quantum computing in the NISQ era and beyond,” Quantum, vol. 2, p. 79, 2018.
R. Babbush, J. McClean, D. Wecker, A. Aspuru-Guzik, and N. Wiebe, “Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation,” Physical Review A, vol. 91, no. 2, p. 022311, 2015.
G. H. Low and I. L. Chuang, “Optimal Hamiltonian simulation by quantum signal processing,” Physical Review Letters, vol. 118, no. 1, p. 010501, 2017.
C. Neill et al., “A blueprint for demonstrating quantum supremacy with superconducting qubits,” Science, vol. 360, no. 6385, pp. 195–199, 2018.
F. Arute et al., “Quantum supremacy using a programmable superconducting processor,” Nature, vol. 574, no. 7779, pp. 505–510, 2019.
N. Wiebe, A. Kapoor, and K. M. Svore, “Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning,” Quantum Information & Computation, vol. 15, no. 3–4, pp. 316–356, 2015.
