Related papers: Adiabatic quantum state preparation in integrable …
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve…
We present numerical calculations, and simulations performed on a Rydberg atom quantum simulator, of the adiabatic evolution of many-body quantum systems around a quantum phase transition. We demonstrate that the end-to-end transfer error,…
We construct an integrable Hubbard model with impurity site containing spin and charge degrees of freedom. The Bethe ansatz equations for the Hamiltonian are derived and two alternative sets of equations for the thermodynamical properties.…
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
Implementing holonomic quantum computation is a challenging task as it requires complicated interaction among multilevel systems. Here we propose to implement nonadiabatic holonomic quantum computation based on dressed-state qubits in…
Electronic excited states are central to a vast array of physical and chemical phenomena, yet accurate and efficient methods for preparing them on quantum devices remain challenging and comparatively underexplored. We introduce a general…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
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…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
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…
Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological…
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
The preparation and computation of many properties of quantum Gibbs states is essential for algorithms such as quantum semidefinite programming and quantum Boltzmann machines. We propose a quantum algorithm that can predict $M$ linear…
The efficient preparation of quantum states is an important step in the execution of many quantum algorithms. In the noisy intermediate-scale quantum (NISQ) computing era, this is a significant challenge given quantum resources are scarce…