Algorithmic approach to adiabatic quantum optimization

Details Algorithmic approach to adiabatic quantum optimization Algorithmic approach to adiabatic quantum optimization

2011-08-16

arxiv.org/abs/1108.3303v1

Physics

Quantum Physics

7 pages, 3 figures

Scientific paper

It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic quantum algorithm designed to eliminate exponentially small gaps caused by anticrossings between eigenstates that correspond with the local and global minima of the problem Hamiltonian. In each iteration of the algorithm, information is gathered about the local minima that are reached after passing the anticrossing non-adiabatically. This information is then used to penalize pathways to the corresponding local minima, by adjusting the initial Hamiltonian. This is repeated for multiple clusters of local minima as needed. We generate 64-qubit random instances of the maximum independent set problem, skewed to be extremely hard, with between 10^5 and 10^6 highly-degenerate local minima. Using quantum Monte Carlo simulations, it is found that the algorithm can trivially solve all the instances in ~10 iterations.

Affiliated with

Also associated with

No associations

Rating

Algorithmic approach to adiabatic quantum optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic approach to adiabatic quantum optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic approach to adiabatic quantum optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196425