Modeling an adiabatic quantum computer

Abstract

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 CNOT gate simulation. For a general class of Hamiltonians we show that the escape probability from the initial state scales no faster than |λ|γ, where |λ| is the adiabaticity parameter. The scaling exponent for the escape probability is γ = 1/2 for all levels, except the edge (bottom and top) ones, where γ <~1/3. In principle, our method can solve arbitrarily large adiabatic quantum Hamiltonians.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…