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....

Descripción completa

Detalles Bibliográficos
Publicado en:Philosophy of Science Vol. 74; no. 3; pp. 347 - 364
Autores principales: Hagar, Amit, Korolev, Alex
Formato: Artículo
Publicado: Cambridge University Press Jul2007
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=27670465&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 27670465
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00318248
        PSC
      jtl: Philosophy of Science
      issn: 00318248
      maglogo: N
    pubinfo:
      dt: Jul2007
      vid: 74
      iid: 3
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        27670465
        10.1086/521969
      ppf: 347
      ppct: 17
      formats:
        fmt:
          @attributes:
            type: P
            size: 190KB
      tig:
        atl: Quantum Hypercomputation--Hype or Computation?
      aug:
        au:
          Hagar, Amit
          Korolev, Alex
        affil:
          HPS Department, Indiana University, Bloomington, IN 47405
          Department of Philosophy, University of British Columbia, Vancouver, BC, Canada V6T 1Z1
      su:
        Quantum computers
        Algorithms
        Computable functions
        Recursive functions
        Kieu, Tien D.
        Shor, Peter
        Quantum theory
      sug:
        subj:
          Quantum computers
          Algorithms
          Computable functions
          Recursive functions
          Kieu, Tien D.
          Shor, Peter
          Quantum theory
      ab: 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.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Copyright of Philosophy of Science is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use.
      item: Philosophy of Science
      holder: Cambridge University Press
      dt:
        @attributes:
          year: 2007
    holdings:
      @attributes:
        islocal: N