PhilSci Archive

Quantum Hypercomputation - Hype or Computation?

Hagar, Amit and Korolev, Alex (2007) Quantum Hypercomputation - Hype or Computation? [Preprint]

[img]
Preview
PDF
Download (170Kb) | Preview

    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
    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 11:14
    Item ID: 3180
    URI: http://philsci-archive.pitt.edu/id/eprint/3180

    Actions (login required)

    View Item

    Document Downloads