Sarnak's conjecture in quantum computing, cyclotomic unitary group coranks, and Shimura curves
Colin Ingalls, Bruce W. Jordan, Allan Keeton, Adam Logan, and Yevgeny, Zaytman

TL;DR
This paper investigates the generation of cyclotomic unitary groups in quantum computing, analyzing their corank via actions on Bruhat-Tits trees, and establishes conditions under which these groups are generated by torsion elements, supporting Sarnak's conjecture.
Contribution
It provides explicit bounds on the corank of cyclotomic unitary groups for specific families and connects these bounds to Shimura curves, offering a new proof of Sarnak's conjecture in quantum computing.
Findings
Corank of groups grows doubly exponentially with parameter s.
Groups are generated by torsion elements for specific n values like 8, 12, 16, 24.
Cyclotomy-based bounds are stronger than those from Shimura curves.
Abstract
Sarnak's conjecture in quantum computing concerns when the groups and over cyclotomic rings with , , are generated by the Clifford-cyclotomic gate set. We previously settled this using Euler-Poincar\'{e} characteristics. A generalization of Sarnak's conjecture is to ask when these groups are generated by torsion elements. An obstruction to this is provided by the corank: a group has only if is not generated by torsion elements. In this paper we study the corank of these cyclotomic unitary groups in the families and , , by letting them act on Bruhat-Tits trees. The quotients by this action are finite graphs whose first Betti number is the corank of the group. Our main result is that for and the corank…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Benford’s Law and Fraud Detection
