Related papers: Simulating quantum circuits by adiabatic computati…

Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard…

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…

We prove an adiabatic theorem for the ground state of the Dicke model in a slowly rotating magnetic field and show that for weak electron-photon coupling, the adiabatic time scale is close to the time scale of the corresponding two level…

The boundary cancellation theorem for open systems extends the standard quantum adiabatic theorem: assuming the gap of the Liouvillian does not vanish, the distance between a state prepared by a boundary cancelling adiabatic protocol and…

A new simple proof of the adiabatic theorem is given in the finite dimensional case for nondegenerate as well as degenerate states. The explicitly integrable two level system is considered as an example. It is demonstrated that the error…

We establish adiabatic theorems with and without spectral gap condition for general operators $A(t): D(A(t)) \subset X \to X$ with possibly time-dependent domains in a Banach space $X$. We first prove adiabatic theorems with uniform and…

Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…

We establish a connection between quantum mechanics and computation, revealing fundamental limitations for algorithms computing spectra, especially in non-Hermitian settings. Introducing the concept of locally trivial pseudospectra (LTP),…

The quantum adiabatic algorithm is a Hamiltonian based quantum algorithm designed to find the minimum of a classical cost function whose domain has size N. We show that poor choices for the Hamiltonian can guarantee that the algorithm will…

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…

Feedback in compound quantum systems is effected by using the output from one sub-system (``the system'') to control the evolution of a second sub-system (``the ancilla'') which is reversibly coupled to the system. In the limit where the…

We prove the validity of linear response theory at zero temperature for perturbations of gapped Hamiltonians describing interacting fermions on a lattice. As an essential innovation, our result requires the spectral gap assumption only for…

Adiabaticity occurs when, during its evolution, a physical system remains in the instantaneous eigenstate of the hamiltonian. Unfortunately, existing results, such as the quantum adiabatic theorem based on a slow down evolution (H(epsilon…

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…

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…

Adiabatic transformation can be approximated as alternating unitary operators of a Hamiltonian and its parameter derivative as proposed in a gate-based approach to counterdiabatic driving (van Vreumingen, arXiv:2406.08064). In this paper,…

We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a construction that uses a 2-local…

A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…

We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…

We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest…