Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hagar et al. (2007) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: