Related papers: Bethe states on a quantum computer: success probab…
Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through…
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…
We derive exactly scalar products and form factors for integrable higher-spin XXZ chains through the algebraic Bethe-ansatz method. Here spin values are arbitrary and different spins can be mixed. We show the affine quantum-group symmetry,…
We consider a special correlation function in the isotropic spin-$\half$ Heisenberg antiferromagnet. It is the probability of finding a ferromagnetic string of (adjacent) spins in the antiferromagnetic ground state. We give two different…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg model. Using a massively parallel universal quantum computer…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a…
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…
This paper demonstrates that a computer aided perturbation theory can easily be realized by use of a cumulant approach. In contrast to a recent alternative formulation on the basis of Wegner's flow equation method the present approach can…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
Q-systems provide an efficient way of solving Bethe equations. We formulate here Q-systems for both the isotropic and anisotropic open Heisenberg quantum spin-1/2 chains with diagonal boundary magnetic fields. We check these Q-systems using…
We find an analytic solution of the Bethe Ansatz equations (BAE) for the special case of a finite XXZ spin chain with free boundary conditions and with a complex surface field which provides for $U_q(sl(2))$ symmetry of the Hamiltonian.…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
Quantum mechanics predicts a number of at first sight counterintuitive phenomena. It is therefore a question whether our intuition is the best way to find new experiments. Here we report the development of the computer algorithm Melvin…
In this note we construct Q-operators for the spin s open Heisenberg XXX chain with diagonal boundaries in the framework of the quantum inverse scattering method. Following the algebraic Bethe ansatz we diagonalise the introduced…
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We discuss the possibility for such transitions…
We calculate the ground-state two-spin correlation functions of spin-1/2 quantum Heisenberg chains with random exchange couplings using the real-space renormalization group scheme. We extend the conventional scheme to take account of the…
Quantum computers have the potential to solve certain interesting problems significantly faster than classical computers. To exploit the power of a quantum computation it is necessary to perform inter-qubit operations and generate entangled…