Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

Abstract

Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems with emerging quantum computing technology and propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. We investigate several ways to inject permutation matrix constraints in a quadratic unconstrained binary optimization problem which can be mapped to quantum hardware. We focus on obtaining a sufficient spectral gap, which further increases the probability to measure optimal solutions and valid permutation matrices in a single run. We perform our experiments on the quantum computer D-Wave 2000Q (2^11 qubits, adiabatic). Despite the observed discrepancy between simulated adiabatic quantum computing and execution on real quantum hardware, our reformulation of permutation matrix constraints increases the robustness of the numerical computations over other penalty approaches in our experiments. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures, which opens up multiple new directions for solving matching problems in 3D computer vision and graphics.

arXiv comment18 pages, 14 figures, 2 tables; project webpage: http://gvv.mpi-inf.mpg.de/projects/QGM/

References in corpus (17)

• Quantum Mechanics helps in searching for a needle in a haystack
• QuTiP: An open-source Python framework for the dynamics of open quantum systems
• Contextuality supplies the magic for quantum computation
• Quantum Data Fitting
• Consistency of the Adiabatic Theorem
• Application of Quantum Annealing to Training of Deep Neural Networks
• Nonnegative/binary matrix factorization with a D-Wave quantum annealer
• Flight Gate Assignment with a Quantum Annealer
• Experimental quantum annealing: case study involving the graph isomorphism problem
• Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
• A new look at reweighted message passing
• Graph isomorphism and adiabatic quantum computing
• Compressed quantum computation using the IBM Quantum Experience
• Algorithm engineering for a quantum annealing platform
• Efficient Quantum Algorithms for Estimating Gauss Sums
• Image classification using quantum inference on the D-Wave 2X
• Quantum Robust Fitting