Related papers: Bethe states on a quantum computer: success probab…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
The implementation of the algebraic Bethe ansatz for the XXZ Heisenberg spin chain, of arbitrary spin-$s$, in the case, when both reflection matrices have the upper-triangular form is analyzed. The general form of the Bethe vectors is…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state…
For the preparation of high-dimensional functions on quantum computers, we introduce tensor network algorithms that are efficient with regard to dimensionality, optimize circuits composed of hardware-native gates and take gate errors into…
We implement fully the algebraic Bethe ansatz for the XXX Heisenberg spin chain in the case when both boundary matrices can be brought to the upper-triangular form. We define the Bethe vectors which yield the strikingly simple expression…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…
We conjecture a new way to construct eigenstates of integrable XXX quantum spin chains with SU(N) symmetry. The states are built by repeatedly acting on the vacuum with a single operator Bgood(u) evaluated at the Bethe roots. Our proposal…
Form factors for local spin operators of the XXZ Heisenberg spin-1/2 finite chain are computed. Representation theory of Drinfel'd twists for the sl2 quantum affine algebra in finite dimensional modules is used to calculate scalar products…
We propose a new type of Monte Carlo approach in numerical studies of quantum systems. Introducing a probability function which determines whether a state in the vector space survives or not, we can evaluate expectation values of powers of…
Using algebraic Bethe ansatz and the solution of the quantum inverse scattering problem, we compute compact representations of the spin-spin correlation functions of the XXZ-1/2 Heisenberg chain in a magnetic field. At lattice distance m,…
Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science…
In using the Bayesian network (BN) to construct the complex multistate system's reliability model as described in Part I, the memory storage requirements of the node probability table (NPT) will exceed the random access memory (RAM) of the…
Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their groundspaces. More…
The estimation of small probabilities of failure from computer simulations is a classical problem in engineering, and the Subset Simulation algorithm proposed by Au & Beck (Prob. Eng. Mech., 2001) has become one of the most popular method…
Almost one century ago, string states - complex bound states (Wellenkomplexe) of magnetic excitations - have been predicted to exist in one-dimensional quantum magnets and since then become a subject of intensive theoretical study. However,…
The estimation of the guessing probability has paramount importance in quantum cryptographic processes. It can also be used as a witness for nonlocal correlations. In most of the studied scenarios, estimating the guessing probability…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
Photonic quantum computing has gained significant interest in recent years due to its potential for scaling to large numbers of qubits. A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian…
We analyze analytically and numerically quantum logic gates in a one-dimensional spin chain with Heisenberg interaction. Analytic solutions for basic one-qubit gates and swap gate are obtained for a quantum computer based on logical qubits.…