Quantum versus classical generative modelling in finance
Authors:
Open Access
- 1 April 2021
- journal article
- research article
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 6 (2) , 024013
Abstract
Finding a concrete use case for quantum computers in the near term is still an open question, with machine learning typically touted as one of the first fields which will be impacted by quantum technologies. In this work, we investigate and compare the capabilities of quantum versus classical models for the task of generative modelling in machine learning. We use a real world financial dataset consisting of correlated currency pairs and compare two models in their ability to learn the resulting distribution—a restricted Boltzmann machine, and a quantum circuit Born machine. We provide extensive numerical results indicating that the simulated Born machine always at least matches the performance of the Boltzmann machine in this task, and demonstrates superior performance as the model scales. We perform experiments on both simulated and physical quantum chips using the Rigetti QCSTM platform, and also are able to partially train the largest instance to date of a quantum circuit Born machine on quantum hardware. Finally, by studying the entanglement capacity of the training Born machines, we find that entanglement typically plays a role in the problem instances which demonstrate an advantage over the Boltzmann machine.Keywords
All Related Versions
Funding Information
- US Air Force (FA9550-17-1-0055)
- Engineering and Physical Sciences Research Council (EP/L01503X/1)
This publication has 40 references indexed in Scilit:
- Tomography and generative training with quantum Boltzmann machinesPhysical Review A, 2017
- Defining and detecting quantum speedupScience, 2014
- Training restricted Boltzmann machines: An introductionPattern Recognition, 2014
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Integrating structured biological data by Kernel Maximum Mean DiscrepancyBioinformatics, 2006
- Global entanglement in multiparticle systemsJournal of Mathematical Physics, 2002
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic MatricesThe Annals of Mathematical Statistics, 1964
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951