A Note on a Quantitative Form of the Solovay-Kitaev Theorem
arXiv:1709.03007
Abstract
The problem of finding good approximations of arbitrary 1-qubit gates is identical to that of finding a dense group generated by a universal subset of to approximate an arbitrary element of . The Solovay-Kitaev Theorem is a well-known theorem that guarantees the existence of a finite sequence of 1-qubit quantum gates approximating an arbitrary unitary matrix in within specified accuracy . In this note we study a quantitative description of this theorem in the following sense. We will work with a universal gate set , a subset of such that the group generated by the elements of is dense in . For small enough, we define as the minimum reduced word length such that every point of lies within a ball of radius centered at the points in the dense subgroup generated by . For a measure of efficiency on T, which we denote , we prove the following theorem: Fix a in . Choose satisfying exists with value . Assume that the inequality holds. Then . Our conjecture implies the following: Let denote the set of integer solutions of the quadratic form: . Let denote the covering radius of the points on the sphere in . Then . Here .
arXiv commentThe work in this paper appears in: S. B. Damelin, Whitney extensions of smooth near isometries, shortest paths, BMO, equidistribution, clustering and non-rigid alignment of data in Euclidean space, John Wiley & Sons 2024