Q-Match: Iterative Shape Matching via Quantum Annealing

no code implementations • ICCV 2021 • Marcel Seelbach Benkner, Zorah Lähner, Vladislav Golyanik, Christof Wunderlich, Christian Theobalt, Michael Moeller

Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density.

Speeding-up the decision making of a learning agent using an ion trap quantum processor

no code implementations • 5 Sep 2017 • Theeraphot Sriarunothai, Sabine Wölk, Gouri Shankar Giri, Nicolai Friis, Vedran Dunjko, Hans J. Briegel, Christof Wunderlich

We report a proof-of-principle experimental demonstration of the quantum speed-up for learning agents utilizing a small-scale quantum information processor based on radiofrequency-driven trapped ions.

BIG-bench Machine Learning Decision Making