Preparing angular momentum eigenstates using engineered quantum walks

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.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2024-12-16
DOI
https://doi.org/10.1103/physreva.110.062214
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Preparing angular momentum eigenstates using engineered quantum walks

Yuan Shi, Michael Kruse, Stephen B. Libby, Kristin M. Beck
2 citations
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
0.69
article

Preparing angular momentum eigenstates using engineered quantum walks

Yuan Shi, Michael Kruse, Stephen B. Libby, Kristin M. Beck
article en
2 citations

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.

Physical review. A/Physical review, AVol. 110(6)
Lawrence Livermore National Laboratory (US), University of Colorado Boulder (US), University of Colorado System (US)
U.S. Department of Energy
Openalex Percentile: Top 23%
Quantum Computing Algorithms and Architecture
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.