REVIEW 5 cited by
Preparing Bethe Ansatz Eigenstates on a Quantum Computer
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Preparing Bethe Ansatz Eigenstates on a Quantum Computer
read the original abstract
Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for which analytic results are unavailable, and which are also not well-described by approximate numerical methods. Preparing Bethe ansatz eigenstates directly on a quantum computer would allow straightforward extraction of these quantities via measurement. We present a quantum algorithm for preparing Bethe ansatz eigenstates of the spin-1/2 XXZ spin chain that correspond to real-valued solutions of the Bethe equations. The algorithm is polynomial in the number of T gates and circuit depth, with modest constant prefactors. Although the algorithm is probabilistic, with a success rate that decreases with increasing eigenstate energy, we employ amplitude amplification to boost the success probability. The resource requirements for our approach are lower than other state-of-the-art quantum simulation algorithms for small error-corrected devices, and thus may offer an alternative and computationally less-demanding demonstration of quantum advantage for physically relevant problems.
Forward citations
Cited by 5 Pith papers
-
Preparing multi-qudit states in a definite-weight subspace
A deterministic algorithm prepares arbitrary multi-qudit states in definite-weight subspaces via Gray codes for multiset permutations and applies it to SU(3) Bethe states and SU(d) Dicke states.
-
Preparing multi-qudit states in a definite-weight subspace
A deterministic algorithm prepares arbitrary multi-qudit states in a definite-weight subspace via Gray-code ordering of multiset permutations, reducing preparation to controlled 2-qudit Gray rotations, and is demonstr...
-
Spin-$s$ $U(1)$-eigenstate preparation
A Gray-code-based quantum circuit prepares arbitrary fixed-digit-sum (U(1)) eigenstates of spin-s chains, yielding the first preparation of spin-s XXX Bethe states.
-
Effective Bethe Ansatz for Spin-1 Non-integrable Models
The Effective Bethe Ansatz approximates ground and first excited states of the spin-1 bilinear-biquadratic chain in finite windows around both integrable endpoints, with fidelity to exact diagonalization degrading con...
-
Effective Bethe Ansatz for Spin-1 Non-integrable Models
Effective Bethe Ansatz approximates ground and excited states of non-integrable spin-1 chains accurately near integrable points, as shown by energy, fidelity, and entanglement comparisons to exact diagonalization.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.