Related papers: Preparing Bethe Ansatz Eigenstates on a Quantum Co…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on…
The eigenfunctions and eigenvalues of the master-equation for zero range process on a ring are found exactly via the Bethe ansatz. The rates of particle exit from a site providing the Bethe ansatz applicability are shown to be expressed in…
With the off-diagonal Bethe ansatz method proposed recently by the present authors, we exactly diagonalize the $XXX$ spin chain with arbitrary boundary fields. By constructing a functional relation between the eigenvalues of the transfer…
A novel Bethe Ansatz scheme is proposed to calculate physical properties of quantum integrable systems without $U(1)$ symmetry. As an example, the anti-periodic XXZ spin chain, a typical correlated many-body system embedded in a topological…
Quantum process tomography has become increasingly critical as the need grows for robust verification and validation of candidate quantum processors. Here, we present an approach for efficient quantum process tomography that uses a…
The classical simulation of quantum systems typically requires exponential resources. Recently, the introduction of a machine learning-based wavefunction ansatz has led to the ability to solve the quantum many-body problem in regimes that…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
The exploration of neural network quantum states has become widespread in the studies of complicated quantum many-body systems. However, achieving high precision remains challenging due to the exponential growth of Hilbert space size and…
In these lectures the introduction to algebraic aspects of Bethe Ansatz is given. The applications to the seminal spin 1/2 XXX model is discussed in detail and the generalization to higher spin as well as XXZ and lattice Sine-Gordon model…
Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To-date, experimental demonstrations of algorithms such as…
We analyze the conditions for producing atomic number states in a one-dimensional optical box using the Bethe ansatz method. This approach provides a general framework, enabling the study of number state production over a wide range of…
The algebraic Bethe ansatz can be performed rather abstractly for whole classes of models sharing the same $R$-matrix, the only prerequisite being the existence of an appropriate pseudo vacuum state. Here we perform the algebraic Bethe…
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network representation of the ground state using a number of…
Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block…
Quantum metrology and sensing seek advantage in estimating an unknown parameter of some quantum state or channel, using entanglement such as spin squeezing produced by one-axis twists or other quantum resources. In particular, qubit phase…
Current quantum computers are limited in the number of qubits and coherence time, constraining the algorithms executable with sufficient fidelity. The variational quantum eigensolver (VQE) is an algorithm to find an approximate ground state…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process. QPT is a major quantum information processing tool, since it especially allows one to experimentally characterize the actual behavior of…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…