<p>We demonstrate how quantum machine learning might play a vital role in achieving moderate speedups in machine learning problems and might have scope for providing rich models to describe the distribution underlying the observed data. We work with Restricted Boltzmann Machines to demonstrate the same to supervised learning tasks. We compare the relative performance of contrastive divergence with sampling from Dwave annealer on bars and stripes dataset and then on imabalanced network security data set. Later we do training using Quantum Imaginary Time Evolution, that is well suited for the Noisy Intermediate-Scale Quantum era to perform classification on MNIST data set. </p>
| Identifer | oai:union.ndltd.org:purdue.edu/oai:figshare.com:article/21677618 |
| Date | 06 December 2022 |
| Creators | Raja Selvarajan (14210861) |
| Source Sets | Purdue University |
| Detected Language | English |
| Type | Text, Thesis |
| Rights | CC BY 4.0 |
| Relation | https://figshare.com/articles/thesis/QUANTUM_ALGORITHMS_FOR_SUPERVISED_LEARNING_AND_OPTIMIZATION/21677618 |
Page generated in 0.0021 seconds