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. (...) Against what many have supposed, quantum information can be clearly defined (it is not a primitive or vague notion) but it is not part of the material contents of the world. Timpson's account sheds light on the nature of nonlocality and information flow in the presence of entanglement and, in particular, dissolves puzzles surrounding the remarkable process of quantum teleportation. In addition it permits a clear view of what the ontological and methodological lessons provided by quantum information theory are; lessons which bear on the gripping question of what role a concept like information has to play in fundamental physics. Topics discussed include the slogan 'Information is Physical', the prospects for an informational immaterialism (the view that information rather than matter might fundamentally constitute the world), and the status of the Church-Turing hypothesis in light of quantum computation. -/- With a clear grasp of the concept of information in hand, Timpson turns his attention to the pressing question of whether advances in quantum information theory pave the way for the resolution of the traditional conceptual problems of quantum mechanics: the deep problems which loom over measurement, nonlocality and the general nature of quantum ontology. He marks out a number of common pitfalls to be avoided before analysing in detail some concrete proposals, including the radical quantum Bayesian programme of Caves, Fuchs, and Schack. One central moral which is drawn is that, for all the interest that the quantum information-inspired approaches hold, no cheap resolutions to the traditional problems of quantum mechanics are to be had. (shrink)

The Many-Worlds Interpretation (MWI) is an approach to quantum mechanics according to which, in addition to the world we are aware of directly, there are many other similar worlds which exist in parallel at the same space and time. The existence of the other worlds makes it possible to remove randomness and action at a distance from quantum theory and thus from all physics.

This is a philosophical paper in favor of the many-worlds interpretation of quantum theory. The necessity of introducing many worlds is explained by analyzing a neutron interference experiment. The concept of the “measure of existence of a world” is introduced and some difficulties with the issue of probability in the framework of the MWI are resolved.

This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...) I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint. (shrink)

§1. Mathematics and the physical world. Genuine scientific knowledge cannot be certain, nor can it be justified a priori. Instead, it must be conjectured, and then tested by experiment, and this requires it to be expressed in a language appropriate for making precise, empirically testable predictions. That language is mathematics.This in turn constitutes a statement about what the physical world must be like if science, thus conceived, is to be possible. As Galileo put it, “the universe is written in the (...) language of mathematics”. Galileo's introduction of mathematically formulated, testable theories into physics marked the transition from the Aristotelian conception of physics, resting on supposedly necessary a priori principles, to its modern status as a theoretical, conjectural and empirical science. Instead of seeking an infallible universal mathematical design, Galilean science usesmathematics to express quantitative descriptions of an objective physical reality. Thus mathematics became the language in which we express our knowledge of the physical world — a language that is not only extraordinarily powerful and precise, but also effective in practice. Eugene Wigner referred to “the unreasonable effectiveness of mathematics in the physical sciences”. But is this effectiveness really unreasonable or miraculous?Numbers, sets, groups and algebras have an autonomous reality quite independent of what the laws of physics decree, and the properties of these mathematical structures can be just as objective as Plato believed they were. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...) other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

Which function is computed by a Turing machine will depend on how the symbols it manipulates are interpreted. Further, by invoking bizarre systems of notation it is easy to define Turing machines that compute textbook examples of uncomputable functions, such as the solution to the decision problem for first-order logic. Thus, the distinction between computable and uncomputable functions depends on the system of notation used. This raises the question: which systems of notation are the relevant ones for determining whether a (...) function is computable? These are the acceptable notations. I argue for a use criterion of acceptability: the acceptable notations for a domain of objects D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document} are the notations that we can use for the usual D\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {D}}$$\end{document}-activities. Acceptable notations for natural numbers are ones that we can count with. Acceptable notations for logical formulas are the ones that we can use in inference and logical analysis. And so on. This criterion makes computability a relative notion—whether a function is computable depends on which notations are acceptable, which is relative to our interests and abilities. I argue that this is not a problem, however, since there is independent reason for taking the extension of computable function to be relative to contingent facts. Similarly, the fact that the use criterion makes a mathematical distinction depend on practical concerns is also not a problem because it dovetails with similar phenomena in other areas of computability theory, namely the roles of notation in computation over real numbers and of Extended Church’s Thesis in complexity theory. (shrink)

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.

The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including their energy efficiency, cost, reliability, (...) and durability. Second, I critically analyze the notion of “offloading” computation to the morphology of an agent or robot, by showing that, literally, computation is sometimes not offloaded but simply avoided. Third, I point out that while the morphology of any agent is indicative of the environment that it is adapted to, or informative about that environment, it does not follow that every agent has access to its morphology as the model of its environment. (shrink)

A recent attempt to compute a (recursion‐theoretic) noncomputable function using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion‐theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from.

Quantum technologies can be presented to the public with or without introducing a strange trait of quantum theory responsible for their non-classical efficiency. Traditionally the message was centered on the superposition principle, while entanglement and properties such as contextuality have been gaining ground recently. A less theoretical approach is focused on simple protocols that enable technological applications. It results in a pragmatic narrative built with the help of the resource paradigm and principle-based reconstructions. I discuss the advantages and weaknesses of (...) these methods. To illustrate the importance of new metaphors beyond the Schrödinger cat, I briefly describe a non-mathematical narrative about entanglement that conveys an idea of some of its unusual properties. If quantum technologists are to succeed in building trust in their work, they ought to provoke an aesthetic perception in the public commensurable with the mathematical beauty of quantum theory experienced by the physicist. The power of the narrative method lies in its capacity to do so. (shrink)

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 (...) never has been essential to those foundations. The fundamental aim of complexity theory is to describe what is achievable in practice under various models of computation for our various practical purposes. Reflecting on quantum computing illuminates complexity theory by reminding us of this, too often under-emphasised, fact. (shrink)

Quantum computing technologies have become a hot topic in academia and industry receiving much attention and financial support from all sides. Building a quantum computer that can be used practically is in itself an outstanding challenge that has become the ‘new race to the moon’. Next to researchers and vendors of future computing technologies, national authorities are showing strong interest in maturing this technology due to its known potential to break many of today’s encryption techniques, which would have significant and (...) potentially disruptive impact on our society. It is, however, quite likely that quantum computing has beneficial impact on many computational disciplines. In this article we describe our vision of future developments in scientific computing that would be enabled by the advent of software-programmable quantum computers. We thereby assume that quantum computers will form part of a hybrid accelerated computing platform like GPUs and co-processor cards do today. In particular, we address the potential of quantum algorithms to bring major breakthroughs in applied mathematics and its applications. Finally, we give several examples that demonstrate the possible impact of quantum-accelerated scientific computing on society. (shrink)

The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: extending the representation to the process of setting the problem, relativizing the extended representation to the problem solver to whom the problem setting must be concealed, and symmetrizing the relativized representation for time reversal to represent the reversibility of the underlying physical process. The third steps projects the input state of the representation, where the problem solver is (...) completely ignorant of the setting and thus the solution of the problem, on one where she knows half solution. Completing the physical representation shows that the number of computation steps required to solve any oracle problem in an optimal quantum way should be that of a classical algorithm endowed with the advanced knowledge of half solution. (shrink)

Philosophers of information, according to Luciano Floridi (The philosophy of information. Oxford University Press, Oxford, 2010, p 32), study how information should be “adequately created, processed, managed, and used.” A small number of epistemologists have employed the concept of information as a cornerstone of their theoretical framework. How this concept can be used to make sense of seemingly intractable epistemological problems, however, has not been widely explored. This paper examines Fred Dretske’s information-based epistemology, in particular his response to radical epistemological (...) skepticism. We discuss the relationship between information, evidence and knowledge in relation to the problem of skepticism and the options available to an information-based epistemology for dealing with it. (shrink)

Relying on the universality of quantum mechanics and on recent results known as the “threshold theorems,” quantum information scientists deem the question of the feasibility of large‐scale, fault‐tolerant, and computationally superior quantum computers as purely technological. Reconstructing this question in statistical mechanical terms, this article suggests otherwise by questioning the physical significance of the threshold theorems. The skepticism it advances is neither too strong (hence is consistent with the universality of quantum mechanics) nor too weak (hence is independent of technological (...) contingencies). *Received June 2009; revised August 2009. †To contact the author, please write to: Department of History and Philosophy of Science, College of Arts and Sciences, Indiana University, Bloomington, IN 47405; e‐mail: [email protected]. (shrink)

The potential for scalable quantum computing depends on the viability of fault tolerance and quantum error correction, by which the entropy of environmental noise is removed during a quantum computation to maintain the physical reversibility of the computer’s logical qubits. However, the theory underlying quantum error correction applies a linguistic double standard to the words “noise” and “measurement” by treating environmental interactions during a quantum computation as inherently reversible, and environmental interactions at the end of a quantum computation as irreversible (...) measurements. Specifically, quantum error correction theory models noise as interactions that are uncorrelated or that result in correlations that decay in space and/or time, thus embedding no permanent information to the environment. I challenge this assumption both on logical grounds and by discussing a hypothetical quantum computer based on “position qubits.” The technological difficulties of producing a useful scalable position-qubit quantum computer parallel the overwhelming difficulties in performing a double-slit interference experiment on an object comprising a million to a billion fermions. (shrink)

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: [email protected]. (shrink)

This paper develops a hermeneutic technology assessment of quantum technologies. It offers a “vision assessment” of quantum technologies that can eventually lead to socio-ethical analysis. Section 2 describes this methodological approach and in particular the concept of the hermeneutic circle applied to technology. Section 3 gives a generic overview of quantum technologies and their impacts. Sections 4 and 5 apply the hermeneutic technology assessment approach to the study of quantum technologies. Section 5 proposes distinguishing three levels in the analysis of (...) the creation and communication of social meanings to quantum technologies: (a) fictions, (b) popularization, and (c) scientific journalism. Section 6 analyzes the results and defines some lines of action to increase social acceptance and trust in quantum technologies. The aim of this paper is to contribute to the debate on quantum technologies by enhancing the reflection on them and their potential, as well as illustrating the complexity of technological innovation and the need to shape it. (shrink)

Cooperative, connected and automated mobility technologies have the potential to revolutionize transportation systems and enhance safety, efficiency and sustainability. However, the increasing reliance on digital technologies also introduces new cybersecurity risks that can compromise the safety and privacy of passengers and the integrity of transportation systems. The purpose of this article is to examine the most important threats, vulnerabilities, risks and challenges related to automated mobility and to review the status of the most promising standardization initiatives on cryptography in a (...) world where quantum computers will soon represent an actual threat. (shrink)

Quantum information science is a source of task-related axioms whose consequences can be explored in general settings encompassing quantum mechanics, classical theory, and more. Quantum states are compendia of probabilities for the outcomes of possible operations we may perform on a system: ''operational states.'' I discuss general frameworks for ''operational theories'' (sets of possible operational states of a system), in which convexity plays key role. The main technical content of the paper is in a theorem that any such theory naturally (...) gives rise to a ''weak effect algebra'' when outcomes having the same probability in all states are identified and in the introduction of a notion of ''operation algebra'' that also takes account of sequential and conditional operations. Such frameworks are appropriate for investigating what things look like from an ''inside view,'' i.e., for describing perspectival information that one subsystem of the world can have about another. Understanding how such views can combine, and whether an overall ''geometric'' picture (''outside view'') coordinating them all can be had, even if this picture is very different in structure from the perspectives within it, is the key to whether we may be able to achieve a unified, ''objective'' physical view in which quantum mechanics is the appropriate description for certain perspectives, or whether quantum mechanics is truly telling us we must go beyond this ''geometric'' conception of physics. (shrink)

This paper presents several observations on the connections between information, physics, and computation. In particular, the computing power of quantum computers is examined. Quantum theory is characterized by superimposed states and nonlocal interactions. It is argued that recently studied quantum computers, which are based on local interactions, cannot simulate quantum physics.

Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum algorithm is limited to the process of solving the problem. We extend it to the process of setting the problem. The number of the drawer with the ball becomes a unitary transformation of the random outcome of the preparation (...) measurement. This extended, time-symmetric, representation brings in relational quantum mechanics. It is with respect to Bob and any external observer and cannot be with respect to Alice. It would tell her the number of the drawer with the ball before she opens any drawer. To Alice, the projection of the quantum state due to the preparation measurement should be retarded at the end of her search; in the input state of the search, the drawer number is determined to Bob and undetermined to Alice. We show that, mathematically, one can ascribe any part of the selection of the random outcome of the preparation measurement to the final Alice’s measurement. Ascribing half of it explains the speedup of the present algorithm. This leaves the input state to Bob unaltered and projects that to Alice on a state of lower entropy where she knows half of the number of the drawer with the ball in advance. The quantum algorithm turns out to be a sum over histories in each of which Alice knows in advance that the ball is in a pair of drawers and locates it by opening one of the two. In the sample of quantum algorithms examined, the part of the random outcome of the initial measurement selected by the final measurement is one half or slightly above it. Conversely, given an oracle problem, the assumption it is one half always corresponds to an existing quantum algorithm and gives the order of magnitude of the number of oracle queries required by the optimal one. (shrink)

Though there is yet no consensus on the right way to understand ‘physicalism’, most philosophers agree that, regardless of whatever else is required, physicalism cannot be true if there exists fundamental mentality. I will follow Jessica Wilson (Philosophical Studies 131:61–99, 2006) in calling this the 'No Fundamental Mentality' (NFM) constraint on physicalism. Unfortunately for those who wish to constrain physicalism in this way, NFM admits of a counterexample: an artificially intelligent quantum computer which employs quantum properties as part of its (...) cognitive operations. If one of these quantum properties serves a proper functional role in the artificial intelligence, then that property counts as a mental under the physicalism-friendly theory of mentality called “realizer functionalism”, which says that a lower-order property is mental if it satisfies an appropriate higher-order functional description. Further, if this quantum property is both fundamental and mental, then NFM must rule that it is not physical. Yet the existence of such an artificially intelligent quantum computer, which possesses mental properties solely in virtue of the functional roles those properties play, is surely consistent with the truth of physicalism. This ought to motivate NFM proponents to reformulate their view. (shrink)

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. (shrink)

A pesquisa em informação quântica sugere uma íntima conexão entre o conceito de informação e a teoria quântica, mas essa conexão envolve nuances cuja análise é o objeto deste trabalho. A sabedoria comum nesse campo divide-se em duas grandes áreas, não excludentes entre si. Há os que são movidos pela possibilidade de uso da teoria quântica em um novo campo, o da computação, independentemente do esclarecimento de seus fundamentos, aqui incluído o conceito de "informação". Alguns consideram que estamos diante de (...) um grande problema conceitual sem resposta satisfatória no momento, enquanto que outros, dentre os que reconhecem a magnitude do problema, têm proposto formulações com a pretensão de solução do problema. Este artigo tem pretensões modestas. Não pretendemos aportar novas soluções ao problema, nem apoiar uma das soluções existentes. Temos a expectativa de através da análise histórico-conceitual do problema mapear as diversas possibilidades, apontando o que nos parecem ser aspectos fortes e fracos nessas possibilidades. Research in quantum information suggests a close connection between information and quantum theory. The aim of this article is to analyze nuances involved in this connection. Scientists in this field are divided into two overlapping camps. Some are motivated only by the use of quantum features to improve information processing, in spite of concerns about the foundations of the quantum theory, while others recognize deep conceptual problems of this theory, and attempt to solve them. This article has modest ambitions. It aims only to chart, by way of historical and conceptual analysis, the diverse possibilities available, indicating the strengths and weaknesses of each of them. (shrink)

Because intelligent agents employ physically embodied cognitive systems to reason about the world, their cognitive abilities are constrained by the laws of physics. Scientists have used digital computers to develop and validate theories of physically embodied cognition. Computational theories of intelligence have advanced our understanding of the nature of intelligence and have yielded practically useful systems exhibiting some degree of intelligence. However, the view of cognition as algorithms running on digital computers rests on implicit assumptions about the physical world that (...) are incorrect. Recently, the view is emerging of computing systems as goal-directed agents, evolving during problem solving toward improved world models and better task performance. A full realization of this vision requires a new logic for computing that incorporates learning from experience as an intrinsic part of the logic, and that permits full exploitation of the quantum nature of the physical world. This paper proposes a theory of physically embodied cognitive agents founded upon first-order logic, Bayesian decision theory, and quantum physics. An abstract architecture for a physically embodied cognitive agent is presented. The cognitive aspect is represented as a Bayesian decision theoretic agent; the physical aspect is represented as a quantum process; and these aspects are related through von Neumann’s principle of psycho-physical parallelism. Alternative metaphysical positions regarding the meaning of quantum probabilities and the role of efficacious choices by agents are discussed in relation to the abstract agent architecture. The concepts are illustrated with an extended example from the domain of science fiction. (shrink)

In the same way as the quantum no-cloning theorem and quantum key distribution in two preceding papers, entanglement-assisted quantum teleportation and Grover’s search algorithm are generalized by transferring them to an abstract setting, including usual quantum mechanics as a special case. This again shows that a much more general and abstract access to these quantum mechanical features is possible than commonly thought. A non-classical extension of conditional probability and, particularly, a very special type of state-independent conditional probability are used instead (...) of Hilbert spaces and wavefunctions. (shrink)

The aim of this paper is to present some basic notions of the theory of quantum computing and to compare them with the basic notions of the classical theory of computation. I am convinced, that the results of quantum computation theory (QCT) are not only interesting in themselves, but also should be taken into account in discussions concerning the nature of mathematical knowledge. The philosophical discussion will however be postponed to another paper. QCT seems not to be well-known among philosophers (...) (at least not to the degree it deserves), so the aim of this paper is to provide the necessary technical preliminaries presented in a way accessible to the general philosophical audience. (shrink)

Summary Proposed by Einstein, Podolsky, and Rosen (EPR) in 1935, the entangled state has played a central part in exploring the foundation of quantum mechanics. At the end of the twentieth century, however, some physicists and mathematicians set aside the epistemological debates associated with EPR and turned it from a philosophical puzzle into practical resources for information processing. This paper examines the origin of what is known as quantum information. Scientists had considered making quantum computers and employing entanglement in communications (...) for a long time. But the real breakthrough only occurred in the 1980s when they shifted focus from general-purpose systems such as Turing machines to algorithms and protocols that solved particular problems, including quantum factorization, quantum search, superdense code, and teleportation. Key to their development was two groups of mathematical manipulations and deformations of entanglement—quantum parallelism and ‘feedback EPR’—that served as conceptual templates. The early success of quantum parallelism and feedback EPR was owed to the idealized formalism of entanglement researchers had prepared for philosophical discussions. Yet, such idealization is difficult to hold when the physical implementation of quantum information processors is at stake. A major challenge for today's quantum information scientists and engineers is thus to move from Einstein et al.'s well-defined scenarios into realistic models. (shrink)

A well-known feature of quantum mechanics is the secure exchange of secret bit strings which can then be used as keys to encrypt messages transmitted over any classical communication channel. It is demonstrated that this quantum key distribution allows a much more general and abstract access than commonly thought. The results include some generalizations for the Hilbert space version of quantum key distribution, but base upon a general non-classical extension of conditional probability. A special state-independent conditional probability is identifed as (...) origin of the superior security of quantum key distribution and may have more profound implications for the foundations and interpretation of quantum mechanics, quantum information theory, and the philosophical question what actually constitutes physical reality. (shrink)