Philosophy of Science 82 (5):737-748 (2015)

Authors
Michael Cuffaro
Ludwig Maximilians Universität, München
Abstract
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples little is gained in subsequently asking a how-actually question. Once one has explained how-possibly, there is little left to do
Keywords how-possibly  computer science  algorithms  algorithmic explanation  quantum computation
Categories (categorize this paper)
Reprint years 2015
DOI 10.1086/683243
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,554
Through your library

References found in this work BETA

Studies in the Logic of Explanation.Carl Hempel & Paul Oppenheim - 1948 - Philosophy of Science 15 (2):135-175.
Studies in the Logic of Explanation.Carl G. Hempel & Paul Oppenheim - 1948 - Journal of Symbolic Logic 14 (2):133-133.
Confirmation and Explaining How Possible.Patrick Forber - 2008 - Studies in History and Philosophy of Biological and Biomedical Sciences 41 (1):32-40.

View all 11 references / Add more references

Citations of this work BETA

Understanding (with) Toy Models.Alexander Reutlinger, Dominik Hangleiter & Stephan Hartmann - 2018 - British Journal for the Philosophy of Science 69 (4):1069-1099.
Understanding (With) Toy Models.Alexander Reutlinger, Dominik Hangleiter & Stephan Hartmann - 2016 - British Journal for the Philosophy of Science:axx005.
Quantum Computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

Quantum Mechanics and Computation.Bart D’Hooghe & Jaroslaw Pykacz - 2004 - Foundations of Science 9 (4):387-404.
Many Worlds, the Cluster-State Quantum Computer, and the Problem of the Preferred Basis.Michael E. Cuffaro - 2012 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 43 (1):35-42.
A Quantum Computer Only Needs One Universe.A. M. Steane - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (3):469-478.
On the Physical Explanation for Quantum Computational Speedup.Michael E. Cuffaro - 2013 - Dissertation, The University of Western Ontario
Quantum Hypercomputation—Hype or Computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.
Copenhagen Computation.D. N. - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (3):511-522.
Explanation, Emergence, and Quantum Entanglement.Andreas Hüttemann - 2005 - Philosophy of Science 72 (1):114-127.
Quantum Computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.
Algorithms for Quantum Computation: Discrete Logarithms and Factoring.P. Shor - 1994 - Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science:124-134.
Quantum Causal Explanation: Or, Why Birds Fly South.Sally Shrapnel - 2014 - European Journal for Philosophy of Science 4 (3):409-423.

Analytics

Added to PP index
2014-06-23

Total views
127 ( #70,109 of 2,331,046 )

Recent downloads (6 months)
4 ( #194,675 of 2,331,046 )

How can I increase my downloads?

Downloads

My notes