id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_trhrfxqn7zeyplsvzzvk5gcqyu	Amit Hagar	Quantum Hypercomputation—Hype or Computation?*	2007	19	.pdf	application/pdf	6962	470	65	A recent attempt to compute a (recursion–theoretic) non–computable function using the quantum adiabatic algorithm is criticized and found wanting. The common view is that quantum algorithms such as Shor's may help to redescribe the complexity space of computational problems, but recently it has been 1The term Hypercomputer was coined by Copeland (1998) to denote a machine that can compute non–recursive functions by performing infinite number computational steps in a finite time. The crux of the quantum adiabatic algorithm lies in the possibility of encoding a specific instance of a given decision problem in a certain Hamiltonian.3 identify whether the quantum system has indeed reached its ground state, no matter what T is.4 If not, according to Kieu, one needs only to enlarge the evolution global minimum for the 'computed' function exists by construction (which ensures a non–zero energy gap and hence a finite evolution time) is of no consequence.	./cache/work_trhrfxqn7zeyplsvzzvk5gcqyu.pdf	./txt/work_trhrfxqn7zeyplsvzzvk5gcqyu.txt