aiqbench analysis
This paper presents a novel construction of Ramanujan quantum expanders by leveraging the Weil representation to transfer Morgenstern's Cayley graphs, achieving an exact singular value bound without additive error. The approach offers significant efficiency gains in circuit depth and ancilla usage compared to prior methods, specifically targeting applications in quantum error correction and derandomization where high expansion is critical.
Ramanujan quantum expanders from the Weil representation
arXiv:2609.38075v1 Announce Type: new Abstract: For every odd prime power $q$ and $D=q+1$, we construct an infinite family of Ramanujan quantum expanders of degree $D$. The construction transfers Morgenstern's Ramanujan Cayley graphs on $\operatorname{PSL}_2(\mathbb{F}_{p})$ for $p$ which is an even power of $q$, through the odd irreducible subrepresentation of the Weil representation of $\operatorname{SL}_2(\mathbb{F}_{p})$. For a quantum expander of dimension $N$, our implementation uses $O(\log^2 N)$ elementary gates, and $O(\log N)$ ancilla qudits, using a fixed finite gate set depending on $q$. An advantage compared to the previous work of Iyer, Jain, Jordan, and Somma (FOCS 2026) is that assuming the quantum circuit is implemented exactly, we satisfy the $2\sqrt{D-1}/D$ singular value bound exactly without any additive error.
Abstract:For every odd prime power $q$ and $D=q+1$, we construct an infinite family of Ramanujan quantum expanders of degree $D$. The construction transfers Morgenstern's Ramanujan Cayley graphs on $\operatorname{PSL}_2(\mathbb{F}_{p})$ for $p$ which is an even power of $q$, through the odd irreducible subrepresentation of the Weil representation of $\operatorname{SL}_2(\mathbb{F}_{p})$. For a quantum expander of dimension $N$, our implementation uses $O(\log^2 N)$ elementary gates, and $O(\log N)$ ancilla qudits, using a fixed finite gate set depending on $q$. An advantage compared to the previous work of Iyer, Jain, Jordan, and Somma (FOCS 2026) is that assuming the quantum circuit is implemented exactly, we satisfy the $2\sqrt{D-1}/D$ singular value bound exactly without any additive error.
Quantum Physics (quant-ph); Computational Complexity (cs.CC)
arXiv:2609.38075 [quant-ph]
(or arXiv:2609.38075v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.38075 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.
Full text under the publisher's open licence · 210 words
Related coverage

Thousands of Pages Defined Grothendieck’s Early Math Impact
Quantum Zeitgeist · May 26, 2026

Qiskit v2.5 Release Enables Multi-Representation Compilation Workflows and New Name IBM Quantum Compute Service
Quantum Zeitgeist · Jul 14, 2026

ICQIA Expands Global Reach With New Charter And Members
The Quantum Insider · Jun 10, 2026

IBM Research Team Models Unitary Operator Mapping for Unified Quantum-Linguistic Inputs
Quantum Zeitgeist · Jun 15, 2026