Preparing Bethe Ansatz Eigenstates on a Quantum Computer

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.

arXiv comment14 pages, 9 figures

References in corpus (48)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum computational advantage using photons
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Quantum computational chemistry
• Simulated Quantum Computation of Molecular Energies
• Time-dependence of correlation functions following a quantum quench
• Hamiltonian Simulation by Qubitization
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Matrix product states represent ground states faithfully
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Generalized Gibbs ensemble in integrable lattice models
• Quench dynamics and relaxation in isolated integrable quantum spin chains
• Toward the first quantum simulation with quantum speedup
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Microscopic observation of magnon bound states and their dynamics
• QuSpin: a Python Package for Dynamics and Exact Diagonalisation of Quantum Many Body Systems part I: spin chains
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Simulating Physical Phenomena by Quantum Networks
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Solving strongly correlated electron models on a quantum computer
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Quantum circuits for strongly correlated quantum systems
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Efficient variational simulation of non-trivial quantum states
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Experimental Observation of Bethe Strings
• Exact Ising model simulation on a quantum computer
• Efficient quantum algorithms for $GHZ$ and $W$ states, and implementation on the IBM quantum computer
• Deterministic Preparation of Dicke States
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Applying quantum algorithms to constraint satisfaction problems
• Bound states and entanglement in the excited states of quantum spin chains
• Thermal form-factor approach to dynamical correlation functions of integrable lattice models
• Numerical Contraction of the Tensor Network generated by the Algebraic Bethe Ansatz
• The Algebraic Bethe Ansatz and Tensor Networks
• Deterministic Local Expansion of W States
• Dominant fifth-order correlations in doped quantum anti-ferromagnets
• Kitaev honeycomb tensor networks: exact unitary circuits and applications
• A thermal form factor series for the longitudinal two-point function of the Heisenberg-Ising chain in the antiferromagnetic massive regime
• The nested Algebraic Bethe Ansatz for the supersymmetric t-J and Tensor Networks
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• Edge Modes in One Dimensional Topological Charge Conserving Spin-Triplet Superconductors: Exact Results from Bethe Ansatz
• Benchmarking near-term quantum devices with the Variational Quantum Eigensolver and the Lipkin-Meshkov-Glick model

Cited by in corpus (13)

• Algebraic Bethe Circuits
• Preparing exact eigenstates of the open XXZ chain on a quantum computer
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Conserved charges in the quantum simulation of integrable spin chains
• Bethe states on a quantum computer: success probability and correlation functions
• Improved variational quantum eigensolver via quasi-dynamical evolution
• Assessment of the variational quantum eigensolver: application to the Heisenberg model
• Benchmarking near-term quantum devices with the Variational Quantum Eigensolver and the Lipkin-Meshkov-Glick model
• State preparation of AGP on a quantum computer without number projection
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
• Entanglement at the interplay between single- and many-bodyness
• Majorana fermions solve the tetrahedron equations as well as higher simplex equations
• Fractal decompositions and tensor network representations of Bethe wavefunctions