Global Optimum Search in Quantum Deep Learning

08/09/2020
by   Lanston Hau Man Chu, et al.
84

This paper aims to solve machine learning optimization problem by using quantum circuit. Two approaches, namely the average approach and the Partial Swap Test Cut-off method (PSTC) was proposed to search for the global minimum/maximum of two different objective functions. The current cost is O(√(|Θ|) N), but there is potential to improve PSTC further to O(√(|Θ|)· sublinear N) by enhancing the checking process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2018

Topographic Representation for Quantum Machine Learning

This paper proposes a brain-inspired approach to quantum machine learnin...
research
09/19/2023

Differentiable Quantum Architecture Search for Quantum Reinforcement Learning

Differentiable quantum architecture search (DQAS) is a gradient-based fr...
research
04/03/2019

The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine

The search for an application of near-term quantum devices is widespread...
research
03/22/2023

Training Multilayer Perceptrons by Sampling with Quantum Annealers

A successful application of quantum annealing to machine learning is tra...
research
05/25/2021

Quantum Embedding Search for Quantum Machine Learning

This paper introduces a novel quantum embedding search algorithm (QES, p...
research
10/28/2021

Fighting the curse of dimensionality: A machine learning approach to finding global optima

Finding global optima in high-dimensional optimization problems is extre...
research
12/18/2020

Multiscale semidefinite programming approach to positioning problems with pairwise structure

We consider the optimization of pairwise objective functions, i.e., obje...

Please sign up or login with your details

Forgot password? Click here to reset