Related papers: Hamiltonian gadgets with reduced resource requirem…
Quantum annealing has recently been used to determine the Ramsey numbers R(m,2) for 3 < m < 9 and R(3,3) [Bian et al. (2013) PRL 111, 130505]. This was greatly celebrated as the largest experimental implementation of an adiabatic evolution…
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.…
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
Characterizing noisy quantum devices requires methods for learning the underlying quantum Hamiltonian which governs their dynamics. Often, such methods compare measurements to simulations of candidate Hamiltonians, a task which requires…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
In this perspective we discuss verification of quantum devices in the context of specific examples, formulated as proposed experiments. Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input…
We apply the method of shortcuts to adiabaticity to nonequilibrium systems. For unitary dynamics, the system Hamiltonian is separated into two parts. One of them defines the adiabatic states for the state to follow and the nonadiabatic…
The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We present an alternative for quantum simulation of FHMs based on an…
We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success of improved lattice actions in classical simulations strongly suggests that Hamiltonians with improved…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…
Shortcuts to adiabaticity is a general method for speeding up adiabatic quantum protocols, and has many potential applications in quantum information processing. Unfortunately, analytically constructing shortcuts to adiabaticity for systems…
Recently, there has been growing interest in simulating time-dependent Hamiltonians using quantum algorithms, driven by diverse applications, such as quantum adiabatic computing. While techniques for simulating time-independent Hamiltonian…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
A $\textit{shortcut to adiabaticity}$ is a recipe for generating adiabatic evolution at an arbitrary pace. Shortcuts have been developed for quantum, classical and (most recently) stochastic dynamics. A shortcut might involve a…
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…