Skip to content →

Category: math

Teapot supremacy

No, this is not another timely post about the British Royal family.

It’s about Richard Borcherds’ “teapot test” for quantum computers.



A lot of money is being thrown at the quantum computing hype, causing people to leave academia for quantum computing firms. A recent example (hitting the press even in Belgium) being the move of Bob Coecke from Oxford University to Cambridge Quantum Computing.

Sure, quantum computing is an enticing idea, and we have fantastic quantum algorithms such as Shor’s factorisation algorithm and Grover’s search algorithm.

The (engineering) problem is building quantum computers with a large enough number of qubits, which is very difficult due to quantum decoherence. To an outsider it may appear that the number of qubits in a working quantum computer is growing at best linearly, if not logarithmic, in sharp contrast to Moore’s law for classical computers, stating that the number of transistors in an integrated circuit doubles every two years.

Quantum computing evangelists assure us that this is nonsense, and that we should replace Moore’s law by Neven’s law claiming that the computing power of quantum computers will grow not just exponentially, but doubly exponentially!

What is behind these exaggerated claims?

In 2015 the NSA released a policy statement on the need for post-quantum cryptography. In the paper “A riddle wrapped in an enigma”, Neil Koblitz and Alfred Menezes carefully examined NSA’s possible strategies behind this assertion.

Can the NSA break PQC? Can the NSA break RSA? Does the NSA believes that RSA-3072 is much more quantum-resistant than ECC-256 and even ECC-384?, and so on.

Perhaps the most plausible of all explanations is this one : the NSA is using a diversion strategy aimed at Russia and China.

Suppose that the NSA believes that, although a large-scale quantum computer might eventually be built, it will be hugely expensive. From a cost standpoint it will be less analogous to Alan Turing’s bombe than to the Manhattan Project or the Apollo program, and it will be within the capabilities of only a small number of nation-states and huge corporations.

Suppose also that, in thinking about the somewhat adversarial relationship that still exists between the U.S. and both China and Russia, especially in the area of cybersecurity, the NSA asked itself “How did we win the Cold War? The main strategy was to goad the Soviet Union into an arms race that it could not afford, essentially bankrupting it. Their GNP was so much less than ours, what was a minor set-back for our economy was a major disaster for theirs. It was a great strategy. Let’s try it again.”

This brings us to the claim of quantum supremacy, that is, demonstrating that a programmable quantum device can solve a problem that no classical computer can solve in any feasible amount of time.

In 2019, Google claimed “to have reached quantum supremacy with an array of 54 qubits out of which 53 were functional, which were used to perform a series of operations in 200 seconds that would take a supercomputer about 10,000 years to complete”. In December 2020, a group based in USTC reached quantum supremacy by implementing a type of Boson sampling on 76 photons with their photonic quantum computer. They stated that to generate the number of samples the quantum computer generates in 20 seconds, a classical supercomputer would require 600 million years of computation.

Richard Borcherds rants against the type of problems used to claim quantum ‘supremacy’. He proposes the ‘teapot problem’ which a teapot can solve instantaneously, but will be impossibly hard for classical (and even quantum) computers. That is, any teapot achieves ‘teapot supremacy’ over classical and quantum computers!

Another point of contention are the ‘real-life applications’ quantum computers are said to be used for. Probably he is referring to Volkswagen’s plan for traffic optimization with a D-Wave quantum computer in Lisbon.

“You could give these guys a time machine and all they’d use it for was going back to watch some episodes of some soap opera they missed”

Enjoy!

One Comment

Borcherds’ favourite numbers

Whenever I visit someone’s YouTube or Twitter profile page, I hope to see an interesting banner image. Here’s the one from Richard Borcherds’ YouTube Channel.

Not too surprisingly for Borcherds, almost all of these numbers are related to the monster group or its moonshine.

Let’s try to decode them, in no particular order.

196884

John McKay’s observation $196884 = 1 + 196883$ was the start of the whole ‘monstrous moonshine’ industry. Here, $1$ and $196883$ are the dimensions of the two smallest irreducible representations of the monster simple group, and $196884$ is the first non-trivial coefficient in Klein’s j-function in number theory.

$196884$ is also the dimension of the space in which Robert Griess constructed the Monster, following Simon Norton’s lead that there should be an algebra structure on the monster-representation of that dimension. This algebra is now known as the Griess algebra.

Here’s a recent talk by Griess “My life and times with the sporadic simple groups” in which he tells about his construction of the monster (relevant part starting at 1:15:53 into the movie).

1729

1729 is the second (and most famous) taxicab number. A long time ago I did write a post about the classic Ramanujan-Hardy story the taxicab curve (note to self: try to tidy up the layout of some old posts!).

Recently, connections between Ramanujan’s observation and K3-surfaces were discovered. Emory University has an enticing press release about this: Mathematicians find ‘magic key’ to drive Ramanujan’s taxi-cab number. The paper itself is here.

“We’ve found that Ramanujan actually discovered a K3 surface more than 30 years before others started studying K3 surfaces and they were even named. It turns out that Ramanujan’s work anticipated deep structures that have become fundamental objects in arithmetic geometry, number theory and physics.”

Ken Ono

24

There’s no other number like $24$ responsible for the existence of sporadic simple groups.

24 is the length of the binary Golay code, with isomorphism group the sporadic Mathieu group $M_24$ and hence all of the other Mathieu-groups as subgroups.

24 is the dimension of the Leech lattice, with isomorphism group the Conway group $Co_0 = .0$ (dotto), giving us modulo its center the sporadic group $Co_1=.1$ and the other Conway groups $Co_2=.2, Co_3=.3$, and all other sporadics of the second generation in the happy family as subquotients (McL,HS,Suz and $HJ=J_2$)



24 is the central charge of the Monster vertex algebra constructed by Frenkel, Lepowski and Meurman. Most experts believe that the Monster’s reason of existence is that it is the symmetry group of this vertex algebra. John Conway was one among few others hoping for a nicer explanation, as he said in this interview with Alex Ryba.

24 is also an important number in monstrous moonshine, see for example the post the defining property of 24. There’s a lot more to say on this, but I’ll save it for another day.

60

60 is, of course, the order of the smallest non-Abelian simple group, $A_5$, the rotation symmetry group of the icosahedron. $A_5$ is the symmetry group of choice for most viruses but not the Corona-virus.

3264

3264 is the correct solution to Steiner’s conic problem asking for the number of conics in $\mathbb{P}^2_{\mathbb{C}}$ tangent to five given conics in general position.



Steiner himself claimed that there were $7776=6^5$ such conics, but realised later that he was wrong. The correct number was first given by Ernest de Jonquières in 1859, but a rigorous proof had to await the advent of modern intersection theory.

Eisenbud and Harris wrote a book on intersection theory in algebraic geometry, freely available online: 3264 and all that.

248

248 is the dimension of the exceptional simple Lie group $E_8$. $E_8$ is also connected to the monster group.

If you take two Fischer involutions in the monster (elements of conjugacy class 2A) and multiply them, the resulting element surprisingly belongs to one of just 9 conjugacy classes:

1A,2A,2B,3A,3C,4A,4B,5A or 6A

The orders of these elements are exactly the dimensions of the fundamental root for the extended $E_8$ Dynkin diagram.

This is yet another moonshine observation by John McKay and I wrote a couple of posts about it and about Duncan’s solution: the monster graph and McKay’s observation, and $E_8$ from moonshine groups.

163

163 is a remarkable number because of the ‘modular miracle’
\[
e^{\pi \sqrt{163}} = 262537412640768743.99999999999925… \]
This is somewhat related to moonshine, or at least to Klein’s j-function, which by a result of Kronecker’s detects the classnumber of imaginary quadratic fields $\mathbb{Q}(\sqrt{-D})$ and produces integers if the classnumber is one (as is the case for $\mathbb{Q}(\sqrt{-163})$).

The details are in the post the miracle of 163, or in the paper by John Stillwell, Modular Miracles, The American Mathematical Monthly, 108 (2001) 70-76.

Richard Borcherds, the math-vlogger, has an entertaining video about this story: MegaFavNumbers 262537412680768000

His description of the $j$-function (at 4:13 in the movie) is simply hilarious!

Borcherds connects $163$ to the monster moonshine via the $j$-function, but there’s another one.

The monster group has $194$ conjugacy classes and monstrous moonshine assigns a ‘moonshine function’ to each conjugacy class (the $j$-function is assigned to the identity element). However, these $194$ functions are not linearly independent and the space spanned by them has dimension exactly $163$.

One Comment

GoV 2 : Viruses and quasi-crystals

If you look around for mathematical theories of the structure of viruses, you quickly end up with the work of Raidun Twarock and her group at the University of York.



We’ve seen her proposal to extend the Caspar-Klug classification of viruses. Her novel idea to distribute proteins on the viral capsid along Penrose-like tilings shouldn’t be taken too literally. The inherent aperiodic nature of Penrose tiles doesn’t go together well with perfect tilings of the sphere.

Instead, the observation that these capsid tilings resemble somewhat Penrose tilings is a side-effect of another great idea of the York group. Recently, they borrowed techniques from the theory of quasicrystals to gain insight in the inner structure of viruses, in particular on the interaction of the capsid with the genome.

By the crystallographic restriction theorem no $3$-dimensional lattice can have icosahedral symmetry. But, we can construct aperiodic structures (quasicrystals) which have local icosahedral structure, much like Penrose tilings have local $D_5$-symmetry

This is best explained by de Bruijn‘s theory of pentagrids (more on that another time). Here I’ll just mention the representation-theoretic idea.

The isometry group of the standard $5$-dimensional lattice $\mathbb{Z}^5$ is the group of all signed permutation $5 \times 5$ matrices $B_5$ (Young’s hyperoctahedral group). There are two distinct conjugacy classes of subgroups in $B_5$ isomorphic to $D_5$, one such subgroup generated by the permutation matrices
\[
x= \begin{bmatrix}
0 & 1 & 0 & 0 & 0 \\
0 & 0 & 1 & 0 & 0 \\
0 & 0 & 0 & 1 & 0 \\
0 & 0 & 0 & 0 & 1 \\
1 & 0 & 0 & 0 & 0 \end{bmatrix} \qquad \text{and} \qquad
y = \begin{bmatrix} 1 & 0 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 & 1 \\
0 & 0 & 0 & 1 & 0 \\
0 & 0 & 1 & 0 & 0 \\
0 & 1 & 0 & 0 & 0 \end{bmatrix} \]
The traces of $x,x^2$ and $y$, together with the character table of $D_5$ tell us that this $5$-dimensional $D_5$-representation splits as the direct sum of the trivial representation and of the two irreducible $2$-dimensional representations.
\[
\mathbb{R}^5 = A \simeq T \oplus W_1 \oplus W_2 \]
with $T = \mathbb{R} d$, $W_1 = \mathbb{R} u_1 + \mathbb{R} u_2$ and $W_2 = \mathbb{R} w_1 + \mathbb{R} w_2$ where
\[
\begin{cases}
(1,1,1,1,1)=d \\
(1,c_1,c_2,c_3,c_4)= u_1 \\
(0,s_1,s_2,s_3,s_4) = u_2 \\
(1,c_2,c_4,c1,c3)= w_1 \\
(0,s_2,s_4,s_1,s_3)= w_2
\end{cases}
\]
and $c_j=cos(2\pi j/5)$ and $s_j=sin(2 \pi/5)$. We have a $D_5$-projection
\[
\pi : A \rightarrow W_1 \quad (y_0,\dots,y_4) \mapsto \sum_{i=0}^4 y_i(c_i u_1+s_i u_2) \]
The projection maps the vertices of the $5$-dimensional hypercube to a planar configuration with $D_5$-symmetry.



de Bruijn’s results say that if we take suitable ‘windows’ of lattice-points in $\mathbb{Z}^5$ and project them via the $D_5$-equivariant map $\pi$ onto the plane, then the images of these lattice points become the vertices of a rhombic Penrose tiling (and we get all such tilings by choosing our window carefully).



This explains why Penrose tilings have a local $D_5$-symmetry. I’ll try to come back to de Bruijn’s papers in future posts.

But, let’s go back to viruses and the work of Twarock’s group using methods from quasicrystals. Such aperiodic structures with a local icosahedral symmetry can be constructed along similar lines. This time one starts with the standard $6$-dimensional lattice $\mathbb{Z^6}$ with isometry group $B_6$ (signed $6 \times 6$ permutation matrices).

This group has three conjugacy classes of subgroups isomorphic to $A_5$, but for only one of them this $6$-dimensional representation decomposes as the direct sum of the two irreducible $3$-dimensional representations of $A_5$ (the decompositions in the two other cases contain an irreducible of dimension $4$ or $5$ together with trivial factor(s)). A representant of the crystallographic relevant case is given by the signed permutation matrices
\[
x= \begin{bmatrix}
0 & 1 & 0 & 0 & 0 & 0 \\
1 & 0 & 0 & 0 & 0 & 0 \\
0 & 0 & 0 & -1 & 0 & 0 \\
0 & 0 & -1 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 & -1 & 0 \\
0 & 0 & 0 & 0 & 0 & -1
\end{bmatrix} \qquad \text{and} \qquad y=
\begin{bmatrix}
0 & 0 & 1 & 0 & 0 & 0 \\
1 & 0 & 0 & 0 & 0 & 0 \\
0 & 1 & 0 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 & -1 & 0 \\
0 & 0 & 0 & 0 & 0 & 1 \\
0 & 0 & 0 & -1 & 0 & 0
\end{bmatrix} \]

Again, using suitable windows of $\mathbb{Z}^6$-lattice points and using the $A_5$-equivariant projection to one of the two $3$-dimensional components, one obtains quasicrystals with local $A_5$-symmetry.

In this $3$-dimensional case the replacements of the thick and thin rhombi are these four parallellepipeda, known as the Amman blocks



which must be stacked together obeying the gluing condition that dots of the same colour must be adjacent.

Has anyone looked at a possible connection between the four Amman blocks (which come in pairs) and the four (paired) nucleotides in DNA? Just an idle thought…

These blocks grow into quasicrystals with local icosahedral symmetry.



The faces on the boundary of such a sphere-like quasicrystal then look a lot like a Penrose tiling.

How can we connect these group and representation-theoretic ideas to the structure of viruses? Here’s another thought-provoking proposal coming from the York group.

Take the $A_5$ subgroup of the hyperoctahedral group in six dimensiona $B_6$ generated by the above two matrices (giving a good $A_5$-equivariant projection $\pi$ to three dimensional space) and consider an intermediate group
\[
A_5 \subsetneq G \subseteq B_6 \]
Take a point in $\mathbb{R}^6$ and look at its orbit under the isometries of $G$, then all these points have the same distance from the origin in $\mathbb{R}^6$. Now, project this orbit under $\pi$ to get a collection of points in $\mathbb{R}^3$.

As $\pi$ is only $A_5$-equivariant (and not $G$-equivariant) the image points may lie in different shells from the origin. We can try to relate these shells of points to observational data on the inner structures of viruses.

Here’s a pretty convincing instance of such a correlation, taken from the thesis by Emilio Zappa “New group theoretical methods for applications in virology and quasicrystals”.



This is the inner structure of the Hepatitis B virus, showing the envelope (purple), capsid protein (cream) and genome (light blue). The coloured dots are the image points in the different shells around the origin.

Do viruses invade us from the sixth dimension??

Leave a Comment