Related papers: Adiabatic ground state preparation in an expanding…
Quantum simulation of many-body systems are one of the most interesting tasks of quantum technology. Among them is the preparation of a many-body system in its ground state when the vanishing energy gap makes the cooling mechanisms…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…
Dissipative state engineering is a general term for a protocol which prepares the ground state of a complex many-body Hamiltonian using engineered dissipation or engineered environments. Recently, it was shown that a version of this…
Efficient quantum state preparation remains a central challenge in first-principles quantum simulations of dynamics in quantum field theories, where the Hilbert space is intrinsically infinite-dimensional. Here, we introduce a large…
Adiabatic protocols are often employed in state preparation schemes but require the system to be driven by a slowly varying Hamiltonian so that transitions between instantaneous eigenstates are exponentially suppressed. Counterdiabatic…
Motivated by recent progress of quantum technologies, we study a discretized quantum adiabatic process for a one-dimensional free fermion system described by a variational wave function, i.e., a parametrized quantum circuit. The wave…
We describe a lattice of asymmetrical qubit pairs in one or two dimensions, with couplings arranged so that the motion of single-qubit excited states mimics the behavior of charged lattice bosons hopping in a magnetic field. We show in…
We introduce a generic method for computing groundstates that is applicable to a wide range of spatially anisotropic 2D many-body quantum systems. By representing the 2D system using a low-energy 1D basis set, we obtain an effective 1D…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
A new numerical method is proposed for determining the low-frequency dynamics of the charge carrier coupled to the deformable quantum lattice. As an example, the polaron band structure is calculated for the one-dimensional Holstein model.…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…
Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a…
Finding a local Hamiltonian $\hat{\mathcal{H}}$ having a given many-body wavefunction $|\psi\rangle$ as its ground state, i.e. a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. Here we introduce a…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
We discuss an algorithm for the approximate solution of Schrodinger's equation for lattice gauge theory, using lattice SU(3) as an example. A basis is generated by repeatedly applying an effective Hamiltonian to a ``starting state.'' The…