Related papers: Exponential optimization of adiabatic quantum-stat…
Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
We consider the problem of preparing thermal equilibrium states at finite temperature on quantum computers. Assuming thermalization, we show that states that are locally at thermal equilibrium can be prepared by evolving adiabatically an…
The preparation of thermal states of matter is a crucial task in quantum simulation. In this work, we prove that a recently introduced, efficiently implementable dissipative evolution thermalizes to the Gibbs state in time scaling…
Adiabatic evolution is a common strategy for manipulating quantum states and has been employed in diverse fields such as quantum simulation, computation and annealing. However, adiabatic evolution is inherently slow and therefore…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog…
The adiabatic theorem is an important concept in quantum mechanics, it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its Hamiltonian as it initially in. In…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of "typical"…
Background: Solving nuclear many-body problems with an ab initio approach is widely recognized as a computationally challenging problem. Quantum computers offer a promising path to address this challenge. There are urgent needs to develop…
We analyze the efficiency of protocols for adiabatic quantum state transfer assisted by an engineered reservoir. The target dynamics is a quantum trajectory in the Hilbert space and is a fixed point of a time-dependent master equation in…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size $n$. We use as an example the…
The preparation of non-trivial states is crucial to the study of quantum many-body physics. Such states can be prepared with adiabatic quantum algorithms, which are restricted by the minimum spectral gap along the path. In this letter, we…
We present an optimized adiabatic quantum schedule for unstructured search building on the original approach of Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. Our schedule adiabatically varies the Hamiltonian even more rapidly at the…