DeepAI AI Chat
Log In Sign Up

Quantum Adiabatic Theorem Revisited

by   Runyao Duan, et al.
Baidu, Inc.

In 2004 Ambainis and Regev formulated a certain form of quantum adiabatic theorem and provided an elementary proof which is especially accessible to computer scientists. Their result is achieved by discretizing the total adiabatic evolution into a sequence of unitary transformations acting on the quantum system. Here we continue this line of study by providing another elementary and shorter proof with improved bounds. Our key finding is a succinct integral representation of the difference between the target and the actual states, which yields an accurate estimation of the approximation error. Our proof can be regarded as a "continuous" version of the work by Ambainis and Regev. As applications, we show how to adiabatically prepare an arbitrary qubit state from an initial state.


page 1

page 2

page 3

page 4


Bernstein approximation and beyond: proofs by means of elementary probability theory

Bernstein polynomials provide a constructive proof for the Weierstrass a...

A Simple Proof of PreciseQMA = PSPACE

We give an alternative proof of PreciseQMA = PSPACE, first proved by Fef...

A structured proof of the Kolmogorov superposition theorem

We present a well-structured detailed exposition of a well-known proof o...

Quantum Lightning Never Strikes the Same State Twice

Public key quantum money can be seen as a version of the quantum no-clon...

Commitments to Quantum States

What does it mean to commit to a quantum state? In this work, we propose...

Diagrammatic security proof for 8-state encoding

Dirac notation is the most common way to describe quantum states and ope...

A Unified Framework of Elementary Geometric Transformation Representation

As an extension of projective homology, stereohomology is proposed via a...