Quantum Computation and Pseudotelepathic Games.

A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism', but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities...

Descripción completa

Detalles Bibliográficos
Publicado en:Philosophy of Science Vol. 75; no. 4; pp. 458 - 473
Autor principal: Bub, Jeffrey
Formato: Artículo
Publicado: Cambridge University Press Oct2008
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=37180746&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 37180746
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00318248
        PSC
      jtl: Philosophy of Science
      issn: 00318248
      maglogo: N
    pubinfo:
      dt: Oct2008
      vid: 75
      iid: 4
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        37180746
        10.1086/595993
      ppf: 458
      ppct: 15
      formats:
        fmt:
          @attributes:
            type: P
            size: 171KB
      tig:
        atl: Quantum Computation and Pseudotelepathic Games.
      aug:
        au: Bub, Jeffrey
        affil: Department of Philosophy, University of Maryland, College Park, MD 20742
      su:
        Quantum computers
        Quantum theory
        Quantum computer peripherals
        Prediction models
        Mathematical optimization
      sug:
        subj:
          Quantum computers
          Quantum theory
          Quantum computer peripherals
          Prediction models
          Mathematical optimization
      ab: A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism', but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of 'pseudotelepathic' games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players' correlated responses in a game).
      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: 2008
    holdings:
      @attributes:
        islocal: N