Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.14513 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918298430472192 |
|---|---|
| author | Harofteh, Nabi Zare Nepomechie, Rafael I. |
| author_facet | Harofteh, Nabi Zare Nepomechie, Rafael I. |
| contents | We formulate a deterministic algorithm for preparing a general $U(1)$-eigenstate of a spin-$s$ chain of length $n$. These states consist of linear combinations of computational basis states $|\vec{m}\rangle$ of $n$ qudits, each with $(2s+1)$ levels and $s= 1/2, 1, 3/2, \ldots$, whose ditstrings $\vec{m}$ have a fixed digit sum. Exploiting a Gray code for bounded integer compositions, whose consecutive ditstrings obey the Gray property, the quantum state is prepared by applying corresponding ``Gray gates.'' We use this algorithm to prepare exact eigenstates of integrable spin-$s$ XXX Hamiltonians. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14513 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spin-$s$ $U(1)$-eigenstate preparation Harofteh, Nabi Zare Nepomechie, Rafael I. Quantum Physics We formulate a deterministic algorithm for preparing a general $U(1)$-eigenstate of a spin-$s$ chain of length $n$. These states consist of linear combinations of computational basis states $|\vec{m}\rangle$ of $n$ qudits, each with $(2s+1)$ levels and $s= 1/2, 1, 3/2, \ldots$, whose ditstrings $\vec{m}$ have a fixed digit sum. Exploiting a Gray code for bounded integer compositions, whose consecutive ditstrings obey the Gray property, the quantum state is prepared by applying corresponding ``Gray gates.'' We use this algorithm to prepare exact eigenstates of integrable spin-$s$ XXX Hamiltonians. |
| title | Spin-$s$ $U(1)$-eigenstate preparation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2601.14513 |