相关论文: Limitations of some simple adiabatic quantum algor…

We present an extension of Adiabatic Quantum Computing (AQC) algorithm for the unstructured search to the case when the number of marked items is unknown. The algorithm maintains the optimal Grover speedup and includes a small counting…

We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a…

In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…

In this paper the evolution of a quantum system drived by a non-Hermitian Hamiltonian depending on slowly-changing parameters is studied by building an universal high-order adiabatic approximation(HOAA) method with Berry's phase ,which is…

The system undergoes adiabatic evolution when its population in the instantaneous eigenbasis of its time-dependent Hamiltonian changes only negligibly. Realization of such dynamics requires slow-enough changes of the parameters of the…

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…

Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming symmetric potentials, such as the well studied "spike" example. Due to the large amount of symmetry in these potentials such problems…

We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic…

Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases,…

Suppressing undesired nonunitary effects is a major challenge in quantum computation and quantum control. In this work, by considering the adiabatic dynamics in presence of a surrounding environment, we theoretically and experimentally…

We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers. The method integrates exact curvilinear kinetic energy operators and general-form potential energy surfaces expressed in a hybrid…

Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…

Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…

Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically…

In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based…

We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…

Several previous works have investigated the circumstances under which quantum adiabatic optimization algorithms can tunnel out of local energy minima that trap simulated annealing or other classical local search algorithms. Here we…

We point out that, when an optimization problem has more than one solution, the quantum adiabatic algorithms (QAA) encounter topological obstructions leading to adiabatic spectral flows where spectral branches unavoidably traverse the…

We present the formulation of the problem of the coherent dynamics of quantum mechanical two-level systems in the adiabatic region in terms of the differential geometry of plane curves. We show that there is a natural plane curve…

Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as…