Encoding the inference sum as a single observable and applying quantum amplitude estimation achieves optimal query complexity O(‖α‖₁/ε) with a matching lower bound for quantum kernel methods.
Unlike for the case of list-and-sum, there is no single template from which all results follow, but rather we present each scenario individually
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal algorithmic complexity of inference in quantum kernel methods
Encoding the inference sum as a single observable and applying quantum amplitude estimation achieves optimal query complexity O(‖α‖₁/ε) with a matching lower bound for quantum kernel methods.