Preparing Bethe Ansatz Eigenstates on a Quantum Computer
- URL: http://arxiv.org/abs/2103.13388v3
- Date: Wed, 24 Nov 2021 14:10:24 GMT
- Title: Preparing Bethe Ansatz Eigenstates on a Quantum Computer
- Authors: John S. Van Dyke and George S. Barron and Nicholas J. Mayhall and
Edwin Barnes and Sophia E. Economou
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Dissipative variational quantum algorithms for Gibbs state preparation [0.0]
We introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and gates, as an intrinsic part of a variational quantum circuit.
We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and non-coherent noise.
arXiv Detail & Related papers (2024-07-12T18:48:46Z) - Applicability of Measurement-based Quantum Computation towards
Physically-driven Variational Quantum Eigensolver [18.876952671920137]
Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages.
The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost.
We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
arXiv Detail & Related papers (2023-07-19T08:07:53Z) - Quantum Conformal Prediction for Reliable Uncertainty Quantification in
Quantum Machine Learning [47.991114317813555]
Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots.
This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
arXiv Detail & Related papers (2023-04-06T22:05:21Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Variational determination of arbitrarily many eigenpairs in one quantum
circuit [8.118991737495524]
A variational quantum eigensolver (VQE) was first introduced for computing ground states.
We propose a new algorithm to determine many low energy eigenstates simultaneously.
Our algorithm reduces significantly the complexity of circuits and the readout errors.
arXiv Detail & Related papers (2022-06-22T13:01:37Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Quantum algorithms for estimating quantum entropies [6.211541620389987]
We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state.
We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
arXiv Detail & Related papers (2022-03-04T15:44:24Z) - Quantum amplitude damping for solving homogeneous linear differential
equations: A noninterferometric algorithm [0.0]
This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs.
We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
arXiv Detail & Related papers (2021-11-10T11:25:32Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - On exploring practical potentials of quantum auto-encoder with
advantages [92.19792304214303]
Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics.
We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state.
We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z)
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.