•  173
    On the tension between ontology and epistemology in quantum probabilities
    In Olimpia Lombardi, Sebastian Fortin, Federico Holik & Cristian López (eds.), What is Quantum Information?, Cambridge University Press. pp. 147-178. 2017.
    For many among the scientifically informed public, and even among physicists, Heisenberg's uncertainty principle epitomizes quantum mechanics. Nevertheless, more than 86 years after its inception, there is no consensus over the interpretation, scope, and validity of this principle. The aim of this chapter is to offer one such interpretation, the traces of which may be found already in Heisenberg's letters to Pauli from 1926, and in Dirac's anticipation of Heisenberg's uncertainty relations from …Read more
  •  511
    Quantum algorithms: Philosophical lessons
    Minds and Machines 17 (2): 233-247. 2007.
    I discuss the philosophical implications that the rising new science of quantum computing may have on the philosophy of computer science. While quantum algorithms leave the notion of Turing-Computability intact, they may re-describe the abstract space of computational complexity theory hence militate against the autonomous character of some of the concepts and categories of computer science.
  •  297
    Huw Price (1996, 2002, 2003) argues that causal-dynamical theories that aim to explain thermodynamic asymmetry in time are misguided. He points out that in seeking a dynamical factor responsible for the general tendency of entropy to increase, these approaches fail to appreciate the true nature of the problem in the foundations of statistical mechanics (SM). I argue that it is Price who is guilty of misapprehension of the issue at stake. When properly understood, causal-dynamical approaches in t…Read more
  •  71
    Quantum computers are hypothetical quantum information processing (QIP) devices that allow one to store, manipulate, and extract information while harnessing quantum physics to solve various computational problems and do so putatively more efficiently than any known classical counterpart. Despite many ‘proofs of concept’ (Aharonov and Ben–Or 1996; Knill and Laflamme 1996; Knill et al. 1996; Knill et al. 1998) the key obstacle in realizing these powerful machines remains their scalability and sus…Read more