scispace - formally typeset
Open AccessDissertation

Quantum machine learning for supervised pattern recognition.

Maria. Schuld
TLDR
This thesis presents a methodology that understands quantum machine learning as the combination of data encoding into quantum systems and quantum optimisation, and proposes several quantum algorithms for supervised pattern recognition.
Abstract
Humans are experts at recognising patterns in past experience and applying them to new tasks. For example, after seeing pictures of a face we can usually tell if another image contains the same person or not. Machine learning is a research discipline at the intersection of computer science, statistics and mathematics that investigates how pattern recognition can be performed by machines and for large amounts of data. Since a few years machine learning has come into the focus of quantum computing in which information processing based on the laws of quantum theory is explored. Although large scale quantum computers are still in the first stages of development, their theoretical description is well-understood and can be used to formulate ‘quantum software’ or ‘quantum algorithms’ for pattern recognition. Researchers can therefore analyse the impact quantum computers may have on intelligent data mining. This approach is part of the emerging research discipline of quantum machine learning that harvests synergies between quantum computing and machine learning. The research objective of this thesis is to understand how we can solve a slightly more specific problem called supervised pattern recognition based on the language that has been developed for universal quantum computers. The contribution it makes is twofold: First, it presents a methodology that understands quantum machine learning as the combination of data encoding into quantum systems and quantum optimisation. Second, it proposes several quantum algorithms for supervised pattern recognition. These include algorithms for convex and non-convex optimisation, implementations of distance-based methods through quantum interference, and the preparation of quantum states from which solutions can be derived via sampling. Amongst the machine learning methods considered are least-squares linear regression, gradient descent and Newton’s method, k-nearest neighbour, neural networks as well as ensemble methods. Together with the growing body of literature, this thesis demonstrates that quantum computing offers a number of interesting tools for machine learning applications, and has the potential to create new models of how to learn from data.

read more

Citations
More filters
Journal Article

Google in a Quantum Network

TL;DR: In this paper, the authors introduce a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available.
Journal ArticleDOI

Quantum Machine Learning Architecture for COVID-19 Classification Based on Synthetic Data Generation Using Conditional Adversarial Neural Network.

TL;DR: In this article, the authors used quantum machine learning (QML) and classical machine learning(CML) approaches for the analysis of COVID-19 images, which achieved better results when compared to the latest published work in this domain.
Journal Article

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

TL;DR: In this article, a quantum computer consisting of quantum nonlinear oscillators, instead of quantum bits, is proposed to solve hard combinatorial optimization problems, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing.
Journal Article

Efficient state preparation for a register of quantum bits (13 pages)

A. N. Soklakov
- 01 Jan 2006 - 
TL;DR: In this article, the authors describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1 for sequences of states with suitably bounded amplitudes.
Proceedings ArticleDOI

Quantum Learning of Classical Stochastic Processes: The Completely-Positive Realization Problem

TL;DR: The Completely-Positive realization problem then consists in determining whether an equivalent quantum mechanical description of the same process exists, and some key results of stochastic realization theory are generalized, giving possible insight to the lifting problem in quotient operator systems.
References
More filters
Journal ArticleDOI

Least Squares Support Vector Machine Classifiers

TL;DR: A least squares version for support vector machine (SVM) classifiers that follows from solving a set of linear equations, instead of quadratic programming for classical SVM's.
Book

The Theory of Open Quantum Systems

TL;DR: Probability in classical and quantum physics has been studied in this article, where classical probability theory and stochastic processes have been applied to quantum optical systems and non-Markovian dynamics in physical systems.
Journal ArticleDOI

Adaptive mixtures of local experts

TL;DR: A new supervised learning procedure for systems composed of many separate networks, each of which learns to handle a subset of the complete set of training cases, which is demonstrated to be able to be solved by a very simple expert network.
Journal ArticleDOI

Combining Pattern Classifiers: Methods and Algorithms

Subhash C Bagui
- 01 Nov 2005 - 
TL;DR: This chapter discusses the development of the Spatial Point Pattern Analysis Code in S–PLUS, which was developed in 1993 by P. J. Diggle and D. C. Griffith.
Journal ArticleDOI

Neural network ensembles

TL;DR: It is shown that the remaining residual generalization error can be reduced by invoking ensembles of similar networks, which helps improve the performance and training of neural networks for classification.