Quantum Optimisation for Continuous Multivariable Functions by a Structured Search

10/12/2022
by   Edric Matwiejew, et al.
0

Solving optimisation problems is a promising near-term application of quantum computers. Quantum variational algorithms leverage quantum superposition and entanglement to optimise over exponentially large solution spaces using an alternating sequence of classically tunable unitaries. However, prior work has primarily addressed discrete optimisation problems. In addition, these algorithms have been designed generally under the assumption of an unstructured solution space, which constrains their speedup to the theoretical limits for the unstructured Grover's quantum search algorithm. In this paper, we show that quantum variational algorithms can efficiently optimise continuous multivariable functions by exploiting general structural properties of a discretised continuous solution space with a convergence that exceeds the limits of an unstructured quantum search. We introduce the Quantum Multivariable Optimisation Algorithm (QMOA) and demonstrate its advantage over pre-existing methods, particularly when optimising high-dimensional and oscillatory functions.

READ FULL TEXT

page 1

page 6

page 8

research
12/16/2022

Variational Quantum Search with Exponential Speedup

With powerful quantum computers already built, we need more efficient qu...
research
05/25/2021

IGO-QNN: Quantum Neural Network Architecture for Inductive Grover Oracularization

We propose a novel paradigm of integration of Grover's algorithm in a ma...
research
11/04/2021

Graph neural network initialisation of quantum approximate optimisation

Approximate combinatorial optimisation has emerged as one of the most pr...
research
04/02/2019

Optimising Trotter-Suzuki Decompositions for Quantum Simulation Using Evolutionary Strategies

One of the most promising applications of near-term quantum computing is...
research
04/14/2020

Quantum speedups of some general-purpose numerical optimisation algorithms

We give quantum speedups of several general-purpose numerical optimisati...
research
01/30/2023

Near-perfect Reachability of Variational Quantum Search with Depth-1 Ansatz

Grover's search algorithm is renowned for its dramatic speedup in solvin...
research
02/26/2021

Many-Qudit representation for the Travelling Salesman Problem Optimisation

We present a map from the travelling salesman problem (TSP), a prototypi...

Please sign up or login with your details

Forgot password? Click here to reset