The adiabatic quantum computer was proposed in arXiv:quant-ph/0001106v1 in order to solve certain type of problems.

For low dimensions it was shown that the adiabatic quantum computer is polynomial, for a certain problem with exponential complexity in a classical computer. Peter Young, who gave a presentation at Princeton yesterday, is using Quantum Montecarlo Simuations, as used in statistical mechanics for the partition function, in order to engage this problem for higher dimensions where direct simulations are not feasible.

The Complexity Of The Quantum Adiabatic Algorithm

## No comments:

## Post a Comment