Switch to: References

Add citations

You must login to add citations.
  1. Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
    Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically revise the foundations of the theory. For model-independence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The grammar of teleportation.Christopher Gordon Timpson - 2006 - British Journal for the Philosophy of Science 57 (3):587-621.
    Whilst a straightforward consequence of the formalism of non-relativistic quantum mechanics, the phenomenon of quantum teleportation has given rise to considerable puzzlement. In this paper, the teleportation protocol is reviewed and these puzzles dispelled. It is suggested that they arise from two primary sources: (1) the familiar error of hypostatizing an abstract noun (in this case, ‘information’) and (2) failure to differentiate interpretation dependent from interpretation independent features of quantum mechanics. A subsidiary source of error, the simulation fallacy, is also (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • A Scientific Metaphysics and Ockham’s Razor.Bruce Long - 2019 - Axiomathes (5):1-31.
    I argue that although Ockham’s Razor (OR) has its origins in a-priorist ontological mandates according to the purposes of natural theology and natural philosophy as influenced by it, the principle has taken on significant empirical and contingent materialist connotations and conceptual content since the scientific revolution. I briefly discuss the pluralism of the concept of OR historically and in contemporary science and philosophy. I then attempt to align scientific metaphysics with contemporary conceptions of OR, and to demonstrate that ontic parsimony (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Quantum Parallelism Thesis, Many World Interpretation and Physical Information Thesis.Giacomo Lini - 2015 - Philosophies 1 (1):102--110.
    The aim of this paper is to address a particular interpretation of quantum computational processes, namely, the so called Many World Interpretation. I will show that if such an interpretation is supported by the Quantum Parallelism Thesis and the Physical Information Thesis at the same time, then it falls under circularity. I will suggest, in fact, that as long as this variation states both PIT and QPT cannot furnish a physical explanation of the latter unless it is already stating the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On the Significance of the Gottesman–Knill Theorem.Michael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.
    According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the theorem is, on reflection, already evident when we consider Bell’s and related inequalities in the context of (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • The physics of quantum information: Quantum cryptography, quantum teleportation, quantum computation - D. bouwmeester, A. Ekert and A. Zeilinger (eds.); Germany, 2000, 314pp, US$ 54, ISBN 3-540-66778-. [REVIEW]A. Duwell - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (2):331-334.
  • The physics of quantum information: quantum cryptography, quantum teleportation, quantum computation.Armond Duwell - 2003 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 34 (2):331-334.
  • The Many‐Worlds Interpretation and Quantum Computation.Armond Duwell - 2007 - Philosophy of Science 74 (5):1007-1018.
    David Deutsch and others have suggested that the Many-Worlds Interpretation of quantum mechanics is the only interpretation capable of explaining the special efficiency quantum computers seem to enjoy over classical ones. I argue that this view is not tenable. Using a toy algorithm I show that the Many-Worlds Interpretation must crucially use the ontological status of the universal state vector to explain quantum computational efficiency, as opposed to the particular ontology of the MWI, that is, the computational histories of worlds. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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.
    I argue that the many worlds explanation of quantum computation is not licensed by, and in fact is conceptually inferior to, the many worlds interpretation of quantum mechanics from which it is derived. I argue that the many worlds explanation of quantum computation is incompatible with the recently developed cluster state model of quantum computation. Based on these considerations I conclude that we should reject the many worlds explanation of quantum computation.
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Quantum computation and pseudotelepathic games.Jeffrey Bub - 2008 - Philosophy of Science 75 (4):458-472.
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Quantum Information Theory & the Foundations of Quantum Mechanics.Christopher Gordon Timpson - 2004 - Oxford, GB: Oxford University Press.
    Quantum Information Theory and the Foundations of Quantum Mechanics is a conceptual analysis of one of the most prominent and exciting new areas of physics, providing the first full-length philosophical treatment of quantum information theory and the questions it raises for our understanding of the quantum world. -/- Beginning from a careful, revisionary, analysis of the concepts of information in the everyday and classical information-theory settings, Christopher G. Timpson argues for an ontologically deflationary account of the nature of quantum information. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   45 citations  
  • The Logos Categorical Approach to QM: II. Quantum Superpositions.Christian de Ronde & Cesar Massri - unknown
    In this paper we attempt to consider quantum superpositions from the perspective of the logos categorical approach presented in [26]. We will argue that our approach allows us not only to better visualize the structural features of quantum superpositions providing an anschaulich content to all terms, but also to restore —through the intensive valuation of graphs and the notion of immanent power— an objective representation of what QM is really talking about. In particular, we will discuss how superpositions relate to (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On the Physical Explanation for Quantum Computational Speedup.Michael Cuffaro - 2013 - Dissertation, The University of Western Ontario
    The aim of this dissertation is to clarify the debate over the explanation of quantum speedup and to submit, for the reader's consideration, a tentative resolution to it. In particular, I argue, in this dissertation, that the physical explanation for quantum speedup is precisely the fact that the phenomenon of quantum entanglement enables a quantum computer to fully exploit the representational capacity of Hilbert space. This is impossible for classical systems, joint states of which must always be representable as product (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Fermat’s last theorem proved in Hilbert arithmetic. II. Its proof in Hilbert arithmetic by the Kochen-Specker theorem with or without induction.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (10):1-52.
    The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • A Scientific Metaphysical Naturalisation of Information.Bruce Long - 2018 - Dissertation, University of Sydney
    The objective of this thesis is to present a naturalised metaphysics of information, or to naturalise information, by way of deploying a scientific metaphysics according to which contingency is privileged and a-priori conceptual analysis is excluded (or at least greatly diminished) in favour of contingent and defeasible metaphysics. The ontology of information is established according to the premises and mandate of the scientific metaphysics by inference to the best explanation, and in accordance with the idea that the primacy of physics (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Necessity of Entanglement for the Explanation of Quantum Speedup.Michael Cuffaro - manuscript
    Of the many and varied applications of quantum information theory, perhaps the most fascinating is the sub-field of quantum computation. In this sub-field, computational algorithms are designed which utilise the resources available in quantum systems in order to compute solutions to computational problems with, in some cases, exponentially fewer resources than any known classical algorithm. While the fact of quantum computational speedup is almost beyond doubt, the source of quantum speedup is still a matter of debate. In this paper I (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark