Related papers: Bethe states on a quantum computer: success probab…
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
Many hard combinatorial problems can be mapped onto Ising models, which replicate the behavior of classical spins. Recent advances in probabilistic computers are characterized by parallelization and the introduction of novel hardware…
Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term. While this approach reduces the number of qubits and operations required from the quantum…
The algebraic Bethe Ansatz is a prosperous and well-established method for solving one-dimensional quantum models exactly. The solution of the complex eigenvalue problem is thereby reduced to the solution of a set of algebraic equations.…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising…
We show that efficient quantum computation is possible using a disordered Heisenberg spin-chain with `always-on' couplings. Such disorder occurs naturally in nanofabricated systems. Considering a simple chain setup, we show that an…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
We investigate the quantum Jaynes-Cummings model - a particular case of the Gaudin model with one of the spins being infinite. Starting from the Bethe equations we derive Baxter's equation and from it a closed set of equations for the…
B\'ezier simplex fitting algorithms have been recently proposed to approximate the Pareto set/front of multi-objective continuous optimization problems. These new methods have shown to be successful at approximating various shapes of Pareto…
We exactly solve the ferromagnetic spin-1/2 Ising model on the Bethe lattice in the presence of an external magnetic field by means of the equations of motion method within the Green's function formalism. In particular, such an approach is…
Spin precession is a textbook example of dynamics of a quantum system that exactly mimics its classical counterpart. Here we challenge this view by certifying the quantumness of exotic states of a nuclear spin through its uniform…
By combining classical Monte Carlo and Bethe ansatz techniques we devise a numerical method to construct the Truncated Generalized Gibbs Ensemble (TGGE) for the spin-1/2 isotropic Heisenberg ($XXX$) chain. The key idea is to sample the…
The preparation and computation of many properties of quantum Gibbs states is essential for algorithms such as quantum semidefinite programming and quantum Boltzmann machines. We propose a quantum algorithm that can predict $M$ linear…
We calculate partition function and correlation functions in A-twisted 2d $\mathcal{N}=(2,2)$ theories and topologically twisted 3d $\mathcal{N}=2$ theories containing adjoint chiral multiplet with particular choices of $R$-charges and the…
Preparing the ground state of a local Hamiltonian is a crucial problem in understanding quantum many-body systems, with applications in a variety of physics fields and connections to combinatorial optimization. While various quantum…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
Quantum simulation of complex quantum systems and their properties often requires the ability to prepare initial states in an eigenstate of the Hamiltonian to be simulated. In addition, to compute the eigenvalues of a Hamiltonian is in…
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows…
In this paper, we show the integrability of spin-1/2 XXZ Heisenberg chain with two arbitrary spin boundary Impurities. By using the fusion method, we generalize it to the spin-1 XXZ chain. Then the eigenvalues of Hamiltonians of these…