A Quantum Computational Approach to Correspondence Problems on Point Sets
Authors:
Preprint
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 25 references indexed in Scilit:
- Fast clique minor generation in Chimera qubit connectivity graphsQuantum Information Processing, 2015
- Single-shot readout of an electron spin in siliconNature, 2010
- Quantum Algorithms for Matching and Network Flows2006
- A silicon-based nuclear spin quantum computerNature, 1998
- Quantum annealing: A new method for minimizing multidimensional functionsChemical Physics Letters, 1994
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machinesJournal of Statistical Physics, 1980
- The concept of transition in quantum mechanicsFoundations of Physics, 1970
- Beitrag zur Theorie des FerromagnetismusZeitschrift für Physik, 1925