The SIC Question: History and State of Play

Recent years have seen significant advances in the study of symmetric informationally complete (SIC) quantum measurements, also known as maximal sets of complex equiangular lines. Previously, the published record contained solutions up to dimension 67, and was with high confidence complete up through dimension 50. Computer calculations have now furnished solutions in all dimensions up to 151, and in several cases beyond that, as large as dimension 844. These new solutions exhibit an additional type of symmetry beyond the basic definition of a SIC, and so verify a conjecture of Zauner in many new cases. The solutions in dimensions 68 through 121 were obtained by Andrew Scott, and his catalogue of distinct solutions is, with high confidence, complete up to dimension 90. Additional results in dimensions 122 through 151 were calculated by the authors using Scott's code. We recap the history of the problem, outline how the numerical searches were done, and pose some conjectures on how the search technique could be improved. In order to facilitate communication across disciplinary boundaries, we also present a comprehensive bibliography of SIC research.


I. INTRODUCTION
The problem of symmetric, informationally complete quantum measurements [1][2][3][4] stands at the confluence of multiple areas of physics and mathematics. SICs, as they are known for short, tie into algebraic number theory [5][6][7][8], higher-dimensional sphere packing [9], Lie and Jordan algebras [10,11], finite groups [12,13] and quantum information theory [14][15][16][17][18][19][20][21][22][23]. Without the study of SICs, one might think that the intersection of all these subjects would have to be the empty set. And yet, for all that, a SIC is a remarkably simple mathematical structure, as structures go. Consider the complex vector space C d . To a physicist, this is the Hilbert space associated with a d-level quantum system. Let {|ψ j } be a set of exactly d 2 unit vectors in C d such that | ψ j |ψ k | 2 = 1 d + 1 (1) whenever j = k. The set {|ψ j }, which can be associated with a set of pairwise equiangular lines through the origin, is a SIC. One can prove that no more than d 2 vectors in a d-dimensional Hilbert space can be equiangular. That is, if {|ψ j } is a set of vectors, and | ψ j |ψ k | 2 = α for every j = k, then that set can have at most d 2 elements. In addition, for a maximal set the value of α is fixed by the dimension; it must be 1/(d + 1). So, a SIC is a maximal equiangular set in C d ; the question is whether they can be constructed for all values of the dimension. Despite a substantial number of exact solutions, as well as a longer list of high-precision numerical solutions [4,8,24], the problem remains open. Exact solutions, found by hand in a few cases and by computer algebra software in the others, are known in the following dimensions: 28, 30, 31, 35, 37, 39, 43, 48, 124. ( The historical record of exact solutions has been spread over several publications [4,8,25,26]. For several years, the most extensive published set of numerical results went as high as dimension d = 67 [4]. Now, numerical solutions are known in all dimensions up to and including d = 151, as well as a handful of other dimensions up to d = 844. These numerical solutions were found using code designed and written by Scott, who extended the results of [4] through d = 121 using his personal computer over several years of dedicated effort. In addition, Scott found solutions in a set of dimensions (d = 124,143,147,168,172,195,199,228,259, 323) by taking advantage of particular simplifying assumptions that are applicable in those dimensions [24]. Further close study of these properties led to a solution for d = 844 [26]. Because dimension d = 121 was pushing the limits of what was computationally feasible without those simplifying assumptions, the authors calculated solutions in dimensions 122 through 151 by running Scott's code on the Chimera supercomputer at UMass Boston. In turn, Scott was able to employ another algorithm (outlined below) to refine the numerical precision of these results. The solutions from all of these search efforts are available together at the following website: An intriguing feature of the SIC problem is that some numerical solutions, if extracted to sufficiently high precision, can be converted to exact ones [8,25]. Most recently, this technique was used to derive an exact solution in dimension d = 48. Another interesting aspect is that the number of distinct SIC constructions varies from one dimension to another. (The sense in which two SICs can be equivalent will be discussed in detail below.) One reason computational research is valuable, beyond extending the list of dimensions in which SICs are known, is that it provides what is likely a complete picture for many values of the dimension. This is important for understanding the subtle connection between SICs and algebraic number theory [5], a connection that brings a new angle of illumination to Hilbert's twelfth problem [6,7].
SICs are so called because, thanks to the rules of quantum theory, a SIC in C d specifies a measurement procedure that can, in principle, be applied to a d-level quantum system. For example, a SIC in C 2 is a set of four equiangular lines, and it is a mathematical model of a measurement that a physicist can perform on a single qubit. The term "informationally complete"-the "IC" in "SIC"-means that if one has a probability distribution for the possible outcomes of a SIC experiment, one can compute the probabilities for the possible outcomes of any other experiment carried out on the target system [17]. So, while one can pose the question of their existence using pure geometry, SICs are relevant to applied physics. Indeed, SIC measurements have recently been performed or approximated in the laboratory [27][28][29][30][31][32][33][34], and they are known to be optimal measurements for quantum-state tomography [35].
A SIC provides a frame-more specifically, an equiangular tight frame-for the vector space C d . Given a finitedimensional Hilbert space H with an inner product ·, · , a frame for H is a set of vectors {v j } ⊂ H such that for any vector u ∈ H, for some positive constants A and B. The frame is equal-norm if all the vectors {v j } have the same norm, and the frame is tight if the "frame bounds" A and B are equal. The ratio of the number of vectors to the dimension of the space is known as the redundancy of the frame [36]. For more on this terminology and its history, we refer to Kovačević and Chebira [37,38]. In our experience, the language of frames is more common among those who come to SICs from pure mathematics or from signal processing than among those motivated by quantum physics.
Any vector in C d can be represented by its inner products with all the SIC vectors. In quantum physics, one also considers the set of Hermitian operators on C d . This set in fact forms a Hilbert space itself, with a dimension of d 2 , and the inner product given by the Hilbert-Schmidt formula A, B = tr(AB).
Rewriting the SIC vectors {|ψ j } as rank-1 projection operators, we construct a nonorthogonal basis for the Hilbert space of Hermitian operators. Because the inner products of these projectors are uniform, given by then it is straightforward to find a shifting and rescaling that orthogonalizes the basis {Π j }, at the cost of making the operators non-positive-semidefinite. In fact, there are two choices: The bases {Q ± j } have interesting properties with regard to Lie algebra theory [11] and the study of quantum probability [20,39].

II. GENERATING SICS WITH GROUPS
All known SICs have an additional kind of symmetry, above and beyond their definition: They are group covariant. Each SIC can be constructed by starting with a single vector, known as a fiducial vector, and acting upon it with the elements of some group. It is not known in general whether a SIC must be group covariant. Because such an assumption greatly reduces the search space [4,5], it has been the only method used so far: The fact that we only know of group-covariant SICs could potentially be an artifact of this. (However, we do have a proof that all SICs in d = 2 and d = 3 are group covariant [40].) In all cases but one, the group that generates a SIC from a fiducial is an instance of a Weyl-Heisenberg group. We can define this group as follows. First, fix a value of d, and let ω = e 2πi/d . Let {|0 , |1 , . . . , |d − 1 } be an orthonormal basis for the Hilbert space H d = C d . Then, construct the shift and phase operators where the shift is modulo d. These operators satisfy the Weyl commutation relation, In a sense, the operators X and Z come as close as possible to commuting, without actually doing so: The only cost to exchanging their order is a phase factor determined by the dimension. The Weyl-Heisenberg displacement operators in dimension d are defined by The product of two displacement operators is, up to a phase factor, a third: Therefore, by allowing the generators to be multiplied by phase factors, we can define a group, known as the Weyl-Heisenberg group in dimension d. This group dates back to the early days of quantum physics. Weyl introduced the generators X and Z as long ago as 1925 in order to define what one might mean by the quantum theory of discrete degrees of freedom [41][42][43] (see also [44, pp. 2055-56]). This group, and structures derived from it, are critically important in quantum information and computation; for example, this is the basic prerequisite for the Gottesman-Knill theorem, which indicates when a quantum computation can be efficiently simulated classically [45]. The close relationship between SICs and the Weyl-Heisenberg group suggests that SICs are a kind of structure that quantum physics should have been studying all along. Zhu has proved that in prime dimensions, group covariance implies Weyl-Heisenberg covariance [46]. The one known exception to the rule of Weyl-Heisenberg covariance is the Hoggar SIC [47,48], which lives in a prime-power dimension, d = 8. As in all other dimensions, there is a Weyl-Heisenberg SIC, but there is also the Hoggar SIC. Like many other exceptions to mathematical classifications, it is related to the octonions [9,13].
One example of a Weyl-Heisenberg SIC can be constructed by taking the orbit of the following two-dimensional vector under the Weyl-Heisenberg displacement operators: This orbit is a set of four vectors. In the Bloch sphere representation, they form the vertices of a regular tetrahedron inscribed within the sphere. An example in dimension d = 3, one which is remarkable for the further subtle symmetries it possesses beyond even group covariance, is the orbit of under the Weyl-Heisenberg displacements. This set of vectors is known as the Hesse SIC [40,49,50], thanks to its relation with the Hesse configuration familiar from design theory and the study of cubic curves, specifically nonsingular cubic curves in complex projective two-space [12,16,51,52].

III. HISTORICAL OVERVIEW
In order to understand the current state of SIC research, one must grasp how people came to the SIC question, what other structures they think are related, what tools they suspect are applicable, and so forth. A physicist, motivated by quantum information theory, is apt to have a different mental context than a pure mathematician driven by the abstract appeal of geometry. To attempt to foster an interdisciplinary discussion, we provide in this section a brief historical overview.
The Hesse SIC can be extracted from a 1940 article by H. S. M. Coxeter [53], which discusses what he later called the "Hessian polyhedron" [51]. This polyhedron lives in three-dimensional complex vector space and has 27 vertices (which correspond to the 27 lines on a cubic surface [54]). The vectors in the Hesse SIC are a subset of those vertices. Mathematicians were studying SICs in d = 2 and d = 3 more explicitly as early as the 1970s, in the terminology of complex equiangular lines [55]. Stuart Hoggar found a SIC in dimension d = 8 a few years later [47], by considering the diagonals of a quaternionic polytope and converting their coordinates to complex numbers. The SICs in d = 2 and d = 3, together with the Hoggar lines in d = 8, still stand out among the known SICs; various unusual attributes they possess have led them to be designated the sporadic SICs [7,9].
In a 1987 article, Richard Feynman used a construction that is in retrospect a d = 2 SIC to study the probability theory of a qubit. SICs entered quantum theory more generally starting with the work of Gerhard Zauner, who began to consider the problem in the 1990s [44, p. 1941]. By 1999, Zauner had found the connection with the Weyl-Heisenberg group and proven SIC existence up to d = 5 [1]. He also posed a conjecture that the search for Weyl-Heisenberg SICs could be simplified by considering a particular unitary operator [1], a conjecture we will describe in detail below.
Independently of Zauner, Carlton Caves developed the idea of a SIC as representing a quantum measurement [2], motivated originally by attempts to prove the "quantum de Finetti theorem" [56]. SICs turned out to have more symmetry than was necessary for that proof, but they soon took on a life of their own in quantum information theory [23]. The term "SIC" (first pronounced as "sick," and later like "seek") dates to this period. A 2004 paper, "Symmetric Informationally Complete Quantum Measurements" [3], introduced them to the mainstream of the quantum information community, and reported numerical solutions for dimensions up to d = 45. In a later survey, Andrew Scott and Markus Grassl extended these numerical results up to dimension d = 67 [4]. Further work by Scott established Weyl-Heisenberg SICs in all cases up to d = 121 without exception. Moreover, these results together are probably a complete catalogue of all distinct Weyl-Heisenberg SICs up to dimension d = 90 [24]. In later sections, we will give an overview of how these searches were done.
Exact solutions were found more slowly. Having exact expressions for SIC fiducial vectors allowed Appleby et al. to discover a connection with Galois theory [57]. In turn, this led to further relations with algebraic number theory, a frankly mysterious development that is still under active investigation [5][6][7][8].
Before moving on, we note that the real analogue of the SIC problem, i.e., finding maximal sets of equiangular lines in real vector spaces, has also been of considerable interest to mathematicians [79][80][81]. The maximal number of equiangular lines in a d-dimensional vector space is not d 2 , but only d(d + 1)/2. That is, if we have a set of N unit vectors {v i } in a d-dimensional vector space, such that then the size N of the set cannot exceed d(d + 1)/2. Moreover, while the complex bound of d 2 has been saturated in every dimension that we have been able to check, it is known that the real bound of d(d + 1)/2 is not even attained for all values of d. For example, in d = 7, one can construct a set of 7 · 8/2 = 28 equiangular lines, but this is also the best that can be done in d = 8. In fact, the only known instances where the bound of d(d + 1)/2 can be attained are dimensions 2, 3, 7 and 23 [81].
There is a sign freedom in this definition of the angle, since Eq. (14) is satisfied if the inner product v i ,v j is either +α or −α. The presence of this discrete choice means that investigations of real equiangular lines often have a rather combinatorial flavor. In contrast, when we take the magnitude of a complex inner product, we discard a continuous quantity, a phase that in principle can be anywhere from 0 to 2π. Generally speaking, the "feel" of the real and complex problems differ, as is evidenced by the different areas of mathematical expertise brought to bear upon them. However, subtle and unanticipated points of contact between the real and complex cases do exist [13].

IV. HOW TO SEARCH FOR SICS NUMERICALLY
As before, let {|j } be an orthonormal basis for the Hilbert space H d = C d . In this basis, the fiducial vector can be written for some set of coefficients {a j }.
Acting with the Weyl-Heisenberg operator D lβ on the fiducial vector |ψ 0 produces a new vector, whose squared innner product with the fiducial vector is The right-hand side has the form of the magnitude squared of a Fourier coefficient, i.e., of a power spectrum. Specifically, the set of squared inner products between ψ (l,β) and |ψ 0 for any given value of l is the power spectrum of the sequence By the Wiener-Khinchin theorem, we know that the power spectrum of a sequence is the Fourier transform of the autocorrelation of that sequence [82]. Therefore, the autocorrelation of the sequence f (l) j , when put through the Fourier transform, will yield the sequence [F] βl . The set of autocorrelation sequences for all values of l forms a matrix. Using to denote the correlation of two sequences, we can write the elements of this matrix as The matrix G is in many situations more convenient to work with than the original matrix F, because G lacks phase factors and treats both of its indices on equal footing. For example, it is apparent from the definition of G that This is equivalent to a property of the matrix F that is less obvious to the eye: If we take the Fourier transform of the columns of the matrix G, we recover the squared inner products between the candidate SIC vectors and the fiducial. This means that if the vectors { ψ (l,β) } really do comprise a SIC, then the matrix G must take a very specific form. Every entry in F ({[G] kl }) β must equal 1/(d + 1), except for the element at l = β = 0, which equals 1. Recalling that a constant sequence is the discrete Fourier transform of a Kronecker delta function, we can deduce the desired values of [G] kl . The result is that if |ψ is a Weyl-Heisenberg fiducial vector, then This implication also works in reverse, thanks to the transitivity of the group action.
The basic idea of finding SICs numerically is to use standard optimization methods to find a fiducial vector that makes [G] kl as close to the desired form as possible. Note that, when G is constructed from a SIC fiducial, and the inequality is saturated if and only if the input vector is truly a SIC fiducial. This naturally suggests a way to find SIC fiducial vectors: Minimize the LHS of the inequality in Eq. (24), aiming for the lower bound given on the RHS. During our time investigating the SIC question, we have at various points implemented this idea in Mathematica, in Python and in C++ using the GNU Scientific Library. We find in general that numerical optimization finds a local minimum quickly, but a local minimum might only imply inner products between the vectors that are correct to a few decimal digits. A way around this problem is to repeat the optimization many times, starting from different points in the search space. Since these trials can run concurrently, the problem is amenable to parallelization. This is the approach we followed when using the Chimera supercomputer to obtain solutions in dimensions 122 through 151. Scott's implementation, which we employed on Chimera, uses a C++ code for a limited-memory quasi-Newton optimization algorithm, L-BFGS, due to Liu [84].
As is evident from Figure 1, the time required to obtain solutions did not increase steadily with the dimension.  Once we have a numerical result in hand, we can refine its precision. This requires a code that uses multi-precision arithmetic, which will run more slowly than the optimization in the first step [24]. The fiducial vectors available at [24] and at the website referenced above were obtained in this way and are accurate to 150 digits.
Before moving on, we note a conjecture, based on numerical evidence, that hints at additional hidden structure in the SIC problem. Note that the definition of G implies Here, indices are to be interpreted modulo d. Because any autocorrelation attains its maximum at zero offset, we also know immediately that the elements of G cannot be larger in the middle of the matrix than they are on the edges: The Fourier transform of [G] kl over the index k is, by the Wiener-Khinchin theorem, the power spectrum of f (l) . Because power spectra are nonnegative, we can say that Are there additional symmetries or redundancies, not so apparent from the definition? By happenstance, one of the authors (CAF) observed that imposing a subset of the constraints in Eq. (22) was sufficient to find a SIC fiducial vector [44, pp. 1252-59]. Specifically, by finding a solution to the simultaneous equations one finds a solution to all the equations in (22). The redundancies in Eq. (25) are sufficient to imply that this holds up to d = 5. We call the idea that it remains true in all dimensions the "3d conjecture." It has been verified numerically up to dimension d = 28 [83]. If the 3d conjecture is indeed true, it would reduce the complexity of the problem, as measured by the number of simultaneous equations to solve, from quadratic in the dimension to linear.

V. ZAUNER SYMMETRY
Is there any way to narrow the search space for SIC fiducial vectors? To see how to answer this in the affirmative, we must elaborate upon the group theory we discussed in the previous sections. The Clifford group for dimension d is the "normalizer" of the Weyl-Heisenberg group: It is the set of all unitary operators that, acting by conjugation, map the set of Weyl-Heisenberg operators in dimension d to itself. We saw earlier how the orbit of a vector under the Weyl-Heisenberg group can be a SIC; likewise, we can study the orbit of a vector under the entire Clifford group.
For our purposes in this note, the important point is that if we conjugate a Weyl-Heisenberg operator D kl by a Clifford unitary U , we obtain a Weyl-Heisenberg operator D k l , possibly with an additional phase. Details on the construction and representation of the Clifford group in any finite dimension d can be found in Appleby [85].
It was conjectured by Zauner [1], and independently by Appleby, that in every dimension d > 2, a Weyl-Heisenberg SIC fiducial exists that is an eigenvector of a certain order-3 Clifford unitary, which is now known as the Zauner unitary. Acting on the Weyl-Heisenberg generators, the Zauner unitary effects the change up to an overall phase factor. (See equation (3.10b) of Zauner [1], or equation (127) of Appleby [85].) Applying this again yields and a third iteration gives confirming that this operation has order 3. How might assuming the Zauner conjecture simplify the search for SICs? First, we will make some remarks on this from an algebraic perspective, and then we will address the point in a way suited to numerical optimization. Let |ψ be a candidate fiducial vector, and suppose that it is an eigenvector of the Zauner unitary U with unit eigenvalue: Consequently, As U is a Clifford unitary, requiring that |ψ is an eigenvector of U implies degeneracies among the elements of the matrix F. Because the Zauner unitary sends the left edge of F to the top edge and then to the main diagonal. More generally, specifying a column of F (which is equivalent to fixing a column of G) and imposing the Zauner condition means that the same constraint also simultaneously fixes a row and a diagonal. Earlier, in Eq. (20), we saw that a symmetry of G implied a Fourier-type relation among the elements of F. We have expressed the Zauner condition as a degeneracy within F, but what does it imply for G? The result can be found straightforwardly, and it closely resembles Eq. (20): This the expression of Zauner symmetry in the G matrix. A special case of note: If we set k = l = 0, then We note that the assumption that the fiducial is a Zauner eigenvector is enough to prove some additional cases of the 3d conjecture, up to dimension d = 9, in a straightforward way. In dimension d = 5, the basic symmetries of G imply that the 3d constraints automatically specify the entire matrix G, and thus also fix F to have the desired form for a SIC. By imposing the condition that our initial vector is a Zauner eigenvector, we can extend this up to dimension d = 8. This can be seen directly by drawing an 8 × 8 grid and shading in the appropriate squares.
In fact, we can carry this argument a little further. We obtain G by Fourier transforming the columns of F.
Recalling that we therefore find that In other words, the Zauner condition implies that if we add up the entries in a column, leaving out the entry on the top row, they must all cancel out and leave zero. We knew already, thanks to the Wiener-Khinchin theorem and Eq. (27), that the imaginary parts will sum to zero. Now we can establish this for the real parts as well.
The left-most column of G is also its top row, which tells us the averages of each column of F. So, if the Zauner orbits leave only one element in a column unspecified, then we can fill in that element, because we know the average over the whole column vector. This proves the 3d conjecture in dimension d = 9.
We now turn to the simplification that the Zauner conjecture provides for numerical search efforts. By postulating that the SIC fiducial we are looking for is a Zauner eigenvector, we can significantly reduce the effective size of the search space. First, suppose that U is a unitary of order n, so that and the eigenvalues of U can all be written with m an integer. The projector onto the eigenspace with this eigenvalue is We can restrict our numerical search to this subspace by projecting our vectors into it, at each iteration of the optimization algorithm.
Most of the known solutions were found by postulating Zauner symmetry. Scott has also found several solutions by assuming that the fiducial was an eigenvector of another Clifford unitary. For an in-depth exposition of these variations, see [24].

VI. EXHAUSTIVE SEARCHES
Suppose that |ψ 0 ∈ H d is a vector in a Weyl-Heisenberg SIC, and let U be a Clifford unitary. Applying U to the vector |ψ 0 will yield some vector, The Weyl-Heisenberg orbit of |ψ 0 is a SIC, so what about the orbit of |χ 0 under the same group? We define and we consider the squared magnitudes of the inner products Because U is a Clifford unitary, it maps D kl to some Weyl-Heisenberg operator D k l , with any phase factor dropping out when we take the magnitude of the inner product. So, meaning that the image of our original SIC under the mapping U is also a SIC. One way in which the Hesse SIC is remarkable is that it is invariant under the entire Clifford group. For contrast, we can take the vector which differs from the Hesse SIC fiducial in Eq. (13) by a sign. The orbit of this vector under the Clifford group is a set of four separate SICs, comprising 36 vectors in all-the so-called Norrell states, which are significant in the theory of quantum computation [52,86]. We consider two SICs equivalent if they can be mapped into each other by a Clifford unitary. In fact, it is convenient to extend the Clifford group by including the anti-unitary operation of complex conjugation. The extended Clifford group for dimension d, EC(d), is the set of all unitary and anti-unitary operators that send the Weyl-Heisenberg group to itself. For (extensive) details, we again refer to Appleby [85,87].
In order to search the space as exhaustively as possible and create a catalogue of all essentially unique SICs, Scott's code chooses initial vectors at random under the unitarily invariant Haar measure on the complex projective space CP d−1 . Once enough solutions are found-generally, this means hundreds of them-the code then refines their precision, as described above. Then, we must identify unique orbits under the extended Clifford group. This last step is computationally demanding, because we must translate each solution vector |ψ by each element in the extended Clifford group EC(d). However, in the process, Scott's algorithm also finds the stabilizer group of each fiducial, which is important information. The task of determining when two SICs are equivalent up to a unitary or anti-unitary transformation has been discussed in depth by Zhu [18], and we expect that additional theoretical insights may lead to an improved algorithm for this step.
Following this procedure, Scott has carried out exhaustive searches in dimensions up to d = 90. We strongly expect his catalogue of solutions to be complete up to that point: All Weyl-Heisenberg SICs in those dimensions are equivalent to the ones tabulated, up to equivalence under the extended Clifford group.

VII. DISCUSSION
In the preceding sections, we have described the process of finding SIC fiducial vectors numerically. However, some patterns among SICs have only become apparent when exact solutions were studied carefully. Suppose we refrain from taking the magnitude-squared in our definition of a SIC, Eq. (1). Then for some set of phases {e iθ jk }. (In fact, one can reconstruct the SIC from knowing the phases [10].) It was recently discovered that when d > 3, for all the known Weyl-Heisenberg SICs, these phases have a remarkable meaning in algebraic number theory: They are units in ray class fields and extensions thereof [5]. This is a topic to which we can hardly do justice here, and indeed, treatments accessible to anyone who is not already an algebraic number theorist have only recently been attempted [6,7]. For now, we content ourselves with the observation that this area of number theory is the territory of Hilbert's twelfth problem, one of the still outstanding questions on history's most influential list of mathematical challenges [88]. (Specialists may recall that according to the Kronecker-Weber theorem, any abelian extension of the rationals is contained in a cyclotomic field. When we instead consider abelian extensions of real quadratic fields, the analogue of the cyclotomic fields are the ray class fields. The phases of Weyl-Heisenberg SICs appear to be playing a role regarding ray class fields much like the role that roots of unity play with cyclotomic fields. Moreover, recalling Eq. (14), it is intriguing that in the real-vector-space version of equiangular lines, we discard a phase factor that is a unit among the ordinary integers, while in the complex Weyl-Heisenberg case, the phases turn out to be units among algebraic integers.) From Hilbert space to Hilbert's twelfth problem! What physicist would ever have anticipated that? And who could turn down the opportunity to intermingle two subjects that had seemed so widely separated? SICs have found relevance, not just in quantum computation, but in signal-processing tasks like high-precision radar [89] and speech recognition [90]. In February 2016, our colleague Marcus Appleby attended a conference in Bonn, Germany on uses of the Weyl-Heisenberg group. Many participants were engineers, including representatives from the automotive and cell-phone industries. Appleby was told that if he managed to construct a SIC in dimension 2048, he should patent it [91]. At the moment, dimension 2048 is beyond our abilities for algebraic or numerical solutions, but this may not always be the case.

VIII. ACKNOWLEDGMENTS
We are deeply indebted to Andrew J. Scott, the guru of SIC numerical solutions, for code and for discussions. We also thank Marcus Appleby for many conversations, and Gary McConnell for email feedback on the original arXiv version of this article. This research was supported in part by MCH's Oracle Undergraduate Research Fellowship at UMass Boston.

IX. AUTHOR CONTRIBUTIONS
MCH ran the calculations on Chimera to find SICs in dimensions 122 through 151. BCS wrote the paper. CAF directed the research, contributed to the bibliography and worked with BCS in revising the paper.