Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-26T04:15:05.588Z Has data issue: false hasContentIssue false
  • English
  • Français

Quantum Speed-up of Computations

Published online by Cambridge University Press:  01 January 2022

Itamar Pitowsky
Itamar Pitowsky*
Affiliation:
Department of Philosophy, the Hebrew University
*
Mount Scopus, Jerusalem 91905, Israel; itamarp@vms.huji.ac.il.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Research Article
Information
Philosophy of Science , Volume 69 , Issue S3 , September 2002 , pp. S168 - S177
Copyright
Copyright © The Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aharonov, D. (1998), “Quantum Computation”, quant-ph/9812037.Google Scholar
Copeland, B. J. (1996), “The Church Turing Thesis”, in J. Perry, and E. Zalta, (eds.), The Stanford Encyclopedia of Philosophy. [http://plato.stanford.edu].Google Scholar
Deutsch, D. (1985), “Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer”, Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer 400:97–117.Google Scholar
Earman, J., and Norton, J. D. (1993), “Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes”, Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes 60:22–42.Google Scholar
Ekert, A., and Jozsa, R. (1996), “Quantum Computation and Shor’s Factoring Algorithm”, Quantum Computation and Shor’s Factoring Algorithm 68:733–753.Google Scholar
Gandy, R. O. (1980), “Church’s Thesis and Principles of Mechanisms”, in Barwise, J., Keisler, J. J., and Kunen, K., (eds.), The Kleene Symposium. Amsterdam: North Holland, 123–145.CrossRefGoogle Scholar
Gary, M. R., and Johnson, D. S. (1979), Computers and Intractability—A Guide to the Theory of NP-completeness. New York: W. H. Freeman.Google Scholar
Giblin, P. (1993), Primes and Programming. Cambridge: Cambridge University Press.Google Scholar
Hogarth, M. L. (1994), “Non-Turing Computers and Non-Turing Computability”, Non-Turing Computers and Non-Turing Computability 1, 126–138.Google Scholar
MacCallum, D. (2001), “Quantum Entanglement and Classical Computation”, this volumeGoogle Scholar
Moore, C. (1990), “Unpredictability and Undecidability in Dynamical Systems”, Unpredictability and Undecidability in Dynamical Systems 64:2354–2357.Google ScholarPubMed
Pitowsky, I. (1990), “The Physical Church Thesis and Physical Computational Complexity”, The Physical Church Thesis and Physical Computational Complexity 39:161–180.Google Scholar
Pitowsky, I. (1994), “Laplace’s Demon Consults an Oracle: The Computational Complexity of Prediction”, Laplace’s Demon Consults an Oracle: The Computational Complexity of Prediction 27:161–180.Google Scholar
Pour-El, M. B., and Richards, I. (1981), “The Wave Equation with Computable Initial Data such that its Unique Solution is not Computable”, The Wave Equation with Computable Initial Data such that its Unique Solution is not Computable 39:215–239.Google Scholar
Rabin, M. O. (1976), “Probabilistic Algorithms”, in Traub, J. F., (ed.), Algorithms and Complexity New Directions and Recent Results. New York: Academic Press.Google Scholar
Shagrir, O., and Pitowsky, I. (2002), “The Church-Turing Thesis and Hyper-computation”, Minds and Machines (forthcoming).Google Scholar
Shor, P. W. (1994), “Polynomial Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer”, Polynomial Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 26:1484–1509.Google Scholar
Sieg, W., and Byrnes, J. (1999), “An Abstract Model for Parallel Computations: Gandy’s Thesis”, An Abstract Model for Parallel Computations: Gandy’s Thesis 82:150–164.Google Scholar
Siegelmann, H. T. (1995), “Computation Beyond Turing Limit”, Computation Beyond Turing Limit 268:245–248.Google ScholarPubMed
Turing, A. M. (1936), “On Computable Numbers with an Application to the Entscheidunsproblem”, Proceedings of the London Mathematical Society (2) 45:115–154.Google Scholar
Wolfram, S. (1985), “Undecidability and Intractability in Theoretical Physics”, Undecidability and Intractability in Theoretical Physics 54:735–738.Google ScholarPubMed