Algebraic Bethe Circuits
- URL: http://arxiv.org/abs/2202.04673v4
- Date: Tue, 6 Sep 2022 09:29:31 GMT
- Title: Algebraic Bethe Circuits
- Authors: Alejandro Sopena, Max Hunter Gordon, Diego Garc\'ia-Mart\'in, Germ\'an
Sierra, Esperanza L\'opez
- Abstract summary: We bring the Algebraic Bethe Ansatz (ABA) into unitary form, for its direct implementation on a quantum computer.
Our algorithm is deterministic and works for both real and complex roots of the Bethe equations.
We derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.
- Score: 58.720142291102135
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The Algebraic Bethe Ansatz (ABA) is a highly successful analytical method
used to exactly solve several physical models in both statistical mechanics and
condensed-matter physics. Here we bring the ABA into unitary form, for its
direct implementation on a quantum computer. This is achieved by distilling the
non-unitary $R$ matrices that make up the ABA into unitaries using the QR
decomposition. Our algorithm is deterministic and works for both real and
complex roots of the Bethe equations. We illustrate our method on the
spin-$\frac{1}{2}$ XX and XXZ models. We show that using this approach one can
efficiently prepare eigenstates of the XX model on a quantum computer with
quantum resources that match previous state-of-the-art approaches. We run
small-scale error-mitigated implementations on the IBM quantum computers,
including the preparation of the ground state for the XX and XXZ models on $4$
sites. Finally, we derive a new form of the Yang-Baxter equation using unitary
matrices, and also verify it on a quantum computer.
Related papers
- Bethe Ansatz, Quantum Circuits, and the F-basis [40.02298833349518]
deterministic quantum algorithms, referred to as "algebraic Bethe circuits", have been developed to prepare Bethe states for the spin-1/2 XXZ model.
We show that algebraic Bethe circuits can be derived by a change of basis in the auxiliary space.
We demonstrate our approach by presenting new quantum circuits for the inhomogeneous spin-1/2 XXZ model.
arXiv Detail & Related papers (2024-11-04T19:01:41Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Solving the Schrodinger equation with genetic algorithms: a practical
approach [0.0]
The Schrodinger equation is one of the most important equations in physics and chemistry.
It can be solved in the simplest cases by computer numerical methods.
arXiv Detail & Related papers (2022-10-27T18:48:07Z) - Predicting Gibbs-State Expectation Values with Pure Thermal Shadows [1.4050836886292868]
We propose a quantum algorithm that can predict $M$ linear functions of an arbitrary Gibbs state with only $mathcalO(logM)$ experimental measurements.
We show that the algorithm can be successfully employed as a subroutine for training an eight-qubit fully connected quantum Boltzmann machine.
arXiv Detail & Related papers (2022-06-10T18:00:08Z) - Probabilistic imaginary-time evolution by using forward and backward
real-time evolution with a single ancilla: first-quantized eigensolver of
quantum chemistry for ground states [0.0]
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system.
We propose a new approach of PITE which requires only a single ancillary qubit.
We discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost.
arXiv Detail & Related papers (2021-11-24T12:54:27Z) - QUBO formulations for numerical quantum computing [0.0]
Harrow-Hassidim-Lloyd algorithm is a monumental quantum algorithm for solving linear systems on gate model quantum computers.
We will find unconstrained binary optimization (QUBO) models for a vector x that satisfies Ax=b.
We validate those QUBO models on the D-Wave system and discuss the results.
arXiv Detail & Related papers (2021-06-21T02:49:59Z) - Preparing Bethe Ansatz Eigenstates on a Quantum Computer [0.0]
We present a quantum algorithm for preparing Bethe ansatz eigenstates of the spin-1/2 XXZZ spin chain that correspond to real-valued solutions of the Bethe equations.
Although the algorithm is probabilistic, with a success rate that decreases with increasing eigenstate energy, we employ amplification to boost the success probability.
arXiv Detail & Related papers (2021-03-24T17:58:21Z) - Sampling electronic structure QUBOs with Ocean and Mukai solvers [44.62475518267084]
The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors.
To compensate for the reduced number of qubits, one has to rely on special software such as qbsolv.
We find that the Mukai QUBO solver outperforms the Ocean qbsolv for all calculations done in the present work.
arXiv Detail & Related papers (2021-02-01T23:16:42Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Simulation of Thermal Relaxation in Spin Chemistry Systems on a Quantum
Computer Using Inherent Qubit Decoherence [53.20999552522241]
We seek to take advantage of qubit decoherence as a resource in simulating the behavior of real world quantum systems.
We present three methods for implementing the thermal relaxation.
We find excellent agreement between our results, experimental data, and the theoretical prediction.
arXiv Detail & Related papers (2020-01-03T11:48:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.