Matching Point Sets with Quantum Circuits Learning
ICASSP, 2022

* denotes joint first authorship, here in contribution order



In this work, we propose a parameterised quantum circuit learning approach to point set matching problem. In contrast to previous annealing-based methods, we propose a quantum circuit-based framework whose parameters are optimised via descending the gradients w.r.t a kernel-based loss function (above). We formulate the shape matching problem into a distribution learning task; that is, to learn the distribution of the optimal transformation parameters. We show that this framework is able to find multiple optimal solutions for symmetric shapes and is more accurate, scalable and robust than the previous annealing-based method. Code, data and pre-trained weights are available at this page.

Overview Video (TBD)

Related links (TBD)



We would like to thank Weiyang Liu, Shuai Yuan, Clarice D. Aiello and Joan Lasenby for valuable discussions.
Hanchen is partially supported by the Cambridge Trust Scholarship, the Cathy Xu Fellowship, the CAPA Research Grant and the Cambridge Philosophical Society.

The website template is borrowed from Michaël Gharbi and Ben Mildenhall.