Research map / 3D vision / Face and shape
Q-Match: Iterative Shape Matching via Quantum Annealing
Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik, Christof Wunderlich, Christian Theobalt, Michael Moeller
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use 40 instead of 50 worst vertices per iteration (ablation) | Q-Match · FAUST (502 vertices) | convergence speed: 40 vs 50 worst vertices | No clear effect |
| increase the number of worst vertices (26, 40, 50) (ablation) | Q-Match · FAUST (502 vertices) | convergence speed: 26, 40, 50 worst vertices | Improved |
| increase worst vertices from 40 to 50 with 5000 anneals (ablation) | Q-Match QUBO subproblem · FAUST (502 vertices) | QUBOs where optimum found: 90% -> 45% | Hurt |
| increase subproblem size from 4-24 to 40 worst vertices (fixed anneals) (ablation) | Q-Match QUBO subproblem · FAUST (502 vertices) | fraction of QUBOs with ground state among returned solutions: 1 -> 0.4 | Hurt |
| replace penalty-based QGM with iterative Q-Match | quantum QAP solver · random QAP instances | success rate: optimum found in all but 4 cases | Improved |
| replace quantum annealer by simulated annealing sampler for subproblems (ablation) | Q-Match · QAPLIB BO a | objective value: 5450757 -> 5449653 | Mixed |
| replace quantum annealer by simulated annealing sampler for subproblems (ablation) | Q-Match · QAPLIB HAD e | objective value: 6922 -> 7068 | Hurt |
| replace quantum annealer by simulated annealing sampler for subproblems (ablation) | Q-Match · QAPLIB ESC16 j | objective value: 8 -> 10 | Hurt |
| use worst instead of best descriptor-based initialization (ablation) | Q-Match · FAUST (502 vertices) | accuracy and convergence | Hurt |
| optimize many 2-cycles jointly instead of one 2-cycle at a time (ablation) | cyclic alpha-expansion · toy 2D shape | reaching global optimum | Improved |
Closest papers by meaning
- QuCOOP: A Versatile Framework for Solving Composite and Binary-Parametrised Problems on Quantum Annealers (CVPR 2025 · similarity 0.88)
- QBMK: Quantum-based Matching Kernels for Un-attributed Graphs (ICML 2024 · similarity 0.84)
- Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm (NeurIPS 2024 · similarity 0.83)
- A Sub-Problem Quantum Alternating Operator Ansatz for Correlation Clustering (ICML 2025 · similarity 0.83)
- Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling (ICLR 2025 · similarity 0.83)
- QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design (NeurIPS 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
