Spin-$s$ $U(1)$-eigenstate preparation
Summarize this article with:
Quantum Physics arXiv:2601.14513 (quant-ph) [Submitted on 20 Jan 2026] Title:Spin-$s$ $U(1)$-eigenstate preparation Authors:Nabi Zare Harofteh, Rafael I. Nepomechie View a PDF of the paper titled Spin-$s$ $U(1)$-eigenstate preparation, by Nabi Zare Harofteh and Rafael I. Nepomechie View PDF Abstract: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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2601.14513 [quant-ph] (or arXiv:2601.14513v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2601.14513 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Rafael I. Nepomechie [view email] [v1] Tue, 20 Jan 2026 22:07:41 UTC (18 KB) Full-text links: Access Paper: View a PDF of the paper titled Spin-$s$ $U(1)$-eigenstate preparation, by Nabi Zare Harofteh and Rafael I. NepomechieView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-01 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)