Q-Match: Iterative Shape Matching via Quantum Annealing

by   Marcel Seelbach Benkner, et al.

Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems over binary variables with quantum annealing, which, in theory, allows to find globally optimal solutions relying on a new computational paradigm. Unfortunately, enforcing the linear equality constraints in QAPs via a penalty significantly limits the success probability of such methods on currently available quantum hardware. To address this limitation, this paper proposes Q-Match, i.e., a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm, which allows solving problems of an order of magnitude larger than current quantum methods. It works by implicitly enforcing the QAP constraints by updating the current estimates in a cyclic fashion. Further, Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems. Using the latest quantum annealer, the D-Wave Advantage, we evaluate the proposed method on a subset of QAPLIB as well as on isometric shape matching problems from the FAUST dataset.


Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

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

CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes

Jointly matching multiple, non-rigidly deformed 3D shapes is a challengi...

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing

Recent advances in the development of commercial quantum annealers such ...

Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem

Beam Placement (BP) is a well-known problem in Low-Earth Orbit (LEO) sat...

QuAnt: Quantum Annealing with Learnt Couplings

Modern quantum annealers can find high-quality solutions to combinatoria...

Quantum Advantage for All

We show how to translate a subset of RISC-V machine code compiled from a...

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Factorization Machine (FM) is the most commonly used model to build a re...

Please sign up or login with your details

Forgot password? Click here to reset