Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908837338939392 |
|---|---|
| author | Iyer, Vishnu Jain, Siddhartha Jordan, Stephen Somma, Rolando |
| author_facet | Iyer, Vishnu Jain, Siddhartha Jordan, Stephen Somma, Rolando |
| contents | We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$, where $n \ge 2$ is constant. For dimension $N$ and error $ε$, the number of quantum gates in our circuits is polynomial in $\log(N)$ and $\log(1/ε)$. Our construction relies on the Jordan-Schwinger representation, which allows us to realize irreps of $SU(n)$ in the Hilbert space of $n$ quantum harmonic oscillators. Together with a recent efficient quantum Hermite transform, which allows us to map the computational basis states to the eigenstates of the quantum harmonic oscillator, this allows us to implement these irreps efficiently. Our quantum circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem. They can also be used to fast-forward the evolution of certain quantum systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_15180 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders Iyer, Vishnu Jain, Siddhartha Jordan, Stephen Somma, Rolando Quantum Physics Computational Complexity We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$, where $n \ge 2$ is constant. For dimension $N$ and error $ε$, the number of quantum gates in our circuits is polynomial in $\log(N)$ and $\log(1/ε)$. Our construction relies on the Jordan-Schwinger representation, which allows us to realize irreps of $SU(n)$ in the Hilbert space of $n$ quantum harmonic oscillators. Together with a recent efficient quantum Hermite transform, which allows us to map the computational basis states to the eigenstates of the quantum harmonic oscillator, this allows us to implement these irreps efficiently. Our quantum circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem. They can also be used to fast-forward the evolution of certain quantum systems. |
| title | Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders |
| topic | Quantum Physics Computational Complexity |
| url | https://arxiv.org/abs/2602.15180 |