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

arXiv:2408.14684 · Physical Review A

Preparing angular momentum eigenstates using engineered quantum walks

Yuan Cheng Shi, Kristin M. Beck, Michael Kruse, Stephen B. Libby

Published Dec 16, 2024• 2 citations
arXivHTMLPDF

Abstract

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta ${\mathbf{J}}_{1}$ and ${\mathbf{J}}_{2}$, forming eigenstates of their total angular momentum $\mathbf{J}={\mathbf{J}}_{1}+{\mathbf{J}}_{2}$, we develop a quantum-walk scheme that does not require inputting $O({j}^{3})$ nonzero Clebsch--Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of $O(j)$ and a worst-case complexity of $O({j}^{3})$. Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in $\text{su}(2)\ifmmode\times\else\texttimes\fi{}\text{su}(2)$, which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. We also implement small test problems on current quantum hardware.

DOI
10.1103/physreva.110.062214

Related papers

Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform

Adam Wills, Sergii Strelchuk

The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of basis from the computational basis to a simultaneous spin eigenbasis of Permutational Quantum Computing (PQC) [Quantum Inf. Comput., 10, 470-497 (2010)]. By adopting the latter perspective, we present a transparent algorithm for implementing the qubit quantum Schur transform which uses $O(\log(n))$ ancillas and can be decomposed into a sequence of $O(n^3\log(n)\log(\frac{n}ε))$ Clifford + T gates, where $ε$ is the accuracy of the algorithm in terms of the trace norm. We discuss the necessity for some applications of implementing this operation as a unitary rather than an isometry, as is often presented. By studying the associated Schur states, which consist of qubits coupled via Clebsch-Gordan coefficients, we introduce the notion of generally coupled quantum states. We present six conditions, which in different combinations ensure the efficient preparation of these states on a quantum computer or their classical simulability (in the sense of computational tractability). It is shown that Wigner 6-j symbols and SU(N) Clebsch-Gordan coefficients naturally fit our framework. Finally, we investigate unitary transformations which preserve the class of computationally tractable states.

arXiv:2305.04069•May 6, 2023•13 citations

Simulating the coupling of angular momenta in distant matter qubits

C. Ammon, Andreas Maser, U. Schilling +2 more

We present a mathematical proof of the algorithm allowing one to generate all---symmetric and nonsymmetric---total angular momentum eigenstates in remote matter qubits by projective measurements, proposed in Maser et al. [Phys. Rev. A 79, 033833 (2009)]. By deriving a recursion formula for the algorithm we show that the generated states are equal to the total angular momentum eigenstates obtained via the usual quantum-mechanical coupling of angular momenta. In this way we demonstrate that the algorithm is able to simulate the coupling of $N$ spin-1/2 systems, and to implement the required Clebsch-Gordan coefficients, even though the particles never directly interact with each other.

arXiv:1207.4974•Physical Review A•Nov 6, 2012•2 citations

Addition of Angular Momenta

Масуд Чайчиан, Rolf Hagedorn

This chapter discusses the addition of angular momenta in the physicist’s way. From the considerations it follows that there are several ways to construct complete systems of commuting angular momentum observables. Belonging to two complete sets (two different ‘couplings’) of commuting angular momentum observables, there must exist a unitary transformation. For more than two angular momenta there will be more sets and more unitary transformations between the different couplings. The matrix elements of these transformations are called ‘recoupling coefficients’. They can be expressed by sums over products of Clebsch-Gordan coefficients (CGCs); this is to be expected from the fact that repeated coupling of two angular momenta generates any desired coupling scheme. It also is to be expected that the transformations between different coupling schemes become rapidly more complicated with growing numbers of subsystems. A powerful and elegant graphical representation for CGCs exists which can be used in the calculations of coupling of angular momenta.

CRC Press eBooks•Jul 14, 2023•0 citations

A Spinor Approach to the SU(2) Clebsch-Gordan Coefficients*

Ling-Di Yang, Famin Chen

Abstract We review the irreducible representation of an angular momentum vector operator constructed in terms of spinor algebra. We generalize the idea of spinor approach to study the coupling of the eigenstates of two independent angular momentum vector operators. Utilizing the spinor algebra, we are able to develop a simple way for calculating the SU(2) Clebsch-Gordan (CG) coefficients. The explicit expression for the SU(2) CG coefficients is worked out, and some simple physical examples are presented to illustrate the spinor approach.

Communications in Theoretical Physics•Jun 1, 2019•0 citations

Efficient Computation of Clebsch-Gordan Coefficients

William O. Straub

The problem of angular momentum addition requires the calculation of Clebsch-Gordan coefficients. While systems involving small values of momenta and spin present no special problem, larger systems require extensive computational effort. This paper describes a straightforward method for computing the coefficients for any two-particle problem exactly by means of a simplified form of the recursion formula in a notation that is particularly accessible to the third- or fourth-year student. The method is summarized in a brief BASIC program.

•Mar 1, 2014•1 citation

Adding angular momenta

Efstratios Manousakis

Abstract This chapter discusses addition of angular momentum. This implies that it discusses how to build eigenstates of the total angular momentum and its projection from eigenstates of the individual angular momenta and their projections. It discusses Clebsh–Gordan coefficients.

Oxford University Press eBooks•Nov 1, 2015•1 citation
Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J1{\mathbf{J}}_{1}J1​ and J2{\mathbf{J}}_{2}J2​, forming eigenstates of their total angular momentum J=J1+J2\mathbf{J}={\mathbf{J}}_{1}+{\mathbf{J}}_{2}J=J1​+J2​, we develop a quantum-walk scheme that does not require inputting O(j3)O({j}^{3})O(j3) nonzero Clebsch--Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O(j)O(j)O(j) and a worst-case complexity of O(j3)O({j}^{3})O(j3). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su(2)\ifmmode×\else\texttimes\fisu(2)\text{su}(2)\ifmmode\times\else\texttimes\fi{}\text{su}(2)su(2)\ifmmode×\else\texttimes\fisu(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. We also implement small test problems on current quantum hardware.
The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of basis from the computational basis to a simultaneous spin eigenbasis of Permutational Quantum Computing (PQC) [Quantum Inf. Comput., 10, 470-497 (2010)]. By adopting the latter perspective, we present a transparent algorithm for implementing the qubit quantum Schur transform which uses O(log⁡(n))O(\log(n))O(log(n)) ancillas and can be decomposed into a sequence of O(n3log⁡(n)log⁡(nε))O(n^3\log(n)\log(\frac{n}ε))O(n3log(n)log(εn​)) Clifford + T gates, where εεε is the accuracy of the algorithm in terms of the trace norm. We discuss the necessity for some applications of implementing this operation as a unitary rather than an isometry, as is often presented. By studying the associated Schur states, which consist of qubits coupled via Clebsch-Gordan coefficients, we introduce the notion of generally coupled quantum states. We present six conditions, which in different combinations ensure the efficient preparation of these states on a quantum computer or their classical simulability (in the sense of computational tractability). It is shown that Wigner 6-j symbols and SU(N) Clebsch-Gordan coefficients naturally fit our framework. Finally, we investigate unitary transformations which preserve the class of computationally tractable states.
We present a mathematical proof of the algorithm allowing one to generate all---symmetric and nonsymmetric---total angular momentum eigenstates in remote matter qubits by projective measurements, proposed in Maser et al. [Phys. Rev. A 79, 033833 (2009)]. By deriving a recursion formula for the algorithm we show that the generated states are equal to the total angular momentum eigenstates obtained via the usual quantum-mechanical coupling of angular momenta. In this way we demonstrate that the algorithm is able to simulate the coupling of NNN spin-1/2 systems, and to implement the required Clebsch-Gordan coefficients, even though the particles never directly interact with each other.
This chapter discusses the addition of angular momenta in the physicist’s way. From the considerations it follows that there are several ways to construct complete systems of commuting angular momentum observables. Belonging to two complete sets (two different ‘couplings’) of commuting angular momentum observables, there must exist a unitary transformation. For more than two angular momenta there will be more sets and more unitary transformations between the different couplings. The matrix elements of these transformations are called ‘recoupling coefficients’. They can be expressed by sums over products of Clebsch-Gordan coefficients (CGCs); this is to be expected from the fact that repeated coupling of two angular momenta generates any desired coupling scheme. It also is to be expected that the transformations between different coupling schemes become rapidly more complicated with growing numbers of subsystems. A powerful and elegant graphical representation for CGCs exists which can be used in the calculations of coupling of angular momenta.
Abstract We review the irreducible representation of an angular momentum vector operator constructed in terms of spinor algebra. We generalize the idea of spinor approach to study the coupling of the eigenstates of two independent angular momentum vector operators. Utilizing the spinor algebra, we are able to develop a simple way for calculating the SU(2) Clebsch-Gordan (CG) coefficients. The explicit expression for the SU(2) CG coefficients is worked out, and some simple physical examples are presented to illustrate the spinor approach.
The problem of angular momentum addition requires the calculation of Clebsch-Gordan coefficients. While systems involving small values of momenta and spin present no special problem, larger systems require extensive computational effort. This paper describes a straightforward method for computing the coefficients for any two-particle problem exactly by means of a simplified form of the recursion formula in a notation that is particularly accessible to the third- or fourth-year student. The method is summarized in a brief BASIC program.