Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.

Experts in the field explore the connections across physics, quantum logic, and quantum computing.

This book provides a general survey of the main concepts, questions and results that have been developed in the recent interactions between quantum information, quantum computation and logic. Divided into 10 chapters, the books starts with an introduction of the main concepts of the quantum-theoretic formalism used in quantum information. It then gives a synthetic presentation of the main “mathematical characters” of the quantum computational game: qubits, quregisters, mixtures of quregisters, quantum logical gates. Next, the book investigates the puzzling entanglement-phenomena and logically analyses the Einstein–Podolsky–Rosen paradox and introduces the reader to quantum computational logics, and new forms of quantum logic. The middle chapters investigate the possibility of a quantum computational semantics for a language that can express sentences like “Alice knows that everybody knows that she is pretty”, explore the mathematical concept of quantum Turing machine, and illustrate some characteristic examples that arise in the framework of musical languages. The book concludes with an analysis of recent discussions, and contains a Mathematical Appendix which is a survey of the definitions of all main mathematical concepts used in the book.

In this expanded edition of Quanta, Logic and Spacetime, the logical base is greatly broadened and quantum-computational aspects of the approach are brought to the fore. The first two parts of this edition may indeed be regarded as providing a self-contained and logic-based foundation for ? and an introduction to ? the enterprise known as quantum computing.The rest of the work takes on the task (as in the first edition) of computing from first principles certain dynamical expressions which turn out to compare favorably with the Lagrangian densities of the (massless) Standard Model, including gravity. The logic of this process is now subject to greater formal rigor than was possible in the first edition, and the central thesis ? that quantum physics at a fundamental level may itself be realized as a species of quantum computation ? is strongly underscored.

This work has grown out of the lecture notes that were prepared for a series of seminars on some selected topics in quantum logic. The seminars were delivered during the first semester of the 1993/1994 academic year in the Unit for Foundations of Science of the Department of History and Foundations of Mathematics and Science, Faculty of Physics, Utrecht University, The Netherlands, while I was staying in that Unit on a European Community Research Grant, and in the Center for Philosophy of Science, University of Pittsburgh, U. S. A. , where I was staying during the 1994/1995 academic year as a Visiting Fellow on a Fulbright Research Grant, and where I also was supported by the Istvan Szechenyi Scholarship Foundation. The financial support provided by these foundations, by the Center for Philosophy of Science and by the European Community is greatly acknowledged, and I wish to thank D. Dieks, the professor of the Foundations Group in Utrecht and G. Massey, the director of the Center for Philosophy of Science in Pittsburgh for making my stay at the respective institutions possible. I also wish to thank both the members of the Foundations Group in Utrecht, especially D. Dieks, C. Lutz, F. Muller, J. Uffink and P. Vermaas and the participants in the seminars at the Center for Philosophy of Science in Pittsburgh, especially N. Belnap, J. Earman, A. Janis, J. Norton, and J.

"Is quantum logic really logic?" This book argues for a positive answer to this question once and for all. There are many quantum logics and their structures are delightfully varied. The most radical aspect of quantum reasoning is reflected in unsharp quantum logics, a special heterodox branch of fuzzy thinking. For the first time, the whole story of Quantum Logic is told; from its beginnings to the most recent logical investigations of various types of quantum phenomena, including quantum computation. Reasoning in Quantum Theory is designed for logicians, yet amenable to advanced graduate students and researchers of other disciplines.

Shor's groundbreaking algorithms for integer factoring and discrete logarithm [58], along with their later generalizations 116, 35, 49, 18], demonstrated a unique ability of quantum computers to solve problems defined on abelian groups. In this thesis, we study ways in which that ability can be leveraged in order to solve problems on more complex structures such as non-abelian groups and hypergroups. This leads to new quantum algorithms for the hidden subgroup problem on nilpotent groups whose order is a product of large primes, the hidden subhypergroup problem on both strongly integral hypergroups and ultragroups, testing equivalence of group extensions, and computing the component parts of the cohomology groups of both group extensions and a generalization of simplicial complexes, amongst other problems. For each of those listed, we also show that no classical algorithm can achieve similar efficiency under standard cryptographic assumptions.