analiza aiqbench
This research presents a deterministic quantum algorithm for preparing arbitrary spin eigenfunctions, extending existing methods for Dicke states to broader many-body physics applications. By utilizing branching paths and binary spin trees, the study also delivers corresponding classical algorithms for state reconstruction, offering practical tools for quantum chemistry simulations. The work advances fundamental capabilities in controlling complex quantum systems essential for scalable quantum computing architectures.
Deterministic Preparation of Arbitrary Spin Eigenfunctions
arXiv:2608.22892v1 Announce Type: new 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\"{a}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.
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.
Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Data Structures and Algorithms (cs.DS); Chemical Physics (physics.chem-ph)
arXiv:2608.22892 [quant-ph]
(or arXiv:2608.22892v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.22892 arXiv-issued DOI via DataCite (pending registration)
Text integral sub licența deschisă a publicației · 130 cuvinte
Subiecte conexe
Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Quantum Journal · 13 oct. 2026
Fast Bosonic Control via Multiphoton Qubit-Oscillator Interactions
Quantum Journal · 1 oct. 2026
Quantum Measurement, How Reading a Qubit Works
Quantum Zeitgeist · 5 sept. 2026
Heuristic and Optimal Synthesis of CNOT and Clifford Circuits
Quantum Journal · 21 sept. 2026