The teapot test for quantum computers

"However, the teapot can solve it in one second..."

I really like this analogy. Especially since teapot is a staple in 3D graphics, and shows up occasionally in other computing problems, at least in homage.

I think part of the problem is that for classical computers, we got pretty good at Boolean bit manipulations and it is not likely there is much more to be discovered in that area.

But when it comes to qbits, we have figured out a small handful of useful manipulations and interactions, but it is likely we'll need more discoveries before we can use them to do something truly groundbreaking.

I wish there was an equally fervent approach to Probabilistic Programming. What I read about it feels like there is a lot of overlap, even if the expectation is that quantum computing will outperform it at some point.

https://en.wikipedia.org/wiki/Probabilistic_programming