相关论文: Condition for the adiabatic approximation

We discuss a toy model for adiabatic quantum computation which displays some phenomenological properties expected in more realistic implementations. This model has two free parameters: the adiabatic evolution parameter $s$ and the $\alpha$…

We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…

Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum…

The adiabatic approximation in open systems is formulated through the effective Hamiltonian approach. By introducing an ancilla, we embed the open system dynamics into a non-Hermitian quantum dynamics of a composite system, the adiabatic…

This paper deals with the concept of adiabaticity for fully quantum mechanically cavity QED models. The physically interesting cases of Gaussian and standing wave shapes of the cavity mode are considered. An analytical approximate measure…

Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…

We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…

We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…

The adiabatic theorem is a fundamental result established in the early days of quantum mechanics, which states that a system can be kept arbitrarily close to the instantaneous ground state of its Hamiltonian if the latter varies in time…

Quantum adiabaticity is the evolution of a quantum system that remains close to an instantaneous eigenstate of a time-dependent Hamiltonian. Using Floquet formalism, we derive a rigorous sufficient condition for adiabaticity in closed,…

It has been recently reported that classical systems have speed limit for state evolution, although such a concept of speed limit had been considered to be unique to quantum systems. Owing to the speed limit for classical system, the lower…

Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…

Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…

We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.

Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires…

A proof of the adiabatic theorem for quantum systems whose time evolution proceeds along discrete time, e.g., quantum maps and quantum circuits, is shown.

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we…

The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…

The smallness of the variation rate of the hamiltonian matrix elements compared to the (square of the) energy spectrum gap is usually believed to be the key parameter for a quantum adiabatic evolution. However it is only perturbatively…