PhilSci Archive

How-Possibly Explanations in Quantum Computer Science

Cuffaro, Michael E. (2014) How-Possibly Explanations in Quantum Computer Science. In: UNSPECIFIED.

WarningThere is a more recent version of this item available.
[img]
Preview
PDF
how_possibly.pdf - Accepted Version

Download (90kB)

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 in so doing 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.


Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Conference or Workshop Item (UNSPECIFIED)
Creators:
CreatorsEmailORCID
Cuffaro, Michael E.mike@michaelcuffaro.com
Keywords: how-possibly; computer science; algorithms; algorithmic explanation; quantum computation
Subjects: Specific Sciences > Computation/Information > Classical
Specific Sciences > Computation/Information > Quantum
General Issues > Explanation
Depositing User: Dr. Michael Cuffaro
Date Deposited: 21 Jun 2014 00:16
Last Modified: 22 Jul 2015 15:15
Item ID: 10770
Subjects: Specific Sciences > Computation/Information > Classical
Specific Sciences > Computation/Information > Quantum
General Issues > Explanation
Date: 2014
URI: http://philsci-archive.pitt.edu/id/eprint/10770

Available Versions of this Item

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item