Hagar, Amit and Korolev, Alex (2007) Quantum Hypercomputation - Hype or Computation? [Preprint]
|
PDF
Quantum_Hype.pdf Download (174kB) |
Abstract
A recent attempt to compute a (recursion--theoretic) non--computable 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.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Item Type: | Preprint | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Creators: |
|
|||||||||
Additional Information: | Forthcoming in Philosophy of Science | |||||||||
Keywords: | Quantum computing; Hypercomputation; Church-Turing Thesis; Computational complexity; Undecidability | |||||||||
Subjects: | Specific Sciences > Computation/Information > Quantum Specific Sciences > Computation/Information > Classical Specific Sciences > Computer Science Specific Sciences > Physics > Quantum Mechanics |
|||||||||
Depositing User: | Amit Hagar | |||||||||
Date Deposited: | 21 Feb 2007 | |||||||||
Last Modified: | 07 Oct 2010 15:14 | |||||||||
Item ID: | 3180 | |||||||||
Subjects: | Specific Sciences > Computation/Information > Quantum Specific Sciences > Computation/Information > Classical Specific Sciences > Computer Science Specific Sciences > Physics > Quantum Mechanics |
|||||||||
Date: | January 2007 | |||||||||
URI: | https://philsci-archive.pitt.edu/id/eprint/3180 |
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
View Item |