Skip to Main Content
Schemes are examined for implementing quantum computers to solve problems that cannot be solved in polynomial time on classical computers. Special attention is given to the newly proposed adiabatic quantum computation algorithms. We explore the ways in which the latter might be easier to implement than the more conventional approach.
Date of Publication: Oct. 2005