Preparing angular momentum eigenstates using engineered quantum walks

TL;DR

This paper introduces a quantum-walk-based method for preparing angular momentum eigenstates and computing Clebsch-Gordan coefficients efficiently on quantum computers, avoiding classical complexity bottlenecks.

Contribution

It develops a novel Hamiltonian-engineered quantum walk scheme for deterministic angular momentum state preparation and CG coefficient computation, improving efficiency and scalability.

Findings

Successfully reproduces CG coefficients on classical simulations.

Demonstrates feasibility of small-scale implementation on current quantum hardware.

Provides a unitary decomposition of CG coefficients into sparser operations.

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 to usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in $\mathfrak{su}(2)\times \mathfrak{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 CG coefficients. We also implement small test problems on current quantum hardware.