Problem
Research questions and friction points this paper is trying to address.
spin eigenfunctions
deterministic preparation
Dicke states
Deterministic Preparation of Arbitrary Spin Eigenfunctions
🤖 AI Summary
研究通过推广Dicke态制备算法，提出了一种确定性方法来制备任意自旋本征态，并开发了相应的经典算法以重构这些状态。
📝 Abstract
Quantum states with conserved total spins, or spin eigenfunctions, are important for studying quantum chemistry and quantum manybody physics problems. A typical class of spin eigenfunctions are Dicke states, which attain maximal spins. While we already have many efficient quantum algorithms to prepare Dicke states, it is not yet clear if we could do so for arbitrary spin eigenfunctions deterministically. Generalizing Bärtschi and Eidenbenz's elegant algorithms for Dicke state preparation, we successfully prepare arbitrary spin eigenfunctions characterized by branching paths and binary spin trees. As a byproduct, we also develop the corresponding classical algorithms to reconstruct all these spin states.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Deterministic Preparation
Arbitrary Spin Eigenfunctions
Branching Paths
Binary Spin Trees
🔎 Similar Papers
2024-05-29Machine Learning: Science and TechnologyCitations: 2
