Poster · Paris

Optimal algorithmic complexity of inference in quantum kernel methods

Name: Optimal algorithmic complexity of inference in quantum kernel methods
Start: 2026-12-09T17:00:00+01:00
End: 2026-12-09T19:00:00+01:00
Location: Paris Poster Hall, Paris

When: Wed 9 Dec 2026, 17:00–19:00 CET
Where: Paris Poster Hall
Session: Paris Poster Session 2
Authors: Elies Gil-Fuster, Seongwook Shin, Sofiene Jerbi, Jens Eisert, Maximilian J Kramer
Organisations: Freie Universität Berlin, Sejong University, Freie Universitaet Berlin
QRS classification: AI for science

Open in schedule Official page