A Quantum Computational Approach to Correspondence Problems on Point Sets
Authors:
- 1 June 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 9179-9188
Abstract
Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review AQC and derive a new algorithm for correspondence problems on point sets suitable for execution on AQC. Our algorithm has a subquadratic computational complexity of the state preparation. Examples of successful transformation estimation and point set alignment by simulated sampling are shown in the systematic experimental evaluation. Finally, we analyse the differences in the solutions and the corresponding energy values.Keywords
All Related Versions
This publication has 50 references indexed in Scilit:
- Single-shot readout of an electron spin in siliconNature, 2010
- Quantum Computing with an Electron Spin EnsemblePhysical Review Letters, 2009
- Consistency of the Adiabatic TheoremPhysical Review Letters, 2009
- An introduction to quantum computing for non-physicistsACM Computing Surveys, 2000
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- A method for registration of 3-D shapesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1992
- Closed-form solution of absolute orientation using orthonormal matricesJournal of the Optical Society of America A, 1988
- Optimization by Simulated AnnealingScience, 1983
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- Beweis des AdiabatensatzesThe European Physical Journal A, 1928