We introduce protocols to prepare many-body quantum states with quantum circuits assisted
by local operations and classical communication. We show that by lifting the requirement of …

Compared to general quantum states, the sparse states arise more frequently in the field of
quantum computation. In this work we consider the preparation for n-qubit sparse quantum …

We present a quantum circuit that prepares an arbitrary $ U (1) $-invariant state on a
quantum computer, including the exact eigenstates of the spin-1/2 XXZ quantum spin chain …

We consider the preparation of all the eigenstates of spin chains using quantum circuits. It is
known that generic eigenstates of free-fermionic spin chains can be prepared with circuits …

Quantum-integrable models are distinguished many-body systems in one dimension that
possess a tower of commuting conserved charges [1]. The Bethe Ansatz is a method to solve …

We investigate the entanglement structure of a generic $ M $-particle Bethe wavefunction
(not necessarily an eigenstate of an integrable model) on a 1d lattice by dividing the lattice …

Ground state preparation is a key area where quantum computers are expected to prove
advantageous. Double-bracket quantum algorithms (DBQAs) have been recently proposed …

We design two variational algorithms to optimize specific 2-local Hamiltonians defined on
graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm …

Bethe equations, whose solutions determine exact eigenvalues and eigenstates of
corresponding integrable Hamiltonians, are generally hard to solve. We implement a …

Ground state preparation is a key area where quantum computers are expected to prove
advantageous. Double-bracket quantum algorithms (DBQAs) have been recently proposed …