Search Results for author:
Found 2 papers, 1 papers with code
Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines
Because the PromiseBQP complexity class includes all Bounded-Error Quantum Polynomial-Time (BQP) decision problems, our results imply that there exists a feature map and a quantum kernel that make variational quantum classifiers and quantum kernel support vector machines efficient solvers for any BQP problem.
LOST: A flexible framework for semi-automatic image annotation
In this paper we present a framework that allows for a quick and flexible design of semi-automatic annotation pipelines.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
