Related papers: Bethe states on a quantum computer: success probab…
In this work, we construct an alternative formulation to the traditional Algebraic Bethe ansatz for quantum integrable models derived from a generalised rational Gaudin algebra realised in terms of a collection of spins 1/2 coupled to a…
A Bethe Ansatz solution of the open spin-1/2 XXZ quantum spin chain with nondiagonal boundary terms has recently been proposed. Using a numerical procedure developed by McCoy et al., we find significant evidence that this solution can yield…
The magnon Hedin's equations are derived via the Schwinger functional derivative technique, and the resulting self-consistent Green's function method is used to calculate ground state spin patterns and magnetic structure factors for…
For the precise estimation of the unknown quantum state, the independent samples should be prepared. Can we reduce the error of the estimation by the measurement using the quantum correlation between every sample? In this paper, this…
A new exactly solvable one-dimensional spin-3/2 Heisenberg model with SO(5)-invariance is proposed. The eigenvalues and Bethe ansatz equations of the model are obtained by using the nested algebraic Bethe ansatz approach. Several exotic…
As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial…
We introduce the notion of $su(2)$ spin-$s$ Dicke states, which are higher-spin generalizations of usual (spin-1/2) Dicke states. These multi-qudit states can be expressed as superpositions of $su(2s+1)$ qudit Dicke states. They satisfy a…
We study the implications of the regularization for the singular solutions on the even(odd) length spin-1/2 XXX chains in some specific down-spin sectors. In particular, the analytic expressions of the Bethe eigenstates for three down-spin…
Unstructured search remains as one of the significant challenges in computer science, as classical search algorithms become increasingly impractical for large-scale systems due to their linear time complexity. Quantum algorithms, notably…
A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers - and even early fault-tolerant quantum…
We give explicit formulas of the Bethe approximation with multipoint correlations for systems with magnetic field. The obtained formulas include the closed form of the magnetization and the correlations between adjacent degrees of freedom.…
We examine the question of whether Bethe's ansatz reproduces all states in the periodic Heisenberg XXZ and XXX spin chains. As was known to Bethe himself, there are states for which the Bethe momenta $k_n$ diverge: these are in fact the…
We show how nanostructuring of a metallic gate on a field-effect transistor (FET) can lead to a macroscopic, robust and voltage controlled quantum state in the electron channel of a FET. A chain of triple quantum dot molecules created by…
We propose a new class of quantum computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of Decision Theory and…
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed…
We demonstrate that the concept of quantum typicality allows for significant progress in the study of real-time spin dynamics and transport in quantum magnets. To this end, we present a numerical analysis of the spin-current autocorrelation…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…
For the integrable higher-spin XXX and XXZ spin chains we present multiple-integral representations for the correlation function of an arbitrary product of Hermitian elementary matrices in the massless ground state. We give a formula…
Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla…
We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems, which require far-fewer qubits than the number of spins being simulated. The algorithms…