Online research in philosophy

This paper tries to get a grip on two seemingly conflicting intuitions about reductionism in quantum mechanics. On the one hand it is received wisdom that quantum mechanics puts an end to ‘reductionism’. Quantum-entanglement is responsible for such features of quantum mechanics as holism, the failure of supervenience and emergence. While I agree with these claims I will argue that it is only part of the story. Quantum mechanics provides us with thorough-going reductionist explanations. I will distinguish two kinds of micro-explanation (or micro-‘reduction’). I will argue that even though quantum-entanglement provides an example for the failure of one kind of micro-explanation it does not affect the other. Contrary to a recent paper by Kronz and Tiehen I claim that the explanation of the dynamics of quantum mechanical systems is just as reductionist as it used to be in classical mechanics.

Some physicists seem to believe that quantum information theory requires a new concept of information (Jozsa, 1998, Quantum information and its properties. In: Hoi-Kwong Lo, S. Popescu, T. Spiller (Eds.), Introduction to Quantum Computation and Information, World Scientific, Singapore, (pp. 49-75); Deutsch & Hayden, 1999, Information flow in entangled quantum subsystems, preprint quant-ph/9906007). I will argue that no new concept is necessary. Shannon's concept of information is sufficient for quantum information theory. Properties that are cited to contrast quantum information and classical information (i.e., Shannon information) actually point to differences in our ability to manipulate, access, and transfer information depending on whether quantum systems, opposed to classical systems, are used in a communication system. I also demonstrate that conceptually puzzling phenomena in quantum information theory, such as dense coding, teleportation, and Schumacher coding, all of which are cited as evidence that a new concept of information is required, do not have to be regarded as such.

Many experiments have shown that quantum entanglement is physically real. In this paper, we will discuss its ontological origin, implications and applications by thinking outside the standard interpretations of quantum mechanics. We argue that quantum entanglement originates from the primordial spin processes in non-spatial and non-temporal pre-spacetime, implies genuine interconnectedness and inseparableness of once interacting quantum entities, plays vital roles in biology and consciousness and, once better understood and harnessed, has far-reaching consequences and applications in many fields such as medicine and neuroscience. We further argue that quantum computation power also originates from the primordial spin processes in pre-spacetime. Finally, we discuss the roles of quantum entanglement in spin-mediated consciousness theory.

I describe a pedagogical scheme devised to teach efficiently to computer scientists just enough quantum mechanics to permit them to understand the theoretical developments of the last decade going under the name of ''quantum computation.'' I then note that my offbeat approach to quantum mechanics, designed to be maximally efficacious for this specific educational purpose, is nothing other than the Copenhagen interpretation.

The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of computation began with logic and gradually moved to the capacity of …nite automata. Consequently, modern computer models rely on general physical principles, with quantum computers representing the extreme case. The paper discusses this development, and the challenges to the Church-Turing thesis in its physical form, in particular, Kieu’s quantum computer and relativistic hyper-computation. Finally, the robustness of the boundary between polynomial and exponential time complexity is considered in connection with quantum computers and quantum information theory.

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 also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game). *Received October 2008. †To contact the author, please write to: Department of Philosophy, University of Maryland, College Park, MD 20742; e‐mail: jbub@umd.edu.

Proposals for quantum computation rely on superposed states implementing multiple computations simultaneously, in parallel, according to quantum linear superposition (e.g., Benioff, 1982; Feynman, 1986; Deutsch, 1985, Deutsch and Josza, 1992). In principle, quantum computation is capable of specific applications beyond the reach of classical computing (e.g., Shor, 1994). A number of technological systems aimed at realizing these proposals have been suggested and are being evaluated as possible substrates for quantum computers (e.g. trapped ions, electron spins, quantum dots, nuclear spins, etc., see Table 1; Bennett, 1995; and Barenco, 1995). The main obstacle to realization of quantum computation is the problem of interfacing to the system (input, output) while also protecting the quantum state from environmental decoherence. If this problem can be overcome, then present day classical computers may evolve to quantum computers.

In quantum computation non classical features such as superposition states and entanglement are used to solve problems in new ways, impossible on classical digital computers.We illustrate by Deutsch algorithm how a quantum computer can use superposition states to outperform any classical computer. We comment on the view of a quantum computer as a massive parallel computer and recall Amdahls law for a classical parallel computer. We argue that the view on quantum computation as a massive parallel computation disregards the presence of entanglement in a general quantum computation and the non classical way in which parallel results are combined to obtain the final output.

”Quantum entanglement”, a phrase first coined by Erwin Schr¨ odinger1, describes a condition of the separated parts of the same quantum system in which each of the parts can only be described by referencing the state of other part. This is one of the most counterintuitive aspects of quantum mechanics, because classically one would expect system parts out of speed-of-light contact to be completely independent. Thus, entanglement represents a kind of quantum connectedness in which measurements on one isolated part of an entangled quantum system have non-classical consequences for the outcome of measurements performed on the other (possibly very distant) part of the same system. This quantum connectedness that enforces the measurement correlation and state-matching in entangled quantum systems has come to be called quantum nonlocality.