# QuCOOP: A Versatile Framework for Solving Composite and Binary-Parametrised Problems on Quantum Annealers

Source: [QuCOOP: A Versatile Framework for Solving Composite and Binary-Parametrised Problems on Quantum Annealers](<https://www.sota2.com/research/paper/68fa49c91e209131ce939a40>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-01-01T02:13:35.176Z

Authors: Natacha Kuete Meli, Vladislav Golyanik, Marcel Seelbach Benkner, Michael Moeller

Published: 2025-03-25T14:45:19.000Z

## Abstract

There is growing interest in solving computer vision problems such as mesh or point set alignment using Adiabatic Quantum Computing (AQC). Unfortunately, modern experimental AQC devices such as D-Wave only support Quadratic Unconstrained Binary Optimisation (QUBO) problems, which severely limits their applicability. This paper proposes a new way to overcome this limitation and introduces QuCOOP, an optimisation framework extending the scope of AQC to composite and binary-parametrised, possibly non-quadratic problems. The key idea of QuCOOP~is to iteratively approximate the original objective function by a sequel of local (intermediate) QUBO forms, whose binary parameters can be sampled on AQC devices. We experiment with quadratic assignment problems, shape matching and point set registration without knowing the correspondences in advance. Our approach achieves state-of-the-art results across multiple instances of tested problems.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Quadratic Assignment Problem on QAPLIB chr instances](<https://www.sota2.com/research/sota/quadratic-assignment-problem-on-qaplib-chr-instances.md>): Quadratic Assignment Problem; QAPLIB chr instances; QAP Cost (chr12c): 12978.

- [Quadratic Assignment Problem on QAPLIB](<https://www.sota2.com/research/sota/quadratic-assignment-problem-on-qaplib.md>): Quadratic Assignment Problem; QAPLIB; QAP Objective Value (tai12a): 230704.

- [Quadratic Assignment Problem on QAPLIB nug instances](<https://www.sota2.com/research/sota/quadratic-assignment-problem-on-qaplib-nug-instances.md>): Quadratic Assignment Problem; QAPLIB nug instances; QAP Cost: 612.

- [Quadratic Assignment Problem on QAPLIB scr, bur, kra, wil instances v1](<https://www.sota2.com/research/sota/quadratic-assignment-problem-on-qaplib-scr-bur-kra-wil-instances-v1.md>): Quadratic Assignment Problem; QAPLIB scr, bur, kra, wil instances v1; scr12 Cost: 32696.

- [Quadratic Assignment Problem on QAPLIB (rou and esc instances)](<https://www.sota2.com/research/sota/quadratic-assignment-problem-on-qaplib-rou-and-esc-instances.md>): Quadratic Assignment Problem; QAPLIB (rou and esc instances); rou12: 246244.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2503.19718>)

[PDF](<https://arxiv.org/pdf/2503.19718.pdf>)

[Implementation](<https://4dqv.mpi-inf.mpg.de/QuCOOP/>)