Related papers: Robust phase estimation of the ground-state energy…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and data science. While existing methods such as Variational…
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear systems…
We adapt the robust phase estimation algorithm to the evaluation of energy differences between two eigenstates using a quantum computer. This approach does not require controlled unitaries between auxiliary and system registers or even a…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…
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 present a superconducting circuit in which non-Abelian geometric transformations can be realized using an adiabatic parameter cycle. In contrast to previous proposals, we employ quantum evolution in the ground state. We propose an…
Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation (ASP). In the present work, we investigate a…
A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state…
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…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
We propose an experimental method for evaluating the adiabatic condition during quantum annealing (QA), which will be essential for solving practical problems. The adiabatic condition consists of the transition matrix element and the energy…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Estimating energy gaps, i.e. the energy difference between two different states, in quantum systems is crucial for understanding their properties. Conventionally, spectral gap estimation relies on independently computing the ground-state…
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…
The energy spectrum of Dicke Hamiltonians with and without the rotating wave approximation for arbitrary atom-number is obtained analytically with the variational method, in which the effective pseudo-spin Hamiltonian resulted from the…
Adiabatic quantum computation employs a slow change of a time-dependent control function (or functions) to interpolate between an initial and final Hamiltonian, which helps to keep the system in the instantaneous ground state. When the…
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular in the context of quantum chemistry, it is crucial to have energy…