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.
Each measurement of the auxiliary register yields outcome|0⟩with probabilityp=a 2, so estimatinga reduces to estimating the Bernoulli parameterpand taking a square root
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.