Quantum adiabatic and quantum circuit algorithms are equivalent

Algorithms for adiabatic quantum computers were first proposed in 2000 and since then, researchers have shown that quantum adiabatic algorithms and quantum circuit algorithms are “polynomially equivalent”. This means that if one type of algorithm takes time t to solve a problem, then the other will take a polynomial value of t to the nth power to complete the task.

No comments:

Post a Comment