Bethe states on a quantum computer: success probability and correlation functions

Abstract

A probabilistic algorithm for preparing Bethe eigenstates of the spin-1/2 Heisenberg spin chain on a quantum computer has recently been found. We derive an exact formula for the success probability of this algorithm in terms of the Gaudin determinant, and we study its large-length limit. We demonstrate the feasibility of computing antiferromagnetic ground-state spin-spin correlation functions for short chains. However, the success probability decreases exponentially with the chain length, which precludes the computation of these correlation functions for chains of moderate length. Some conjectures for estimates of the Gaudin determinant are noted in an appendix.

15 pages; v2: result for XXZ added; v3: references added, to appear in J. Phys. A

References in corpus (3)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• Preparing Bethe Ansatz Eigenstates on a Quantum Computer
• Preparing exact eigenstates of the open XXZ chain on a quantum computer

Cited by in corpus (15)

• Algebraic Bethe Circuits
• Conserved charges in the quantum simulation of integrable spin chains
• The Bethe Ansatz as a Quantum Circuit
• Deterministic Bethe state preparation
• Qudit Dicke state preparation
• State preparation of AGP on a quantum computer without number projection
• Spin-s Dicke states and their preparation
• Symmetric quantum states: a review of recent progress
• Estimating Bethe roots with VQE
• Bethe Ansatz, Quantum Circuits, and the F-basis
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• Efficient Eigenstate Preparation in an Integrable Model with Hilbert Space Fragmentation
• Effective Bethe Ansatz for Spin-1 Non-integrable Models
• Quantum speed-up for solving the one-dimensional Hubbard model using quantum annealing
• Spin-$s$ $U(1)$-eigenstate preparation