Adiabatic Quantum Computation

Dorit Aharonov
Hebrew Univ. & UC Berkeley

1
 Ground State Solutions

 Which  spin distribution

 minimizes the number of

red edges with similar spins

and green edges with
 opposite spins?

 (1 violation.)

1) A combinatorial minimization problem.

2) A lowest energy question for magnetic materials.

The ground state of the magnet is the solution to

our optimization problem. 2
Properties of Adiabatic Computation
• Language of Hamiltonians.

• New approach to designing quantum

algorithms

• Equivalent in power to quantum ckts.

• Natural fault-tolerance properties

3
 The Conventional Model of
Quantum Computers
|  ( L)  U LU L 1    U1 |  (0)

U1

….
U
Output:
4
Input
U
|  (0) | 011 ...10 measure
3

U5
U2

Quantum Computing of “Classical” functions

“Quantum states”
4
 Ground States

Schrodinger’s Equation:
d | ( t )
i dt  H (t ) |  (t )

The Hamiltonian (A Hermitian Matrix) H (t )   H k ,l (t )

k ,l

Eigenvectors (eigenstates) | j
Eigenvalues (Energies) Ej

Ground state: Eigenvector with lowest eigenvalue

5
 Classical Optimization
in terms of
Quantum states
Given: f: {0,1}n N, f(x) for x=x1,…..xn,
Objective: find xmin which minimizes f
 f ( x000 ) 
 . 
 
H  . 
 
 . 
 f ( x111 )
| x are the eigenvectors
f(x) are the eigenvalues
The answer = state with minimal eigenvalue
6
 Special Quantum States [AharonovTa-Shma’02]

1. Graph Isomorphism 2. Closest Lattice Vector

v v2
v1

1
n!

 |  (G )
S n
7
As well as Factoring, Discrete Log… [A’TaShma’02]
 Apply a Hamiltonian with the desired
ground state
AND….

?
Adiabatic Computation
A method to help the system reach
a desired groundstate

8
 Adiabatic Evolution
d | ( t )
i dt  H (t ) |  (t )

Adiabatic theorem: [BornFock ’28, Kato ’51]

H(0) H(T)
|  (0) Ground state of H(0) |  (T )ground state of H(T)

T  1
min s { ( t )}2
 (t )  E1 (t )  E0 (t )
9
 Adiabatic Systems as Computation Devices
H ( s )  (1  s ) H 0  sH T
HT
H0
|  ( 0) |  (T )
Input Output
Algorithm:
• HT Hamiltonian with ground state |(T)i
• H0 Hamiltonian with known ground state |(0)I
• Slowly transform H0 into HT

i.e.  ( s ) 
1 10
Efficient: T< n c
nc
 Remark 1: Non Negligible Spectral Gaps

Physics: Periodic Hamiltonians, n∞

γ > const or γ0
Adiabatic computation:
Tailored Hamiltonians , n∞
The interesting line is  ( s ) 
1
poly ( n )

Allow it to go to zero if sufficiently slowly.

11
Remark 2: Connection to Simulated Annealing
d | ( t )
i dt  H (t ) |  (t )
HT
H0
|  ( 0) |  (T )

Adiabatic Rapidly mixing

Computation Markov Chains
Hamiltonian  Transition rate matrix
Groundstate  Limiting Distribution
Spectral gap  Spectral gap for rapid mixing

Quantum Simulated Annealing

12
 Remark 3:
Adiabatic Optimization [FGGS’00]

Adiabatic Computation [ADKLLR’03]

H T   f ( x) | x x | H  H T i, j
x{0 ,1}n i, j

Diagonal HT General Local HT

Final state is a basis state Final state is

the groundstate
of a local Hamiltonian
Without increasing the physical resources:

13
 A Natural Model of Computation

Adiabatic Computation
The set of computations that can be performed by
Quantum systems, evolving adiabatically under the
action local Hamiltonians with non negligible
spectral gaps.

What is the What are the

computational power of possible dynamics of
Adiabatic Computers Adiabatic systems

? ?
14
 Overview
1 Adiabatic Computation

2 Previous Results Adiabatic Optimization

3 Main Result:
Adiabatic Computers Can perform any
Quantum Computation

4 Adding Geometry: True even if the adiabatic computation

is on 2 dim grid, nearest neighbor interactions

Implications and Open Questions

15
 2.
Examples:
Adiabatic Optimization

16
 Adiabatic Algorithms for Optimization
[FarhiGoldstoneGutmanSipser’00].

Given: f: {0,1}n N, f(x) for x=x1,…..xn,

Objective: find xmin which minimizes f

|  (T ) | xmin HT   f ( x) | x x|
x{0 ,1}n

F ( x1...xn )  ( x1  x2  x3 )  ( x2  x4  x7 )  ...
f(x) is number of unsatisfied clauses

H (T )  H
Clauses c
c   |0001, 2 , 3   |101 2 , 4 , 7  ....

Energy Penalty: Project on Unsatisfying values of

17 x
Adiabatic Algorithms for Optimization (Cont’d)
[FarhiGoldstoneGutmanSipser’00].

|  (T ) | xmin HT   f ( x) | x x|
x{0 ,1}n
|0 |1 |0 |1 |0 |1
|  (0)    .....  n
2 2 2 H 0   ( |02|1 )(  0|2 1| ) j
HT j 1
H ( s )  (1  s ) H 0  sH T
H0
 (s)  1
poly ( n ) ?
• 20 bits: promising simulation [Farhi et al.’00,’01…]
• Mounting evidence that γ(s) is exponentially small in worst case
[vanDamVazirani’01, Reichhardt’03].
• Quadratic speed up: Adiabatic algorithm to solve NP in √2n. Classical NP
18
algorithm: 2 [RolandCerf’01,vanDamMoscaVazirani’01]
n
 Tunneling:
Simulated Annealing vs Adiabatic Optimization
[FGGRV’03]
E(x) E(x)

w(x) w(x)
0 n 0
E ( x)  w( x)  Number of 1' s | (T ) | x | 0  | 0  .... | 0 n
min
xmin  00 ....0 n

n
H  | 11 | T  j
Adiabatic optimization is |0 |1 |0 |1
j 1
|0 |1
Exponentially faster than |  ( 0)  2
 2
 .....  2
simulated annealing!
n
H 0   ( |0|1 )(  0|1| ) j 19
But finding 0 is easy…. j 1
2 2
 3.
How to Implement any Quantum
Algorithm
Adiabatically

20
 Result [A’TaShma’02,A’02,A’vanDamKempeLandauLloydRegev’03]

Sp All of Quantum Computation can be done

ect adiabatically! e s
Eig r a g at
ens l gap n itar y
tat s, U
es Condensed matter &
Mathematical Physics

Implication for Quantum computation:

Equivalence: New Language, new tools !
New vantage point to tackle the challenges of quantum computation:
1. Designing new algorithms: change of langauge, new tools.
2. Adiabatic Computation is resilient to certain types of errors
[ChildsFarhiPreskill’01]  Possible applications for
fault tolerance. (2-dim architecture)
Implications for Physics:
Understanding ground states, Adiabatic Dynamics from
21
an information perspective.
 What’s the Problem?
H(T)
….
U5 H(0)
U4
U3 U2
U1
Want to construct
adiabatic computation
U1 ,  , U L Local unitary gates
with γ(t)>1/Lc from
|  ( L)  U L    U1 | 0110...1 which we can deduce
the answer.
First try: Make |  ( L) the ground state of H(T).
Problem: To specify such a Hamiltonian
we need to know |  ( L) ! 22
 Key Idea
Kitaev’99, based on Feynman:
|  (k )
Time
steps :
|  (1)
|  (0)
Classical computation:
Correct History can be
checked locally.

Instead of |  ( L) , use a local Hamiltonian H(T)

whose ground state is the History.
23
 Key Idea
Kitaev’99, based on Feynman:
Time
steps
L
| history   1
L 1  |  (k )
k 0
| k
Classical computation:
Correct History can be | k | 11  ..0
 ..100
checked locally. k L k

Instead of |  ( L) , use a local Hamiltonian H(T)

whose ground state is the History.
24
 The Hamiltonian H(s)
L
HT: |  (T )  1
L 1  |  (k )  | k 
k 0
L

● Test correct HT  1
2 H
k 0
k

propagation:
Energy penalty
Hk  I  | k  k |  I  | k  1 k  1 |
 U k  | k  k  1 |  U k  | k  1 k |
Local interaction: | k  k  1 |  | 110100 |k 1,k ,k 1

H0: |  (0) |  (0) | 0..0 | 01..0 | 0..0

n L
● Test that input is 0 H 0   | 11 | j | 0 0 |1  | 1251 |k
 4.
Adding Geometry:
Adiabatic
Adiabatic Computation
Computation
on a
Two-D Lattice

26
 Particles on a 2-d Lattice
Wanted:
Evolution of the form |  (k ) | k , k  0,..., L
Problem:
Not enough interaction between clock and computer
to have terms like: H k  I  | k  k |  I  | k  1 k  1 |
Solution:  U k  | k  k  1 |  U k  | k  1 k |
Relax notion of computation/clock particles.
Each particle will have both types of degrees of freedom.
States will no longer be tensor products but will encode
time in their geometric shape.

To do this we use a like evolution.

27
 The 2-Dim Lattice Construction
Six states particles:
0 0

1 1

Unborn First Phase Second Phase Dead

* * * * * *

* * *

** ** ** * * * R
* * * * * *

0* 1* 0* *1 0* *0

n
28
 The Hamiltonian
As before: Check correct propagation by checking each
move; Each move involves only two particles.
Except: Moves may seem correct locally but are not.
Space of legal states is no longer invariant.

0 0 0 0 0 0 0 0 0 0 0 0

Solution: Add penalty for all “forbidden” shapes:

Fortunately, can be checked by checking nearest neighbors:

Hclock=∑ 0 0 0 0 29
 To Summarize

Saw how to implement any Q algorithm adiabatically.

Algorithm Design:
New language:
Ground states, spectral gaps.
What states can we reach?
What states are ground states of local Hamiltonians?
Methods from Mathematical Physics?

Fault Tolerance: Adiabatic comp. is naturally robust.

Adiabatic Fault Tolerance?

Ground states:
All states are ground states of local Hamiltonians,
Adiabatic dynamics are general. 30
Slow
down,
you
move
too
fast……

31