相关论文: Gradient of the Adiabatic Gauge Potential in Class…

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 show how the classical action, an adiabatic invariant, can be preserved under non-adiabatic conditions. Specifically, for a time-dependent Hamiltonian $H = p^2/2m + U(q,t)$ in one degree of freedom, and for an arbitrary choice of action…

A shortcut to adiabaticity is a driving protocol that reproduces in a short time the same final state that would result from an adiabatic, infinitely slow process. A powerful technique to engineer such shortcuts relies on the use of…

Let the adiabatic invariant of action variable in slow-fast Hamiltonian system with two degrees of freedom have two limiting values along the trajectories as time tends to infinity. The difference of two limits is exponentially small in…

Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…

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…

Transitionless quantum driving achieves adiabatic evolution in a hurry, using a counter-diabatic Hamiltonian to stifle non-adiabatic transitions. Here this strategy is cast in terms of a generator of adiabatic transport, leading to a…

We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…

The adiabatic motion of a charged, spinning, quantum particle in a two - dimensional magnetic field is studied. A suitable set of operators generalizing the cinematical momenta and the guiding center operators of a particle moving in a…

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…

While classical chaos is defined via a system's sensitive dependence on its initial conditions (SDIC), this notion does not directly extend to quantum systems. Instead, recent works have established defining both quantum and classical chaos…

In this paper, we present a U(1)-invariant expansion theory of the adiabatic process. As its application, we propose and discuss new sufficient adiabatic approximation conditions. In the new conditions, we find a new invariant quantity…

We introduce an adiabatic perturbation theory for quantum systems with degenerate energy spectra. This perturbative series enables one to rigorously establish conditions for the validity of the adiabatic theorem of quantum mechanics 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,…

Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…

The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…

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…

We study a quantized, discrete and drifting version of the Harper Hamiltonian, also called the finite almost Mathieu operator, which resembles the pendulum Hamiltonian but in phase space is confined to a torus. Spacing between pairs of…

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…

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…