Quantum mechanics is one of the most successful theories of physics. But the creators of quantum mechanics had to reject realism in order to describe some paradoxical quantum phenomena. Einstein considered the rejection of realism unacceptable, since according to his understanding, realism is the presupposition of every kind of physical thinking. The dispute about the permissibility of rejecting realism has largely determined the modern understanding of quantum theory and even led to the emergence new quantum information technologies. Many modern authors (...) are sure that realism can be refute experimentally. Some authors are sure even that real technologies can be created on the basis of this refutation. The well-known GHZ theorem is considered critically in this work the authors of which are sure that realism can be refute experimentally. (shrink)

Although a substantial number of papers is published on the topic of consciousness, there is still little consensus on what its nature is and how the physical and phenomenal worlds are connected. Most published research establishes a causal relation between the brain and the mind, but it lacks a cogent theory of how this relation comes to be. In contrast, this paper uses a set of thought experiments grounded in quantum information theory to derive a framework for resolving the hard (...) problem of consciousness. Despite the common tendency to treat the problem purely philosophically, in this paper, consciousness and qualia are analyzed through established formal theory deriving conclusions regarding their relation which provide counter-arguments for the commonly held dualist view. Through the informational monism framework, a case is made for a fundamentally phenomenal nature of information. (shrink)

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite to more definite (...) states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (shrink)

The book’s core argument is that an artificial intelligence that could equal or exceed human intelligence—sometimes called artificial general intelligence (AGI)—is for mathematical reasons impossible. It offers two specific reasons for this claim: Human intelligence is a capability of a complex dynamic system—the human brain and central nervous system. Systems of this sort cannot be modelled mathematically in a way that allows them to operate inside a computer. In supporting their claim, the authors, Jobst Landgrebe and Barry Smith, marshal evidence (...) from mathematics, physics, computer science, philosophy, linguistics, and biology, setting up their book around three central questions: What are the essential marks of human intelligence? What is it that researchers try to do when they attempt to achieve "artificial intelligence" (AI)? And why, after more than 50 years, are our most common interactions with AI, for example with our bank’s computers, still so unsatisfactory? Landgrebe and Smith show how a widespread fear about AI’s potential to bring about radical changes in the nature of human beings and in the human social order is founded on an error. There is still, as they demonstrate in a final chapter, a great deal that AI can achieve which will benefit humanity. But these benefits will be achieved without the aid of systems that are more powerful than humans, which are as impossible as AI systems that are intrinsically "evil" or able to "will" a takeover of human society. (shrink)

There is a deeply entrenched view in philosophy and physics, the closed systems view, according to which isolated systems are conceived of as fundamental. On this view, when a system is under the influence of its environment this is described in terms of a coupling between it and a separate system which taken together are isolated. We argue against this view, and in favor of the alternative open systems view, for which systems interacting with their environment are conceived of as (...) fundamental, and the environment's influence is represented via the dynamical equations that govern the system's evolution. Taking quantum theories of closed and open systems as our case study, and considering three alternative notions of fundamentality: (i) ontic fundamentality, (ii) epistemic fundamentality, and (iii) explanatory fundamentality, we argue that the open systems view is fundamental, and that this has important implications for the philosophy of physics, the philosophy of science, and for metaphysics. (shrink)

The second law of thermodynamics is traditionally interpreted as a coarse-grained result of classical mechanics. Recently its relation with quantum mechanical processes such as decoherence and measurement has been revealed in literature. In this paper we will formulate the second law and the associated time irreversibility following Everett’s idea: systems entangled with an object getting to know the branch in which they live. Accounting for this self-locating knowledge, we get two forms of entropy: objective entropy measuring the uncertainty of the (...) state of the object alone, and subjective entropy measuring the information carried by the self-locating knowledge. By showing that the summation of the two forms of entropy is a conserved and perspective-free quantity, we interpret the second law as a statement of irreversibility in knowledge acquisition. This essentially derives the thermodynamic arrow of time from the subjective arrow of time, and provides a unified explanation for varieties of the second law, as well as the past hypothesis. (shrink)

This paper discusses the epistemic status of biology from the standpoint of the systemic approach to living systems based on the notion of biological autonomy. This approach aims to provide an understanding of the distinctive character of biological systems and this paper analyses its theoretical and epistemological dimensions. The paper argues that, considered from this perspective, biological systems are examples of emergent phenomena, that the biological domain exhibits special features with respect to other domains, and that biology as a discipline (...) employs some core concepts, such as teleology, function, regulation among others, that are irreducible to those employed in physics and chemistry. It addresses the claim made by Jacques Monod that biology as a science is marginal. It argues that biology is general insofar as it constitutes a paradigmatic example of complexity science, both in terms of how it defines the theoretical object of study and of the epistemology and heuristics employed. As such, biology may provide lessons that can be applied more widely to develop an epistemology of complex systems. (shrink)

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we (...) provide an overview of the Google Quantum Team’s experiments, then identify some open questions in the quest to demonstrate quantum supremacy. (shrink)

Within the field of quantum gravity, there is an influential research program developing the connection between quantum entanglement and spatiotemporal distance. Quantum information theory gives us highly refined tools for quantifying quantum entanglement such as the entanglement entropy. Through a series of well-confirmed results, it has been shown how these facts about the entanglement entropy of component systems may be connected to facts about spatiotemporal distance. Physicists are seeing these results as yielding promising methods for better understanding the emergence of (...) (the dynamical) spacetime (of general relativity) from more fundamental quantum theories, and moreover, as promising for the development of a nonperturbative theory of quantum gravity. However, to what extent does the case for the entanglement entropy-distance link provide evidence that spacetime structure is nonfundamental and emergent from nongravitational degrees of freedom? I will show that a closer look at the results lends support only to a weaker conclusion, that the facts about quantum entanglement are constrained by facts about spatiotemporal distance, and not that they are the basis from which facts about spatiotemporal distance emerge. (shrink)

A recent no-go theorem (Frauchiger and Renner in Nat Commun 9(1):3711, 2018) establishes a contradiction from a specific application of quantum theory to a multi- agent setting. The proof of this theorem relies heavily on notions such as ‘knows’ or ‘is certain that’. This has stimulated an analysis of the theorem by Nurgalieva and del Rio (in: Selinger P, Chiribella G (eds) Proceedings of the 15th international conference on quantum physics and logic (QPL 2018). EPTCS 287, Open Publishing Association, Waterloo, (...) 2018), in which they claim that it shows the “[i]nadequacy of modal logic in quantum settings” (ibid.). In this paper, we will offer a significantly extended and refined reconstruction of the theorem in multi-agent modal logic. We will then show that a thorough reconstruction of the proof as given by Frauchiger and Renner requires the reflexivity of access relations (system T). However, a stronger theorem is possible that already follows in serial frames, and hence also holds in systems of doxastic logic (such as KD45). After proving this, we will discuss the general implications for different interpretations of quantum probabilities as well as several options for dealing with the result. (shrink)

There is a new theory of information based on logic. The definition of Shannon entropy as well as the notions on joint, conditional, and mutual entropy as defined by Shannon can all be derived by a uniform transformation from the corresponding formulas of logical information theory. Information is first defined in terms of sets of distinctions without using any probability measure. When a probability measure is introduced, the logical entropies are simply the values of the probability measure on the sets (...) of distinctions. The compound notions of joint, conditional, and mutual entropies are obtained as the values of the measure, respectively, on the union, difference, and intersection of the sets of distinctions. These compound notions of logical entropy satisfy the usual Venn diagram relationships since they are values of a measure. The uniform transformation into the formulas for Shannon entropy is linear so it explains the long-noted fact that the Shannon formulas satisfy the Venn diagram relations--as an analogy or mnemonic--since Shannon entropy is not a measure on a given set. What is the logic that gives rise to logical information theory? Partitions are dual to subsets, and the logic of partitions was recently developed in a dual/parallel relationship to the Boolean logic of subsets. Boole developed logical probability theory as the normalized counting measure on subsets. Similarly the normalized counting measure on partitions is logical entropy--when the partitions are represented as the set of distinctions that is the complement to the equivalence relation for the partition. In this manner, logical information theory provides the set-theoretic and measure-theoretic foundations for information theory. The Shannon theory is then derived by the transformation that replaces the counting of distinctions with the counting of the number of binary partitions it takes, on average, to make the same distinctions by uniquely encoding the distinct elements--which is why the Shannon theory perfectly dovetails into coding and communications theory. (shrink)

A longstanding issue in attempts to understand the Everett (Many-Worlds) approach to quantum mechanics is the origin of the Born rule: why is the probability given by the square of the amplitude? Following Vaidman, we note that observers are in a position of self-locating uncertainty during the period between the branches of the wave function splitting via decoherence and the observer registering the outcome of the measurement. In this period it is tempting to regard each branch as equiprobable, but we (...) argue that the temptation should be resisted. Applying lessons from this analysis, we demonstrate (using methods similar to those of Zurek's envariance-based derivation) that the Born rule is the uniquely rational way of apportioning credence in Everettian quantum mechanics. In doing so, we rely on a single key principle: changes purely to the environment do not affect the probabilities one ought to assign to measurement outcomes in a local subsystem. We arrive at a method for assigning probabilities in cases that involve both classical and quantum self-locating uncertainty. This method provides unique answers to quantum Sleeping Beauty problems, as well as a well-defined procedure for calculating probabilities in quantum cosmological multiverses with multiple similar observers. (shrink)

The notion of a partition on a set is mathematically dual to the notion of a subset of a set, so there is a logic of partitions dual to Boole's logic of subsets (Boolean logic is usually mis-specified as "propositional" logic). The notion of an element of a subset has as its dual the notion of a distinction of a partition (a pair of elements in different blocks). Boole developed finite logical probability as the normalized counting measure on elements of (...) subsets so there is a dual concept of logical entropy which is the normalized counting measure on distinctions of partitions. Thus the logical notion of information is a measure of distinctions. Classical logical entropy naturally extends to the notion of quantum logical entropy which provides a more natural and informative alternative to the usual Von Neumann entropy in quantum information theory. The quantum logical entropy of a post-measurement density matrix has the simple interpretation as the probability that two independent measurements of the same state using the same observable will have different results. The main result of the paper is that the increase in quantum logical entropy due to a projective measurement of a pure state is the sum of the absolute squares of the off-diagonal entries ("coherences") of the pure state density matrix that are zeroed ("decohered") by the measurement, i.e., the measure of the distinctions ("decoherences") created by the measurement. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to (...) the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

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)

In quantum theory every state can be diagonalized, i.e. decomposed as a convex combination of perfectly distinguishable pure states. This elementary structure plays an ubiquitous role in quantum mechanics, quantum information theory, and quantum statistical mechanics, where it provides the foundation for the notions of majorization and entropy. A natural question then arises: can we reconstruct these notions from purely operational axioms? We address this question in the framework of general probabilistic theories, presenting a set of axioms that guarantee that (...) every state can be diagonalized. The first axiom is Causality, which ensures that the marginal of a bipartite state is well defined. Then, Purity Preservation states that the set of pure transformations is closed under composition. The third axiom is Purification, which allows to assign a pure state to the composition of a system with its environment. Finally, we introduce the axiom of Pure Sharpness, stating that for every system there exists at least one pure effect occurring with unit probability on some state. For theories satisfying our four axioms, we show a constructive algorithm for diagonalizing every given state. The diagonalization result allows us to formulate a majorization criterion that captures the convertibility of states in the operational resource theory of purity, where random reversible transformations are regarded as free operations. (shrink)

Christopher G. Timpson provides the first full-length philosophical treatment of quantum information theory and the questions it raises for our understanding of the quantum world. He argues for an ontologically deflationary account of the nature of quantum information, which is grounded in a revisionary analysis of the concepts of information.

In the present paper we develop different arguments to show that there are no reasons to consider that there exists quantum information as qualitatively different than Shannon information. There is only one kind of information, which can be coded by means of orthogonal or non-orthogonal states. The analogy between Shannon’s theory and Schumacher’s theory is confined to coding theorems. The attempt to extend the analogy beyond this original scope leads to a concept of quantum information that becomes indistinguishable from that (...) of quantum state. But information is essentially linked with communication, as it is clear in both Shannon’s and Schumacher’s proposals. If we detach information from this link, we are not talking about information but about quantum mechanics. We also stress the neutrality of information with respect to the physical theories that describe the systems used for its implementation. This view opens the way towards a non-reductive unification of physics: if different physical theories can be reconstructed on the same neutral informational basis, they could be meaningfully compared with no need of searching for reductive links among them. (shrink)

This paper shows how the classical finite probability theory (with equiprobable outcomes) can be reinterpreted and recast as the quantum probability calculus of a pedagogical or "toy" model of quantum mechanics over sets (QM/sets). There are two parts. The notion of an "event" is reinterpreted from being an epistemological state of indefiniteness to being an objective state of indefiniteness. And the mathematical framework of finite probability theory is recast as the quantum probability calculus for QM/sets. The point is not to (...) clarify finite probability theory but to elucidate quantum mechanics itself by seeing some of its quantum features in a classical setting. (shrink)

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(\frac{1}{2},\frac{1}{2})$\end{document} and radius \documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\frac{1}{2}$\end{document} ). (shrink)

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 (...) states. I begin the dissertation by considering, in Chapter 2, the most popular of the candidate physical explanations for quantum speedup: the many worlds explanation of quantum computation. I argue that, although it is inspired by the neo-Everettian interpretation of quantum mechanics, unlike the latter it does not have the conceptual resources required to overcome objections such as the so-called `preferred basis objection'. I further argue that the many worlds explanation, at best, can serve as a good description of the physical process which takes place in so-called network-based computation, but that it is incompatible with other models of computation such as cluster state quantum computing. I next consider, in Chapter 3, a common component of most other candidate explanations of quantum speedup: quantum entanglement. I investigate whether entanglement can be said to be a necessary component of any explanation for quantum speedup, and I consider two major purported counter-examples to this claim. I argue that neither of these, in fact, show that entanglement is unnecessary for speedup, and that, on the contrary, we should conclude that it is. In Chapters 4 and 5 I then ask whether entanglement can be said to be sufficient as well. In Chapter 4 I argue that despite a result that seems to indicate the contrary, entanglement, considered as a resource, can be seen as sufficient to enable quantum speedup. Finally, in Chapter 5 I argue that entanglement is sufficient to explain quantum speedup as well. (shrink)

Classical (Bayesian) probability (CP) theory has led to an influential research tradition for modeling cognitive processes. Cognitive scientists have been trained to work with CP principles for so long that it is hard even to imagine alternative ways to formalize probabilities. However, in physics, quantum probability (QP) theory has been the dominant probabilistic approach for nearly 100 years. Could QP theory provide us with any advantages in cognitive modeling as well? Note first that both CP and QP theory share the (...) fundamental assumption that it is possible to model cognition on the basis of formal, probabilistic principles. But why consider a QP approach? The answers are that (1) there are many well-established empirical findings (e.g., from the influential Tversky, Kahneman research tradition) that are hard to reconcile with CP principles; and (2) these same findings have natural and straightforward explanations with quantum principles. In QP theory, probabilistic assessment is often strongly context- and order-dependent, individual states can be superposition states (that are impossible to associate with specific values), and composite systems can be entangled (they cannot be decomposed into their subsystems). All these characteristics appear perplexing from a classical perspective. However, our thesis is that they provide a more accurate and powerful account of certain cognitive processes. We first introduce QP theory and illustrate its application with psychological examples. We then review empirical findings that motivate the use of quantum theory in cognitive theory, but also discuss ways in which QP and CP theories converge. Finally, we consider the implications of a QP theory approach to cognition for human rationality. (shrink)

From the structure of quantum dynamics for closed and open systems, we describe several general results about information flow between interacting systems, which can be expressed in diagrammatic form. Conditions on information flow (e.g., that no information is transferred from system A to system B) imply that the overall dynamical evolution has a particular structure. We also remark that one simple type of two-qubit interaction, the unitary CNOT gate, cannot be represented by local operations and a single simultaneous information exchange.

The interpretation of quantum mechanics is an area of increasing interest to many working physicists. In particular, interest has come from those involved in quantum computing and information theory, as there has always been a strong foundational element in this field. This paper introduces one interpretation of quantum mechanics, a modern ‘many-worlds’ theory, from the perspective of quantum computation. Reasons for seeking to interpret quantum mechanics are discussed, then the specific ‘neo-Everettian’ theory is introduced and its claim as the best (...) available interpretation defended. The main objections to the interpretation, including the so-called “problem of probability” are shown to fail. The local nature of the interpretation is demonstrated, and the implications of this both for the interpretation and for quantum mechanics more generally are discussed. Finally, the consequences of the theory for quantum computation are investigated, and common objections to using many worlds to describe quantum computing are answered. We find that using this particular many-worlds theory as a physical foundation for quantum computation gives several distinct advantages over other interpretations, and over not interpreting quantum theory at all. (shrink)

The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are reviewed and an emerging link between them is outlined. It is shown that these methods employ a wide range of important mathematical concepts like, e.g., Fourier transforms, Galois fields and rings, finite, and related projective geometries, and entanglement, to mention a few. Some applications of the theory to quantum information tasks are also mentioned.

Experiments with remote perception and Random Event Generators (REG) performed over the last decades show small but significant anomalous effects. Since these effects seem to be independent of spatial and temporal distance, they appear to be in disagreement with the standard scientific worldview. A very simple explanation of quantum mechanics is pre- sented, rejecting all unjustified claims about the world. A view of mind in agreement with cognitive neuroscience is introduced. It is argued that mind and consciousness are emer- gent (...) properties of the brain and are understandable without any nonphysical assumptions. A plausible explanation of the results of anomalous experiments, based on the concept of synchronicity, introduced by C.G. Jung and advocated by W. Pauli, is offered. A proof is given that strong correlations should exist between any systems that once interacted. Synchronicity events between parts of the brain and physical objects may be sufficient to explain the results of anomalous experiments. Standard physics is sufficient to understand these phenomena. Motto. (shrink)

Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required.Pseudo-telepathy is a surprising application of (...) quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and not-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors. (shrink)

In recent years quantum probability models have been used to explain many aspects of human decision making, and as such quantum models have been considered a viable alternative to Bayesian models based on classical probability. One criticism that is often leveled at both kinds of models is that they lack a clear interpretation in terms of psychological mechanisms. In this paper we discuss the mechanistic underpinnings of a quantum walk model of human decision making and response time. The quantum walk (...) model is compared to standard sequential sampling models, and the architectural assumptions of both are considered. In particular, we show that the quantum model has a natural interpretation in terms of a cognitive architecture that is both massively parallel and involves both co-operative and competitive interactions between units. Additionally, we introduce a family of models that includes aspects of the classical and quantum walk models. (shrink)

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...) mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally. This gives impetus to propose and justify a more plausible starting point for an extension to the classical paradigm that is physically possible, at least in principle. Instead of attempting to rely on infinities such as idealized limits of infinite time or numerical precision, or some other physically unattainable source, one should focus on extending the classical paradigm to better encapsulate modern computational problems that are not well-expressed/modeled by the closed-system paradigm of the Turing machine. I present the first steps toward this goal by considering contemporary computational problems dealing with intractability and issues surrounding cyber-physical systems, and argue that a reasonable extension to the classical paradigm should focus on these issues in order to be practically viable. (shrink)

In the Bayesian approach to quantum mechanics, probabilities—and thus quantum states—represent an agent’s degrees of belief, rather than corresponding to objective properties of physical systems. In this paper we investigate the concept of certainty in quantum mechanics. Particularly, we show how the probability-1 predictions derived from pure quantum states highlight a fundamental difference between our Bayesian approach, on the one hand, and Copenhagen and similar interpretations on the other. We first review the main arguments for the general claim that probabilities (...) always represent degrees of belief. We then argue that a quantum state prepared by some physical device always depends on an agent’s prior beliefs, implying that the probability-1 predictions derived from that state also depend on the agent’s prior beliefs. Quantum certainty is therefore always some agent’s certainty. Conversely, if facts about an experimental setup could imply agent-independent certainty for a measurement outcome, as in many Copenhagen-like interpretations, that outcome would effectively correspond to a preexisting system property. The idea that measurement outcomes occurring with certainty correspond to preexisting system properties is, however, in conflict with locality. We emphasize this by giving a version of an argument of Stairs [(1983). Quantum logic, realism, and value-definiteness. Philosophy of Science, 50, 578], which applies the Kochen–Specker theorem to an entangled bipartite system. (shrink)

Entropy is ubiquitous in physics, and it plays important roles in numerous other disciplines ranging from logic and statistics to biology and economics. However, a closer look reveals a complicated picture: entropy is defined differently in different contexts, and even within the same domain different notions of entropy are at work. Some of these are defined in terms of probabilities, others are not. The aim of this chapter is to arrive at an understanding of some of the most important notions (...) of entropy and to clarify the relations between them, After setting the stage by introducing the thermodynamic entropy, we discuss notions of entropy in information theory, statistical mechanics, dynamical systems theory and fractal geometry. (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)

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

I discuss the quantum mechanical theory of consciousness and freewill offered by Stapp (1993, 1995, 2000, 2004). First I show that decoherence-based arguments do not work against this theory. Then discuss a number of problems with the theory: Stapp's separate accounts of consciousness and freewill are incompatible, the interpretations of QM they are tied to are questionable, the Zeno effect could not enable freewill as he suggests because weakness of will would then be ubiquitous, and the holism of measurement in (...) QM is not a good explanation of the unity of consciousness for essentially the same reason that local interactions may seem incapable of accounting for it. (shrink)

Among the alternatives of non-relativistic quantum mechanics (NRQM) there are those that give different predictions than quantum mechanics in yet-untested circumstances, while remaining compatible with current empirical findings. In order to test these predictions, one must isolate one’s system from environmental induced decoherence, which, on the standard view of NRQM, is the dynamical mechanism that is responsible for the ‘apparent’ collapse in open quantum systems. But while recent advances in condensed-matter physics may lead in the near future to experimental setups (...) that will allow one to test the two hypotheses, namely genuine collapse vs. decoherence, hence make progress toward a solution to the quantum measurement problem, those philosophers and physicists who are advocating an information-theoretic approach to the foundations of quantum mechanics are still unwilling to acknowledge the empirical character of the issue at stake. Here I argue that in doing so they are displaying an unwarranted double standard. r 2007 Elsevier Ltd. All rights reserved. (shrink)

This is a preliminary version of an article to appear in the forthcoming Ashgate Companion to the New Philosophy of Physics.In it, I aim to review, in a way accessible to foundationally interested physicists as well as physics-informed philosophers, just where we have got to in the quest for a solution to the measurement problem. I don't advocate any particular approach to the measurement problem (not here, at any rate!) but I do focus on the importance of decoherence theory to (...) modern attempts to solve the measurement problem, and I am fairly sharply critical of some aspects of the "traditional" formulation of the problem. (shrink)

Deutsch and Hayden claim to have provided an account of quantum mechanics which is particularly local, and which clarifies the nature of information transmission in entangled quantum systems. In this paper, a perspicuous description of their formalism is offered and their claim assessed. It proves essential to distinguish, as Deutsch and Hayden do not, between two ways of interpreting the formalism. On the first, conservative, interpretation, no benefits with respect to locality accrue that are not already available on either an (...) Everettian or a statistical interpretation; and the conclusions regarding information flow are equivocal. The second, ontological, interpretation, offers a framework with the novel feature that global properties of quantum systems are reduced to local ones; but no conclusions follow concerning information flow in more standard quantum mechanics. (shrink)

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)

A remarkable theorem by Clifton, Bub and Halvorson (2003) (CBH) characterizes quantum theory in terms of information--theoretic principles. According to Bub (2004, 2005) the philosophical significance of the theorem is that quantum theory should be regarded as a ``principle'' theory about (quantum) information rather than a ``constructive'' theory about the dynamics of quantum systems. Here we criticize Bub's principle approach arguing that if the mathematical formalism of quantum mechanics remains intact then there is no escape route from solving the measurement (...) problem by constructive theories. We further propose a (Wigner--type) thought experiment that we argue demonstrates that quantum mechanics on the information--theoretic approach is incomplete. (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.

This paper intends to contribute to the emerging literature on the ethical problems posed by quantum computing and quantum technologies in general. The key ethical questions are as follows: Does quantum computing pose new ethical problems, or are those raised by quantum computing just a different version of the same ethical problems raised by other technologies, such as nanotechnologies, nuclear plants, or cloud computing? In other words, what is new in quantum computing from an ethical point of view? The paper (...) aims to answer these two questions by (a) developing an analysis of the existing literature on the ethical and social aspects of quantum computing and (b) identifying and analyzing the main ethical problems posed by quantum computing. The conclusion is that quantum computing poses completely new ethical issues that require new conceptual tools and methods. (shrink)

The inaugural title in the new, Open Access series BSPS Open, The Material Theory of Induction will initiate a new tradition in the analysis of inductive inference. The fundamental burden of a theory of inductive inference is to determine which are the good inductive inferences or relations of inductive support and why it is that they are so. The traditional approach is modeled on that taken in accounts of deductive inference. It seeks universally applicable schemas or rules or a single (...) formal device, such as the probability calculus. After millennia of halting efforts, none of these approaches has been unequivocally successful and debates between approaches persist. The Material Theory of Induction identifies the source of these enduring problems in the assumption taken at the outset: that inductive inference can be accommodated by a single formal account with universal applicability. Instead, it argues that that there is no single, universally applicable formal account. Rather, each domain has an inductive logic native to it. Which that is, and its extent, is determined by the facts prevailing in that domain. Paying close attention to how inductive inference is conducted in science and copiously illustrated with real-world examples, The Material Theory of Induction will initiate a new tradition in the analysis of inductive inference. (shrink)

According to a conventional view, there exists no common-cause model of quantum correlations satisfying locality requirements. In fact, Bell's inequality is derived from some locality conditions and the assumption that the common cause exists, and the violation of the inequality has been experimentally verified. On the other hand, some researchers argue that in the derivation of the inequality the existence of a common common-cause for multiple correlations is implicitly assumed, and that the assumption is unreasonably strong. According to their idea, (...) what is necessary for explaining the quantum correlation is a common cause for each correlation. However, in this paper, we will show that in almost all entangled states we can not construct a local model that is consistent with quantum mechanical prediction even when we require only the existence of a common cause of each correlation. (shrink)

There are quantum solutions for computational problems that make use of interference at some stage in the algorithm. These stages can be mapped into the physical setting of a single particle travelling through a many-armed interferometer. There has been recent foundational interest in theories beyond quantum theory. Here, we present a generalized formulation of computation in the context of a many-armed interferometer, and explore how theories can differ from quantum theory and still perform distributed calculations in this set-up. We shall (...) see that quaternionic quantum theory proves a suitable candidate, whereas box-world does not. We also find that a classical hidden variable model first presented by Spekkens : 32100, 2007) can also be used for this type of computation due to the epistemic restriction placed on the hidden variable. (shrink)

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 (...) a discussion of computational machines. This, in turn, helps us to understand that the appropriate conclusion to draw from the Gottesman–Knill theorem is not that entanglement is insufficient to enable a quantum performance advantage, but rather that if we limit ourselves to the operations referred to in the Gottesman–Knill theorem, we will not have used the resources provided by an entangled quantum system to their full potential. (shrink)

Recently, Roger Colbeck and Renato Renner have claimed that ‘[n]o extension of quantum theory can have improved predictive power'. If correct, this is a spectacular impossibility theorem for hidden variable theories, which is more general than the theorems of Bell and Leggett. Also, C&R have used their claim in attempt to prove that a system's quantum-mechanical wave function is in a one-to-one correspondence with its ‘ontic' state. C&R's claim essentially means that in any hidden variable theory that is compatible with (...) quantum-mechanical predictions, probabilities of measurement outcomes are independent of these hidden variables. This makes such variables otiose. On closer inspection, however, the generality and validity of the claim can be contested. First, it is based on an assumption called 'Freedom of Choice'. As the name suggests, this assumption involves the independence of an experimenter's choice of measurement settings. But in the way C&R define this assumption, a no-signalling condition is surreptitiously presupposed, making the assumption less innocent than it sounds. When using this definition, any hidden variable theory violating Parameter Independence, such as Bohmian Mechanics, is immediately shown to be incompatible with quantum-mechanical predictions. Also, the argument of C&R is hard to follow and their mathematical derivation contains several gaps, some of which cannot be closed in the way they suggest. We shall show that these gaps can be filled. The issue with the 'Freedom of Choice' assumption can be circumvented by explicitly assuming Parameter Independence. This makes the result less general, but better founded. We then obtain an impossibility theorem for hidden variable theories satisfying Parameter Independence only. As stated above, such hidden variable theories are impossible in the sense that any supplemental variables have no bearing on outcome probabilities, and are therefore trivial. So, while quantum mechanics itself satisfies Parameter Independence, if a variable is added that changes the outcome probabilities, however slightly, Parameter Independence must be violated. (shrink)