Preparing exact eigenstates of the open XXZ chain on a quantum computer
- URL: http://arxiv.org/abs/2109.05607v2
- Date: Thu, 23 Dec 2021 19:20:32 GMT
- Title: Preparing exact eigenstates of the open XXZ chain on a quantum computer
- Authors: John S. Van Dyke, Edwin Barnes, Sophia E. Economou, Rafael I.
Nepomechie
- Abstract summary: We formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations.
The algorithm is probabilistic, with a success probability that decreases with the number of down spins.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is
the paradigmatic example of a quantum integrable model with open boundary
conditions. We formulate a quantum algorithm for preparing Bethe states of this
model, corresponding to real solutions of the Bethe equations. The algorithm is
probabilistic, with a success probability that decreases with the number of
down spins. For a Bethe state of $L$ spins with $M$ down spins, which contains
a total of $\binom{L}{M}\, 2^{M}\, M!$ terms, the algorithm requires $L+M^2+2M$
qubits.
Related papers
- Deterministic Bethe state preparation [0.0]
We present an explicit quantum circuit that prepares an arbitrary $U(1)$-eigenstate on a quantum computer.
The algorithm is deterministic, does not require ancillary qubits, and does not require QR decompositions.
arXiv Detail & Related papers (2024-03-05T19:31:25Z) - The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$.
In particular, we design global protocols for small set expansion, unique games, and PCP verification.
We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
arXiv Detail & Related papers (2024-02-29T01:35:46Z) - The classical limit of Quantum Max-Cut [0.18416014644193066]
We show that the limit of large quantum spin $S$ should be understood as a semiclassical limit.
We present two families of classical approximation algorithms for $mathrmQMaxCut_S$ based on rounding the output of a semidefinite program to a product of Bloch coherent states.
arXiv Detail & Related papers (2024-01-23T18:53:34Z) - 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) - A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria.
This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
arXiv Detail & Related papers (2023-11-17T20:38:38Z) - Approximation Algorithms for Quantum Max-$d$-Cut [42.248442410060946]
The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions.
We develop an algorithm that finds product-state solutions of mixed states with bounded purity that achieve non-trivial performance guarantees.
arXiv Detail & Related papers (2023-09-19T22:53:17Z) - Quantum Metropolis-Hastings algorithm with the target distribution
calculated by quantum Monte Carlo integration [0.0]
Quantum algorithms for MCMC have been proposed, yielding the quadratic speedup with respect to the spectral gap $Delta$ compered to classical counterparts.
We consider not only state generation but also finding a credible interval for a parameter, a common task in Bayesian inference.
In the proposed method for credible interval calculation, the number of queries to the quantum circuit to compute $ell$ scales on $Delta$, the required accuracy $epsilon$ and the standard deviation $sigma$ of $ell$ as $tildeO(sigma/epsilon
arXiv Detail & Related papers (2023-03-10T01:05:16Z) - 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) - Quantum Approximate Counting for Markov Chains and Application to
Collision Counting [0.0]
We show how to generalize the quantum approximate counting technique developed by Brassard, Hoyer and Tapp [ICALP 1998] to estimating the number of marked states of a Markov chain.
This makes it possible to construct quantum approximate counting algorithms from quantum search algorithms based on the powerful "quantum walk based search" framework established by Magniez, Nayak, Roland and Santha.
arXiv Detail & Related papers (2022-04-06T03:04:42Z) - Algebraic Bethe Circuits [58.720142291102135]
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.
arXiv Detail & Related papers (2022-02-09T19:00:21Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
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.