Quantum Kernels: What They Actually Do
Classical machine learning is, underneath almost everything, kernels wearing different costumes

Helping startup founders build their products, drive their growth @ WeBuidl
Search for a command to run...
Classical machine learning is, underneath almost everything, kernels wearing different costumes

Helping startup founders build their products, drive their growth @ WeBuidl
No comments yet. Be the first to comment.
I rebuilt the entire pipeline from scratch, on my own proxy clusters, ending on a real IBM quantum chip. Full interactive breakdown, every phase, every equation, every job ID, is here

Quantum computing and AI are usually described as two separate races. They're not. Each one is quietly being used to strengthen the other.

Let me start by clearing up something that confuses almost everyone the first time they look into this: no company is running its supply chain on a quantum computer. Nobody's pricing derivatives on on

Loop engineering, a step towads a more powerful and truly autonomous agentic systems

It's late, I've had three tabs of Qiskit docs open all evening, and I just spent an hour convincing myself I finally understood quantum kernels — only to realize halfway through writing this that one part of my mental model was slightly off. I'm writing it down anyway, because getting it wrong out loud is the fastest way I know to actually fix it.
Here's the thing that pulled me in: classical machine learning is, underneath almost everything, kernels wearing different costumes. And once you see that, quantum kernels stop looking like magic and start looking like a very specific, very narrow bet.
Start simple. A dot product between two vectors tells you how aligned they are — that's the oldest similarity measure there is. SVMs took that idea and got smarter: instead of comparing raw vectors, they compare vectors after mapping them into some richer, higher-dimensional space, using what's called the kernel trick. You never actually build that high-dimensional space — you just compute a kernel function k(x, z) that behaves like a dot product inside it. That's the whole trick.
Then transformers came along, and I think people miss that attention is doing the same thing, just learned instead of hand-picked. A query vector and a key vector get dot-producted, softmaxed, and used to weight values — that's a kernel computation repeated at every layer, over every token, with the feature map (the Q/K projection matrices) trained instead of fixed like an RBF kernel would be. GPT and Claude aren't a departure from kernel methods. They're kernel methods stacked twenty layers deep with the similarity function learned end to end.
A quantum kernel does the exact same job — measure similarity — but the "richer space" is a quantum Hilbert space instead of a hand-designed feature space. You take a classical feature vector, run it through a parameterized quantum circuit (the feature map), and it lands as a quantum state. Similarity between two data points becomes the overlap between their two quantum states, and you get that overlap by literally preparing one state, un-preparing it with the inverse of the other circuit, and checking how often you land back at all-zeros. Do that a few thousand times (shots), count how often you hit zero, and that frequency is your kernel value. Qiskit's Sampler primitive is what actually gives you those raw measurement outcomes — this is a sampling problem, not an expectation-value problem, which took me a minute to get straight since Qiskit also has an Estimator for a different class of question entirely.
Going into this, I'd have told you quantum kernels feed "better data" into a classical model. That's not quite right, and saying it out loud made me catch it. What the classical model actually receives is a precomputed kernel matrix — a grid of pairwise similarity scores — and it trains an ordinary SVM on top of that matrix exactly like it would on an RBF kernel matrix. The quantum part never touches the model's weights or its optimizer. It only changes what "similar" means before the classical machinery ever starts.
IBM's 2021 Nature Physics result, from Yunchao Liu, Srinivasan Arunachalam, and Kristan Temme, is the real anchor here: they built a classification problem based on the discrete logarithm problem and proved no classical algorithm can beat random guessing on it in polynomial time, while a quantum kernel solves it cleanly. That's a genuine, rigorous, end-to-end result — not a toy. But it's also the exception that proves the rule. A widely cited 2026 quantum-industry outlook flatly calls quantum ML "one of the most hyped quantum applications of the 2018–2022 era" and "one of the most thoroughly deflated," pointing to a string of dequantization results where classical algorithms caught up to supposed quantum speedups once someone looked closely enough.
I'm not deep enough into the encoding schemes yet to have opinions worth defending on which feature maps are worth building. That's next. But I no longer think of quantum kernels as a better ML model — I think of them as a different lens for measuring similarity, one that's provably powerful on a handful of exotic, structured problems and unproven everywhere else.
That's the part worth remembering: quantum kernels don't replace your model, they replace your notion of "similar." Whether that new notion is worth the qubits is still, mostly, an open question — and that's exactly why it's worth prototyping instead of just reading about.