Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Transversal non-Clifford gates on good quantum locally testable codes

Published 22 Sep 2026 in quant-ph, cs.IT, and math-ph | (2609.26691v1)

Abstract: We achieve nontrivial transversal logical multi-controlled-ZZ gates with asymptotically optimal parameters simultaneously on quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to the recent good qLTC construction of [arXiv:2609.20780]. To this end, we use the covering space method to construct a nonzero cup product pairing on a finite arithmetic cubical complex. This differs from the previous construction of almost-good codes, whose base space is a hypergraph product. We express the pairing as a coefficient in a product of Moore determinants and prove polynomial nonvanishing by a bipartite multigraph specialization. We then construct covering spaces to obtain an asymptotic family of good qLTCs on which the pulled-back pairing induces the desired nontrivial transversal logical action.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.