QuAnt: Quantum Annealing with Learnt Couplings

by   Marcel Seelbach Benkner, et al.

Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains challenging and currently requires problem-specific analytical derivations. Moreover, such explicit formulations impose tangible constraints on solution encodings. In stark contrast to prior work, this paper proposes to learn QUBO forms from data through gradient backpropagation instead of deriving them. As a result, the solution encodings can be chosen flexibly and compactly. Furthermore, our methodology is general and virtually independent of the specifics of the target problem type. We demonstrate the advantages of learnt QUBOs on the diverse problem types of graph matching, 2D point cloud alignment and 3D rotation estimation. Our results are competitive with the previous quantum state of the art while requiring much fewer logical and physical qubits, enabling our method to scale to larger problems. The code and the new dataset will be open-sourced.


page 5

page 7

page 13


Automatic Conversion of MiniZinc Programs to QUBO

Obtaining Quadratic Unconstrained Binary Optimisation models for various...

A Study of Scalarisation Techniques for Multi-Objective QUBO Solving

In recent years, there has been significant research interest in solving...

Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

Matching problems on 3D shapes and images are challenging as they are fr...

Q-Match: Iterative Shape Matching via Quantum Annealing

Finding shape correspondences can be formulated as an NP-hard quadratic ...

Quantum Annealing Approaches to the Phase-Unwrapping Problem in Synthetic-Aperture Radar Imaging

The focus of this work is to explore the use of quantum annealing solver...

Optimizing Geometry Compression using Quantum Annealing

The compression of geometry data is an important aspect of bandwidth-eff...

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