Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

The Construction of Spin Eigenfunctions

Ruben Pauncz

Published Jan 1, 2000• 56 citations
Publisher
DOI
10.1007/978-1-4615-4291-9

Related papers

Spin Eigenfunctions: Construction and Use

Ruben Pauncz

•Jan 1, 1979•130 citations

Genealogical Construction of Spin Eigenfunctions

Ruben Pauncz

Springer eBooks•Jan 1, 2000•1 citation

Construction of Spin Eigenfunctions by the Projection Operator Method

Ruben Pauncz

Springer eBooks•Jan 1, 1979•0 citations

Spin-Paired Spin Eigenfunctions

Ruben Pauncz

Springer eBooks•Jan 1, 1979•1 citation

Iterative construction of eigenfunctions of the monodromy matrix for $SL(2,\mathbb {C})$ magnet

S É Derkachov, Alexander N Manashov

Eigenfunctions of the matrix elements of the monodromy matrix provide a convenient basis for studies of spin chain models. We present an iterative method for constructing the eigenfunctions in the case of the SL(2,C) spin chains. We derived an explicit integral representation for the eigenfunctions and calculated the corresponding scalar products (Sklyanin's measure).

arXiv:1401.7477•Journal of Physics A Mathematical and Theoretical•Jul 10, 2014•28 citations

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

Alessandro Carbone, Davide Emilio Galli, Mário Motta +1 more

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

arXiv:2202.09479•Symmetry•Mar 21, 2022•18 citations
Iterative construction of eigenfunctions of the monodromy matrix for SL(2,C)SL(2,\mathbb {C})SL(2,C) magnet
The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.