Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-12-02T23:28:47.688Z Has data issue: false hasContentIssue false

How-Possibly Explanations in (Quantum) Computer Science

Published online by Cambridge University Press:  01 January 2022

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.

Type
Explanation and Mechanisms
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.)

Footnotes

Thanks are due to Wayne Myrvold, Armond Duwell, Alan Love, Seamus Bradley, Sebastian Lutz, Lorenzo Casini, and my audience at the 2014 meeting of the Philosophy of Science Association. All of your comments were helpful to me in preparing this final version. Thanks also to the Alexander von Humboldt Foundation, whose financial support has made this project possible.

References

Aaronson, Scott. 2013. Quantum Computing since Democritus. New York: Cambridge University Press.10.1017/CBO9780511979309CrossRefGoogle Scholar
Bokulich, Alisa. 2014. “How the Tiger Bush Got Its Stripes: ‘How Possibly’ vs. ‘How Actually’ Model Explanations.” Monist 97:321–28.10.5840/monist201497321CrossRefGoogle Scholar
Cuffaro, Michael E. 2012. “Many Worlds, the Cluster-State Quantum Computer, and the Problem of the Preferred Basis.” Studies in History and Philosophy of Modern Physics 43:3542.10.1016/j.shpsb.2011.11.007CrossRefGoogle Scholar
Dray, William. 1957. Laws and Explanation in History. Oxford: Oxford University Press.Google Scholar
Dray, William 1968. “On Explaining How-Possibly.” Monist 52:390407.CrossRefGoogle Scholar
Ekert, Artur, and Jozsa, Richard. 1998. “Quantum Algorithms: Entanglement-Enhanced Information Processing.” Philosophical Transactions of the Royal Society A 356:1769–82.CrossRefGoogle Scholar
Forber, Patrick. 2010. “Confirmation and Explaining How Possible.” Studies in History and Philosophy of Biological and Biomedical Sciences 41:3240.CrossRefGoogle ScholarPubMed
Fortnow, Lance. 2003. “One Complexity Theorist’s View of Quantum Computing.” Theoretical Computer Science 292:597610.10.1016/S0304-3975(01)00377-2CrossRefGoogle Scholar
Hempel, Carl G. 1965. Aspects of Scientific Explanation and Other Essays in the Philosophy of Science. New York: Free Press.Google Scholar
Hewitt-Horsman, Clare. 2009. “An Introduction to Many Worlds in Quantum Computation.” Foundations of Physics 39:869902.10.1007/s10701-009-9300-2CrossRefGoogle Scholar
Martin, John C. 1997. Introduction to Languages and the Theory of Computation. 2nd ed. New York: McGraw-Hill.Google Scholar
Mehlhorn, Kurt, and Sanders, Peter. 2008. Algorithms and Data Structures. Berlin: Springer.Google Scholar
Nielsen, Michael A., and Chuang, Isaac L.. 2000. Quantum Computation and Quantum Information. Cambridge: Cambridge University Press.Google Scholar
Persson, Johannes. 2012. “Three Conceptions of Explaining How Possibly—and One Reductive Account.” In EPSA Philosophy of Science: Amsterdam 2009, ed. de Regt, Henk W., Hartmann, Stephan, and Okasha, Samir, 275–86. Dordrecht: Springer.Google Scholar
Reiner, Richard. 1993. “Necessary Conditions and Explaining How-Possibly.” Philosophical Quarterly 43:5869.CrossRefGoogle Scholar
Resnik, David B. 1991. “How-Possibly Explanations in Biology.” Acta Biotheoretica 39:141–49.CrossRefGoogle Scholar
Woodward, James. 2003. Making Things Happen. Oxford: Oxford University Press.Google Scholar