Quick Navigation
Topics
Quantum State Preparation Representation
Spin-s U(1)-eigenstate preparation
arXiv
Authors: Nabi Zare Harofteh, Rafael I. Nepomechie
Year
2026
Paper ID
3545
Status
Preprint
Abstract Read
~2 min
Abstract Words
90
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum State Preparation & Representation research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- We formulate a deterministic algorithm for preparing a general U(1)-eigenstate of a spin-s chain of length n.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.