Minimalistic quantum computation

In the usual ‘circuit model’ of quantum computation, we have a fixed number of qubits, {q1, q2, …, qn}, and allow quantum gates to act on these qubits. The diagram below shows a Toffoli gate on the left, and an equivalent circuit of simpler gates on the right:


These diagrams represent qubits as horizontal lines (so there are 3 qubits in the circuit above), and the operations are applied from left to right. The circuit has 6 controlled-NOT gates (each acting on an ordered pair of qubits) and 9 single-qubit gates (4 T-gates, 3 inverse T-gates, and 2 Hadamard gates).

Whereas the internal state of a classical computer with n bits of memory can be described by a length-n vector of binary values, a quantum computer with n qubits of memory requires a length-(2^n) vector of complex numbers. A k-qubit gate is a unitary linear map described by a (2^k)-by-(2^k) matrix of complex numbers.

Importantly, it’s the exponential increase in the dimension of this vector (from n to 2^n), and not the involvement of complex numbers, which makes quantum computers [believed to be] able to solve more problems [in polynomial time] than is possible with a mere classical computer. To see this is the case, note that a (2^k)-by-(2^k) matrix of complex numbers can be emulated by a (2^(k+1))-by-(2^(k+1)) matrix of real numbers. Specifically, replace each complex entry with a real 2-by-2 block:


Consequently, a k-qubit complex gate can be emulated with a (k+1)-qubit real gate.

Indeed, it’s possible to restrict to not only real entries, but even to dyadic rational entries. Specifically, the most common universal set of logic gates {T, H, CNOT} consists of matrices whose entries belong to the ring \mathbb{Z}[\frac{1}{2}, \zeta] where ζ is a primitive eighth root of unity. A similar trick means we can work over the ring of dyadic rationals instead, at the cost of just two extra qubits:


This is helpful for simulation in software: all finite values representable as IEEE 754 floating point numbers are dyadic rationals, and a partial converse is true: all dyadic rationals with numerator and denominator less than some bound (2^53 for double-precision and 2^24 for single-precision) are representable as IEEE 754 floating point numbers.

A universal pair of 3-qubit dyadic rational gates

Consider the Toffoli gate (left) and a new gate that I’m going to call the ‘XHH’ gate (it’s simply a tensor product of a Pauli X-gate and two Hadamard gates, all acting on separate qubits):


In an n-qubit circuit, each of these gates yields n(n – 1)(n – 2)/2 different matrices depending on the choice of qubits on which it acts, so this set expands to n(n – 1)(n – 2) matrices in total. Then we have the following universality theorem:

When n >= 4, the group generated by these matrices is a dense subgroup of the complete rotation group SO(2^n).

This is the best that we could hope for: when tensored by (n – 3) copies of the 2-by-2 identity matrix, these gates yield orthogonal matrices of determinant 1. It means that any special orthogonal gate can be approximated arbitrarily closely (in a number of gates polylogarithmic in the required precision, by the Solovay-Kitaev theorem), which (together with the above discussion of emulating complex unitary gates with real orthogonal gates) yields universal quantum computation.

An eight-dimensional surprise

More interesting is what happens when n = 3: the gates do not form a dense subgroup of O(8) as we might expect from extrapolating this result downwards (and noting that the Toffoli matrix has determinant -1, so the matrices lie in O(8) instead of SO(8) when n = 3).

Rather, they form a finite group of order 696729600.

This number should be familiar from the last post, because it’s the order of the E8 Weyl group. Every entry of every matrix in this group is not only dyadic rational, but in fact an integer multiple of 1/4. Inter alia, this finite group contains the familiar single-qubit Pauli gates X and Z, as well as the two-qubit CNOT gate.


Orthogonal projection of the 8-dimensional E8 root system into its 2-dimensional Coxeter plane, drawn by J. G. Moxness. The symmetry group of this set of 240 points is the aforementioned E8 Weyl group of order 696729600.

Given a starting state where all qubits are off (so the vector is (1, 0, 0, 0, 0, 0, 0, 0)), by applying these two gates in various combinations it is possible to reach any of 2160 different vectors (specifically, rescaled copies of the 2160 vectors in the second shell of the E8 lattice). If we instead began with an equal superposition of the eight computational basis states, there would be 240 reachable vectors — the root lattice vectors illustrated in the picture above! Again, the numbers 240 and 2160 should be very familiar from the previous article.

(Vectors that are related by scalar multiplication are identified as the same quantum state, so antipodal pairs of vectors in the previous paragraph correspond to the same quantum state. Consequently, there are only 1080 distinct quantum states reachable from the all-off quantum state, or 120 distinct quantum states reachable from the )

Before I found the set {Toffoli, XHH}, I tried the deceptively similar pair {Toffoli, ZHH}. To my surprise, the program I used to compute the group generated by those elements had an order of 2903040 — significantly smaller than the 696729600-element group I had expected! This is the Weyl group of E7, and in this case we get the smaller subgroup because all six matrices fix the vector (1, 1, 1, -1, 1, -1, -1, -1) and therefore only act nontrivially on its seven-dimensional orthogonal complement. Fortunately, the set {Toffoli, XHH} does not have a fixed vector and generates the full Weyl group of E8.

Unanswered questions

The {Toffoli, ZHH} construction of the E7 Weyl group demonstrates that we can realise the origin-preserving isometry group of a 7-dimensional lattice, even though 7 is not a power of two. An even more beautiful and exceptional lattice than the E8 lattice is the 24-dimensional Leech lattice, whose origin-preserving symmetry group is the Conway group Co0. Is there an elegant set of matrices which generate a group isomorphic to Co0 and have a simple description in terms of quantum gates?

Edit: depending on whether you’d consider it elegant and/or simple, there’s an affirmative answer in the next post.

The first nonempty shell of the Leech lattice consists of 196560 points, as opposed to the 240 points in the first shell of the E8 lattice. David Madore has plotted some beautiful projections of this set — they’re as close as possible to being analogous to the Petrie projection of the E8 root system shown above, except inasmuch as Co0 is not a Coxeter group and therefore it’s unclear which plane (if any!) is analogous to the Coxeter plane.

This entry was posted in Uncategorized. Bookmark the permalink.

11 Responses to Minimalistic quantum computation

  1. tomtom2357 says:

    Is there a single gate which is universal in the above sense for n sufficiently large?

    • apgoucher says:

      Yes — if you don’t require the matrix elements to be dyadic rationals, there is a 2-qubit gate with this property. If you do require the matrix elements to be dyadic rationals, every 2-qubit gate belongs to the Clifford group (which is not universal), but there are 3-qubit gates that suffice. I chose to use a pair of 3-qubit gates instead of a single one, because the single one is less familiar and more complicated to describe.

  2. Pingback: More quantum gates and lattices | Complex Projective 4-Space

  3. Anonymous says:

    Interesting result for E8. I checked that the 6 generators XHH,HXH,HHX +T give a group of the same size as E8 Weyl group…that’s a quick test in gap; I didn’t check for isomorphism (did you?).
    As a side note, T above is I+I+I+X (here + is direct sum of matrices). If you replaces X by Z throughout : T -> I+I+I+Z (now diagonal!) then with ZHH,HZH,HHZ,…you also get the same size
    group : 696729600

    • apgoucher says:

      We know that it’s a *subgroup* of the E8 Weyl group, because it preserves the lattice \Lambda \subseteq \mathbb{Z}^8 consisting of all integer points where:

      (a) all coordinates have the same parity;
      (b) the sum of the coordinates is divisible by 4.

      This lattice is a scaled copy of the E8 lattice, so its automorphism group is isomorphic to the E8 Weyl group. This result, together with the orders being equal, implies the desired result (that the groups are isomorphic).

      • Anonymous says:

        I see…in that case the second version (the “Z” version) is also isomorphic to it since it’s
        just the first conjugated by HHH

        • Anonymous says:

          correction : conjugation by HHH takes XHH to ZHH, HXH to HZH,…
          but for T you need HII : (HII takes I+I+I+X to I+I+I+Z…)…but probably the second version still gives the same group

          • apgoucher says:

            Interestingly, the groups are isomorphic but not the same: your group contains diag(1,1,1,1,1,1,1,-1) but mine doesn’t. Your group preserves one of the other descriptions of the E8 lattice: integer points where the parities of the 8 coordinates forms a codeword in the Hamming code.

            The two descriptions of the E8 lattice are (up to scaling) related by the rotation HHH, so the elements of your group should be exactly the elements of my group conjugated by HHH.

  4. Anonymous says:

    HII should work the same way as HHH…it has the advantage of diagonalizing the tiffoli gate.
    (note that because of conventions, HII might have to be replaced by IIH…).
    I use gap for these calculations; what do you use?

  5. Pingback: That group of order 348364800 | Complex Projective 4-Space

  6. Pingback: The Barnes-Wall lattices | Complex Projective 4-Space

Leave a Reply