analiza aiqbench
This paper advances fault-tolerant quantum computing by demonstrating nontrivial transversal logical multi-controlled-Z gates on good quantum locally testable codes with asymptotically optimal parameters. The authors achieve this through a novel covering space method applied to arithmetic cubical complexes, distinguishing their approach from previous hypergraph product constructions. This theoretical breakthrough is significant for reducing overhead in scalable quantum error correction schemes without sacrificing code quality.
Transversal non-Clifford gates on good quantum locally testable codes
arXiv:2609.26691v1 Announce Type: new Abstract: We achieve nontrivial transversal logical multi-controlled-$Z$ 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.
Abstract:We achieve nontrivial transversal logical multi-controlled-$Z$ 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.
Quantum Physics (quant-ph); Information Theory (cs.IT); Mathematical Physics (math-ph)
arXiv:2609.26691 [quant-ph]
(or arXiv:2609.26691v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.26691 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 223 cuvinte
Subiecte conexe
Poincar\'e Duality and Multiplicative Structures on Quantum Codes
arXiv · 7 oct. 2026

Floquetifying stabiliser codes with distance-preserving rewrites
Quantum Journal · 3 sept. 2026
Theory of (Co)homological Invariants on Quantum LDPC Codes
arXiv · 7 oct. 2026
Fault-Tolerant Quantum Computation with Adversarial Errors
arXiv · 18 aug. 2026