Adiabatic quantum computation with effective Hamiltonians

Catherine C. McGeoch

H T Quan, W H Zurek

Adiabaticity of quantum evolution is important in many settings; one example is adiabatic quantum computation (AQC). Nevertheless, to date, there is no effective method available for testing the adiabaticity of the evolution for the case where the eigenenergies of the driven Hamiltonian are not known. We propose a simple method for checking the adiabaticity of a quantum process for an arbitrary quantum system. We further propose an operational method for finding more efficient protocols that approximate adiabaticity, and suggest a 'uniformly adiabatic' quench scheme based on the Kibble–Zurek mechanism for the case where the initial and final Hamiltonians are given. This method should help in implementing AQC and other tasks where preserving the system in the ground state of a time-dependent Hamiltonian is desired.

Man‐Hong Yung

The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the minimal energy gap. However, at finite temperatures, it might need to be fast enough to avoid thermal excitations. The question is, how fast does it need to be? The structure of evolution Hamiltonians for AQC is generally too complicated for answering this question. Here we model an adiabatic quantum computer as a (parametrically driven) harmonic oscillator. The advantages of this model are (1) it offers high flexibility for quantitative analysis on the thermal effect, (2) the results qualitatively agree with previous numerical calculation, and (3) it could be experimentally verified with quantum electronic circuits.

Ari Mizel

Ari Mizel

Qian-Heng Duan, Shuo Zhang, Wei Wu +1 more

The adiabatic quantum computation (AQC) has been proven to be equivalent to the standard circuit model. Conventionally, AQC evolves from the initial Hamiltonian which has a uniform equal superposition of the computational basis to the final Hamiltonian whose ground state encodes the solution to a computation problem. We propose an alternative approach to construct the initial Hamiltonian of the AQC which has an unequal superposition of the possible solutions to the problem and show that an educated guess can improve the performance of AQC.