The teapot test for quantum computers @richarde.borcherds7998
The teapot test for quantum computers  @richarde.borcherds7998
Uploaded February 2021 | Updated September 2026, 1 week ago
This lecture (or rant) is part of an online undergraduate course on the theory of numbers, and is an addendum to the lecture on RSA cryptography.

The teapot test is as follows: does an argument claiming that quantum computers now beat classical computers also show that teapots beat classical computers? Since teapots are not generally considered to be high performance computing devices, any argument not passing the teapot test is suspect. This lecture points out that so far (Feb 2021) none of the claims of quantum supremacy pass the teapot test.

Factorizing large integers on the other hand does pass the teapot test (or at least it will when quantum computers get good enough to do this).

Added later: see scottaaronson.com/blog/?p=5460 for further discussion about whether a teapot really achieves teapot supremacy. The post physics.stackexchange.com/questions/511067/why-is-googles-quantum-supremacy-experiment-impressive gives a similar comment about quantum supremacy, using a pudding instead of a teapot.


For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj52Qf7lc3HHvHRdIysxEcj1H
The teapot test for quantum computersIntroduction to number theory lecture 6. Multiplicative functions.Introduction to number theory lecture 35 Jacobi symbolComplex analysis: Classification of elliptic functionsComplex analysis: Gamma functionRIngs 14 Limits and exactnessModular forms: Modular functionsIntroduction to number theory lecture 42. Examples of indefinite binary quadratic forms.Vinberg lecture part 2. The reflection group of II25,1Rings 12 Duality and injective modulesModular forms: Petersson inner productLie groups: Exponential map
Richard E Borcherds |

The teapot test for quantum computers

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER