Quantum Hypercomputation--Hype or Computation?
A recent attempt to compute a (recursion-theoretic) noncomputable function using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion-theoretic) notion of computability....
| Publicado en: | Philosophy of Science Vol. 74; no. 3; pp. 347 - 364 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Cambridge University Press
Jul2007
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | A recent attempt to compute a (recursion-theoretic) noncomputable function using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion-theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from. |
|---|