Related papers: Quadratic fermionic interactions yield effective H…
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…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
We show how to perform universal Hamiltonian and adiabatic computing using a time-independent Hamiltonian on a 2D grid describing a system of hopping particles which string together and interact to perform the computation. In this…
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is…
In many quantum technologies adiabatic processes are used for coherent quantum state operations, offering inherent robustness to errors in the control parameters. The main limitation is the long operation time resulting from the requirement…
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…
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…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
The notion of geometric phase has been recently introduced to analyze the quantum phase transitions of many-body systems from the geometrical perspective. In this work, we study the geometric phase of the ground state for an inhomogeneous…
Transporting quantum information is an important prerequisite for quantum computers. We study how this can be done in Heisenberg-coupled spin networks using adiabatic control over the coupling strengths. We find that qudits can be…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
The development of advanced quantum technologies and the quest for a deeper understanding of many-particle quantum mechanics requires control over the quantum state of interacting particles to a high degree of fidelity. However, the quickly…
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…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
We study the Hamiltonian associated with the quantum adiabatic algorithm with a random cost function. Because the cost function lacks structure we can prove results about the ground state. We find the ground state energy as the number of…
We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-,…
The energy gap is calculated for the ground state quantum computer circuit, which was recently proposed by Mizel et.al. When implementing a quantum algorithm by Hamiltonians containing only pairwise interaction, the inverse of energy gap…
A general quantum adiabatic theorem with and without the time-dependent orthogonalization is proven, which can be applied to understand the origin of activation energies in chemical reactions. Further proofs are also developed for the…