DOCSLIB.ORG

Alternative Theories in Quantum Foundations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Alternative theories in Quantum Foundations Andr´eO. Ranchin Submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Physics of Imperial College London July 2016 Supervised by Bob Coecke and Terry Rudolph Department of Physics Imperial College London Alternative theories in Quantum Foundations Andr´eO. Ranchin Submitted for the degree of Doctor of Philosophy July 2016 Abstract Abstraction is an important driving force in theoretical physics. New insights often accompany the creation of physical frameworks which are both comprehensive and parsi- monious. In particular, the analysis of alternative sets of theories which exhibit similar structural features as quantum theory has yielded important new results and physical understanding. An important task is to undertake a thorough analysis and classification of quantum-like theories. In this thesis, we take a step in this direction, moving towards a synthetic description of alternative theories in quantum foundations. After a brief philosophical introduction, we give a presentation of the mathematical concepts underpinning the foundations of physics, followed by an introduction to the found- ations of quantum mechanics. The core of the thesis consists of three results chapters based on the articles in the author's publications page. Chapter 4 analyses the logic of stabilizer quantum mechanics and provides a complete set of circuit equations for this sub-theory of quantum mechanics. Chapter 5 describes how quantum-like theories can be classified in a periodic table of theories. A pictorial calculus for alternative physical theories, called the ZX calculus for qudits, is then introduced and used as a tool to depict particular examples of quantum-like theories, including qudit stabilizer quantum mechanics and the Spekkens- Schreiber toy theory. Chapter 6 presents an alternative set of quantum-like theories, called quantum collapse models. A novel quantum collapse model, where the rate of collapse depends on the Quantum Integrated Information of a physical system, is introduced and discussed in some detail. We then conclude with a brief summary of the main results. Acknowledgments Scientific research resembles the activity of an underground explorer who undertakes the arduous task of digging tunnels and constructing elaborate subterranean passages in search of elusive precious minerals. Naturally, this process { which will more often lead to a frustrating conclusion than to the launch of a fruitful enterprise { cannot be undertaken alone. Friends and family provide a pillar of strength which buffers the impact of the inevitable collapse of theoretical caverns. Fortunately, there is only a minute risk of suffocation and it is only in a metaphorical sense that one may end up covered in dirt and trapped in a confined space. Moreover, failure is a far better teacher than success. I have certainly learnt many things in the last few years. It is my pleasure to mention some of the people who have played an essential role throughout my PhD. First of all, I would like to thank my supervisors Bob Coecke and Terry Rudolph for their insightful help and helpful insights, kindly given whenever necessary. Their patience and understanding provided an invaluable catalyst for intellectual development throughout my years of academic study in London and Oxford. I am also much obliged to Sandu Popescu for introducing me to the fascinating world of quantum physics research and encouraging me to pursue further study. I have had the privilege of working with not just one but two exceptional circles of colleagues: the Oxford Quantum group and the Imperial Controlled Quantum Dynamics group. A particular mention should go to Miriam Backens, Raymond Lal, William Zeng, ii ACKNOWLEDGMENTS iii Ross Duncan, Aleks Kissinger, John Selby, Sean Mansfield, Rui Soares Barbosa, Nadish De Silva, Hugo Nava Kopp, Dan Marsden, Jonathan Barrett, Destiny Chen and to the eleven members of the CQD DTC Cohort 3. Mihai-Dorian Vidrighin and Mark Mitchison especially deserve my appreciation for their friendship and for their irreplaceable assistance and advice. A particular word of thanks should go to the directors of the CQD DTC, particularly Danny Segal, whose compassionate words of support provided solace at a most difficult time. I must also mention the staff of the BHOC, without whose effort and care, the present work would not have seen the light of day. Although it goes without saying, I would like to sincerely thank my parents for their constant encouragement as well as for the key role they have played in my academic and personal development. Finally, my deepest gratitude goes to Sylvia, whose thoughtful and unfailing support has provided an invaluable bedrock for any achievement of mine. I acknowledge financial support from the EPSRC. Declaration of Originality: I declare that all the work presented in this thesis is my own or is properly referenced such that the original source is clearly stated. Copyright Declaration: The copyright of this thesis rests with the author and is made available under a Creative Commons Attribution Non-Commercial No Derivatives licence. Researchers are free to copy, distribute or transmit the thesis on the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work. Author's publications 1. A. O. Ranchin, B. Coecke, \Complete set of circuit equations for Stabilizer Quantum Mechanics". Physical Review A, 90, 012109 (2014). 2. A. O. Ranchin \Depicting qudit quantum mechanics and mutually unbiased qudit theories". EPTCS Quantum Physics and Logic 2014, 172 (2014). 3. K. Kremnizer, A. O. Ranchin \Integrated Information-induced quantum col- lapse". Foundations of Physics, 45 (2015). iv Contents Acknowledgments ii Author's publications iv List of Figures viii 1 Introduction 1 2 Background I: Mathematical tools 8 2.1 Set theory . 9 2.1.1 Axiomatic set theory . 9 2.1.2 Relations and functions . 11 2.1.3 Numbers . 12 2.2 Group Theory . 14 2.3 Algebraic structures . 19 2.3.1 Rings, Fields and Galois theory . 19 2.3.2 Linear Algebra and Graph theory . 24 2.4 Topology and Hilbert spaces . 28 2.4.1 Topology . 28 2.4.2 Topological vector spaces . 32 2.5 Category theory . 36 2.5.1 Categories and functors . 36 2.5.2 Limits . 37 2.5.3 Examples of categories . 38 2.5.4 Natural Transformations and adjoints . 39 2.5.5 Categorical quantum mechanics . 41 3 Background II: Quantum theory 47 3.1 Operational theories . 47 3.2 Quantum mechanics introduced . 49 3.2.1 Orthodox postulates . 49 3.2.2 Operational axioms . 51 3.3 Quantum computation . 52 vi 3.3.1 Quantum circuits . 52 3.3.2 Other quantum computation models . 55 3.4 Non locality and Contextuality . 57 3.4.1 Realism and quantum theory . 57 3.4.2 EPR . 57 3.4.3 Bohr response . 58 3.4.4 Hidden variables and Von Neumann's no go theorem . 59 3.4.5 Bell's theorem and the CHSH inequality . 61 3.4.6 Cirelson bound . 63 3.4.7 Popescu Rohrlich boxes . 63 3.4.8 Generalized CHSH inequality . 64 3.4.9 Mermin non-locality . 65 3.4.10 The over-protective seer . 67 3.4.11 Gleason's theorem . 68 3.4.12 Bell corollary of Gleason's theorem . 69 3.4.13 Kochen Specker theorem . 70 3.4.14 Mermin magic square . 71 3.4.15 Leggett-Garg inequality . 72 3.5 Ontological models for quantum mechanics . 73 3.5.1 Examples of ontological models . 74 3.5.2 Spekkens toy theory . 77 3.5.3 Contextuality for ontological models . 79 3.5.4 PBR theorem . 81 3.6 Ontological interpretations of quantum theory . 83 3.6.1 Bohmian mechanics . 83 3.6.2 Many-worlds theory . 84 3.6.3 Collapse models . 86 3.7 Generalized probabilistic theories . 88 3.7.1 Hardy's operational framework . 89 3.7.2 Information theoretic constraints for quantum theory . 91 3.7.3 Information processing in generalized probabilistic theories . 92 4 The logic of Stabilizer Quantum Mechanics 94 4.1 Introduction . 96 4.2 Stabilizer quantum theory . 98 4.3 ZX network . 99 4.4 Completeness of the ZX calculus . 102 4.5 Quantum circuits for the ZX network axioms . 104 4.6 Proof of the Equivalence Lemma . 106 4.7 A complete set of circuit equations for stabilizer quantum mechanics . 116 4.8 Derivation of an equation between stabilizer quantum circuits from the com- plete set . 120 4.9 Reasoning with the ZX network is easier than using the quantum circuit calculus122 4.10 Conclusion . 123 vii 5 A periodic table of quantum-like theories 125 5.1 Introduction . 128 5.2 Explicit models of theories . 130 5.2.1 Qudit stabilizer quantum mechanics . 131 5.2.2 Spekkens toy theory in higher dimensions . 132 5.3 Depicting qudit quantum mechanics and toy models . 135 5.3.1 Derivation of the qudit ZX calculus . 135 5.3.2 The ZX calculus for qudit quantum mechanics: . 144 5.3.3 Mutually unbiased qudit theories . 153 5.3.4 Picturing stabilizer quantum mechanics . 153 5.3.5 Depicting Spekkens-Schreiber toy theory for dits . 159 5.4 A periodic table of quantum-like theories . 166 5.5 Topological Ontological models . 170 5.6 Further work . 174 6 Quantum collapse theories and Quantum Integrated Information 176 6.1 The philosophy of consciousness . 178 6.1.1 History . 178 6.1.2 Philosophical positions . 180 6.1.3 Problems . 181 6.2 Consciousness and Integrated Information . 183 6.3 Calculating the Quantum Integrated Information . 185 6.4 A review of existing quantum collapse theories . 187 6.4.1 Pearle's collapse equation .
Recommended publications
  • Arxiv:1911.07386V2 [Quant-Ph] 25 Nov 2019

    Arxiv:1911.07386V2 [Quant-Ph] 25 Nov 2019

    Ideas Abandoned en Route to QBism Blake C. Stacey1 1Physics Department, University of Massachusetts Boston (Dated: November 26, 2019) The interpretation of quantum mechanics known as QBism developed out of efforts to understand the probabilities arising in quantum physics as Bayesian in character. But this development was neither easy nor without casualties. Many ideas voiced, and even committed to print, during earlier stages of Quantum Bayesianism turn out to be quite fallacious when seen from the vantage point of QBism. If the profession of science history needed a motto, a good candidate would be, “I think you’ll find it’s a bit more complicated than that.” This essay explores a particular application of that catechism, in the generally inconclusive and dubiously reputable area known as quantum foundations. QBism is a research program that can briefly be defined as an interpretation of quantum mechanics in which the ideas of agent and ex- perience are fundamental. A “quantum measurement” is an act that an agent performs on the external world. A “quantum state” is an agent’s encoding of her own personal expectations for what she might experience as a consequence of her actions. Moreover, each measurement outcome is a personal event, an expe- rience specific to the agent who incites it. Subjective judgments thus comprise much of the quantum machinery, but the formalism of the theory establishes the standard to which agents should strive to hold their expectations, and that standard for the relations among beliefs is as objective as any other physical theory [1]. The first use of the term QBism itself in the literature was by Fuchs and Schack in June 2009 [2].
  • A Subtle Introduction to Category Theory

    A Subtle Introduction to Category Theory

    A Subtle Introduction to Category Theory W. J. Zeng Department of Computer Science, Oxford University \Static concepts proved to be very effective intellectual tranquilizers." L. L. Whyte \Our study has revealed Mathematics as an array of forms, codify- ing ideas extracted from human activates and scientific problems and deployed in a network of formal rules, formal definitions, formal axiom systems, explicit theorems with their careful proof and the manifold in- terconnections of these forms...[This view] might be called formal func- tionalism." Saunders Mac Lane Let's dive right in then, shall we? What can we say about the array of forms MacLane speaks of? Claim (Tentative). Category theory is about the formal aspects of this array of forms. Commentary: It might be tempting to put the brakes on right away and first grab hold of what we mean by formal aspects. Instead, rather than trying to present \the formal" as the object of study and category theory as our instrument, we would nudge the reader to consider another perspective. Category theory itself defines formal aspects in much the same way that physics defines physical concepts or laws define legal (and correspondingly illegal) aspects: it embodies them. When we speak of what is formal/physical/legal we inescapably speak of category/physical/legal theory, and vice versa. Thus we pass to the somewhat grammatically awkward revision of our initial claim: Claim (Tentative). Category theory is the formal aspects of this array of forms. Commentary: Let's unpack this a little bit. While individual forms are themselves tautologically formal, arrays of forms and everything else networked in a system lose this tautological formality.
  • Arxiv:2004.01992V2 [Quant-Ph] 31 Jan 2021 Ity [6–20]

    Arxiv:2004.01992V2 [Quant-Ph] 31 Jan 2021 Ity [6–20]

    Hidden Variable Model for Universal Quantum Computation with Magic States on Qubits Michael Zurel,1, 2, ∗ Cihan Okay,1, 2, ∗ and Robert Raussendorf1, 2 1Department of Physics and Astronomy, University of British Columbia, Vancouver, BC, Canada 2Stewart Blusson Quantum Matter Institute, University of British Columbia, Vancouver, BC, Canada (Dated: February 2, 2021) We show that every quantum computation can be described by a probabilistic update of a proba- bility distribution on a finite phase space. Negativity in a quasiprobability function is not required in states or operations. Our result is consistent with Gleason's Theorem and the Pusey-Barrett- Rudolph theorem. It is often pointed out that the fundamental objects In Theorem 2, we apply this to quantum computation in quantum mechanics are amplitudes, not probabilities with magic states, showing that universal quantum com- [1, 2]. This fact notwithstanding, here we construct a de- putation can be classically simulated by the probabilistic scription of universal quantum computation|and hence update of a probability distribution. of all quantum mechanics in finite-dimensional Hilbert This looks all very classical, and therein lies a puzzle. spaces|in terms of a probabilistic update of a probabil- In fact, our Theorem 2 is running up against a number ity distribution. In this formulation, quantum algorithms of no-go theorems: Theorem 2 in [23] and the Pusey- look structurally akin to classical diffusion problems. Barrett-Rudolph (PBR) theorem [24] say that probabil- While this seems implausible, there exists a well-known ity representations for quantum mechanics do not exist, special instance of it: quantum computation with magic and [9{13] show that negativity in certain Wigner func- states (QCM) [3] on a single qubit.
  • Arxiv:1909.06771V2 [Quant-Ph] 19 Sep 2019

    Arxiv:1909.06771V2 [Quant-Ph] 19 Sep 2019

    Quantum PBR Theorem as a Monty Hall Game Del Rajan ID and Matt Visser ID School of Mathematics and Statistics, Victoria University of Wellington, Wellington 6140, New Zealand. (Dated: LATEX-ed September 20, 2019) The quantum Pusey{Barrett{Rudolph (PBR) theorem addresses the question of whether the quantum state corresponds to a -ontic model (system's physical state) or to a -epistemic model (observer's knowledge about the system). We reformulate the PBR theorem as a Monty Hall game, and show that winning probabilities, for switching doors in the game, depend whether it is a -ontic or -epistemic game. For certain cases of the latter, switching doors provides no advantage. We also apply the concepts involved to quantum teleportation, in particular for improving reliability. Introduction: No-go theorems in quantum foundations Furthermore, concepts involved in the PBR proof have are vitally important for our understanding of quantum been used for a particular guessing game [43]. physics. Bell's theorem [1] exemplifies this by showing In this Letter, we reformulate the PBR theorem into that locally realistic models must contradict the experi- a Monty Hall game. This particular gamification of the mental predictions of quantum theory. theorem highlights that winning probabilities, for switch- There are various ways of viewing Bell's theorem ing doors in the game, depend on whether it is a -ontic through the framework of game theory [2]. These are or -epistemic game; we also show that in certain - commonly referred to as nonlocal games, and the best epistemic games switching doors provides no advantage. known example is the CHSH game; in this scenario the This may have consequences for an alternative experi- participants can win the game at a higher probability mental test of the PBR theorem.
  • Compactly Accessible Categories and Quantum Key Distribution

    Compactly Accessible Categories and Quantum Key Distribution

    COMPACTLY ACCESSIBLE CATEGORIES AND QUANTUM KEY DISTRIBUTION CHRIS HEUNEN Institute for Computing and Information Sciences, Radboud University, Nijmegen, the Netherlands Abstract. Compact categories have lately seen renewed interest via applications to quan- tum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum key distribu- tion, that rely on the law of large numbers. To overcome this limitation, we introduce the notion of a compactly accessible category, relying on the extra structure of a factorisation system. This notion allows for infinite dimension while retaining key properties of compact categories: the main technical result is that the choice-of-duals functor on the compact part extends canonically to the whole compactly accessible category. As an example, we model a quantum key distribution protocol and prove its correctness categorically. 1. Introduction Compact categories were first introduced in 1972 as a class of examples in the con- text of the coherence problem [Kel72]. They were subsequently studied first categori- cally [Day77, KL80], and later in relation to linear logic [See89]. Interest has rejuvenated since the exhibition of another aspect: compact categories provide a semantics for quantum computation [AC04, Sel07]. The main virtue of compact categories as models of quantum computation is that from very few axioms, surprisingly many consequences ensue that were postulates explicitly in the traditional Hilbert space formalism, e.g. scalars [Abr05]. More- over, the connection to linear logic provides quantum computation with a resource sensitive type theory of its own [Dun06]. Much of the structure of compact categories is due to a seemingly ingrained ‘finite- dimensionality'.
  • Categories of Quantum and Classical Channels (Extended Abstract)

    Categories of Quantum and Classical Channels (Extended Abstract)

    Categories of Quantum and Classical Channels (extended abstract) Bob Coecke∗ Chris Heunen† Aleks Kissinger∗ University of Oxford, Department of Computer Science fcoecke,heunen,[email protected] We introduce the CP*–construction on a dagger compact closed category as a generalisation of Selinger’s CPM–construction. While the latter takes a dagger compact closed category and forms its category of “abstract matrix algebras” and completely positive maps, the CP*–construction forms its category of “abstract C*-algebras” and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*–construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*–construction fully embeds Selinger’s CPM–construction in such a way that the objects in the image of the embedding can be thought of as “purely quantum” state spaces. It also embeds the category of classical stochastic maps, whose image consists of “purely classical” state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels. 1 Introduction One of the motivations driving categorical treatments of quantum mechanics is to place classical and quantum systems on an equal footing in a single category, so that one can study their interactions. The main idea of categorical quantum mechanics [1] is to fix a category (usually dagger compact) whose ob- jects are thought of as state spaces and whose morphisms are evolutions. There are two main variations. • “Dirac style”: Objects form pure state spaces, and isometric morphisms form pure state evolutions.
  • The Mathemathics of Secrets.Pdf

    The Mathemathics of Secrets.Pdf

    THE MATHEMATICS OF SECRETS THE MATHEMATICS OF SECRETS CRYPTOGRAPHY FROM CAESAR CIPHERS TO DIGITAL ENCRYPTION JOSHUA HOLDEN PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Copyright c 2017 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu Jacket image courtesy of Shutterstock; design by Lorraine Betz Doneker All Rights Reserved Library of Congress Cataloging-in-Publication Data Names: Holden, Joshua, 1970– author. Title: The mathematics of secrets : cryptography from Caesar ciphers to digital encryption / Joshua Holden. Description: Princeton : Princeton University Press, [2017] | Includes bibliographical references and index. Identifiers: LCCN 2016014840 | ISBN 9780691141756 (hardcover : alk. paper) Subjects: LCSH: Cryptography—Mathematics. | Ciphers. | Computer security. Classification: LCC Z103 .H664 2017 | DDC 005.8/2—dc23 LC record available at https://lccn.loc.gov/2016014840 British Library Cataloging-in-Publication Data is available This book has been composed in Linux Libertine Printed on acid-free paper. ∞ Printed in the United States of America 13579108642 To Lana and Richard for their love and support CONTENTS Preface xi Acknowledgments xiii Introduction to Ciphers and Substitution 1 1.1 Alice and Bob and Carl and Julius: Terminology and Caesar Cipher 1 1.2 The Key to the Matter: Generalizing the Caesar Cipher 4 1.3 Multiplicative Ciphers 6
  • The Case for Quantum State Realism

    The Case for Quantum State Realism

    Western University Scholarship@Western Electronic Thesis and Dissertation Repository 4-23-2012 12:00 AM The Case for Quantum State Realism Morgan C. Tait The University of Western Ontario Supervisor Wayne Myrvold The University of Western Ontario Graduate Program in Philosophy A thesis submitted in partial fulfillment of the equirr ements for the degree in Doctor of Philosophy © Morgan C. Tait 2012 Follow this and additional works at: https://ir.lib.uwo.ca/etd Part of the Philosophy Commons Recommended Citation Tait, Morgan C., "The Case for Quantum State Realism" (2012). Electronic Thesis and Dissertation Repository. 499. https://ir.lib.uwo.ca/etd/499 This Dissertation/Thesis is brought to you for free and open access by Scholarship@Western. It has been accepted for inclusion in Electronic Thesis and Dissertation Repository by an authorized administrator of Scholarship@Western. For more information, please contact [email protected]. THE CASE FOR QUANTUM STATE REALISM Thesis format: Monograph by Morgan Tait Department of Philosophy A thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy The School of Graduate and Postdoctoral Studies The University of Western Ontario London, Ontario, Canada © Morgan Tait 2012 THE UNIVERSITY OF WESTERN ONTARIO School of Graduate and Postdoctoral Studies CERTIFICATE OF EXAMINATION Supervisor Examiners ______________________________ ______________________________ Dr. Wayne Myrvold Dr. Dan Christensen Supervisory Committee ______________________________ Dr. Robert Spekkens ______________________________ Dr. Robert DiSalle ______________________________ Dr. Chris Smeenk The thesis by Morgan Christopher Tait entitled: The Case for Quantum State Realism is accepted in partial fulfillment of the requirements for the degree of « Doctor of Philosophy» ______________________ _______________________________ Date Chair of the Thesis Examination Board ii Abstract I argue for a realist interpretation of the quantum state.
  • Rewriting Structured Cospans: a Syntax for Open Systems

    Rewriting Structured Cospans: a Syntax for Open Systems

    UNIVERSITY OF CALIFORNIA RIVERSIDE Rewriting Structured Cospans: A Syntax For Open Systems A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics by Daniel Cicala June 2019 Dissertation Committee: Dr. John C. Baez, Chairperson Dr. Wee Liang Gan Dr. Jacob Greenstein Copyright by Daniel Cicala 2019 The Dissertation of Daniel Cicala is approved: Committee Chairperson University of California, Riverside Acknowledgments First and foremost, I would like to thank my advisor John Baez. In these past few years, I have learned more than I could have imagined about mathematics and the job of doing mathematics. I also want to thank the past and current Baez Crew for the many wonderful discussions. I am indebted to Math Department at the University of California, Riverside, which has afforded me numerous opportunities to travel to conferences near and far. Almost certainly, I would never have had a chance to pursue my doctorate had it not been for my parents who were there for me through every twist and turn on this, perhaps, too scenic route that I traveled. Most importantly, this project would have been impossible without the full-hearted support of my love, Elizabeth. I would also like to acknowledge the previously published material in this disser- tation. The interchange law in Section 3.1 was published in [15]. The material in Sections 3.2 and 3.3 appear in [16]. Also, the ZX-calculus example in Section 4.3 appears in [18]. iv Elizabeth. It’s finally over, baby! v ABSTRACT OF THE DISSERTATION Rewriting Structured Cospans: A Syntax For Open Systems by Daniel Cicala Doctor of Philosophy, Graduate Program in Mathematics University of California, Riverside, June 2019 Dr.
  • Reformulation of Quantum Mechanics and Strong Complementarity from Bayesian Inference Requirements

    Reformulation of Quantum Mechanics and Strong Complementarity from Bayesian Inference Requirements

    Reformulation of quantum mechanics and strong complementarity from Bayesian inference requirements William Heartspring Abstract: This paper provides an epistemic reformulation of quantum mechanics (QM) in terms of inference consistency requirements of objective Bayesianism, which include the principle of maximum entropy under physical constraints. Physical constraints themselves are understood in terms of consistency requirements. The by-product of this approach is that QM must additionally be understood as providing the theory of theories. Strong complementarity - that dierent observers may live in separate Hilbert spaces - follows as a consequence, which resolves the rewall paradox. Other clues pointing to this reformu- lation are analyzed. The reformulation, with the addition of novel transition probability arithmetic, resolves the measurement problem completely, thereby eliminating subjectivity of measurements from quantum mechanics. An illusion of collapse comes from Bayesian updates by observer's continuous outcome data. Dark matter and dark energy pop up directly as entropic tug-of-war in the reformulation. Contents 1 Introduction1 2 Epistemic nature of quantum mechanics2 2.1 Area law, quantum information and spacetime2 2.2 State vector from objective Bayesianism5 3 Consequences of the QM reformulation8 3.1 Basis, decoherence and causal diamond complementarity 12 4 Spacetime from entanglement 14 4.1 Locality: area equals mutual information 14 4.2 Story of Big Bang cosmology 14 5 Evidences toward the reformulation 14 5.1 Quantum redundancy 15 6 Transition probability arithmetic: resolving the measurement problem completely 16 7 Conclusion 17 1 Introduction Hamiltonian formalism and Schrödinger picture of quantum mechanics are assumed through- out the writing, with time t 2 R. Whenever the word entropy is mentioned without addi- tional qualication, it refers to von Neumann entropy.
  • Antum Entanglement in Time

    Antum Entanglement in Time

    antum Entanglement in Time by Del Rajan A thesis submied to the Victoria University of Wellington in fullment of the requirements for the degree of Doctor of Philosophy Victoria University of Wellington 2020 Abstract is thesis is in the eld of quantum information science, which is an area that reconceptualizes quantum physics in terms of information. Central to this area is the quantum eect of entanglement in space. It is an interdependence among two or more spatially separated quantum systems that would be impossible to replicate by classical systems. Alternatively, an entanglement in space can also be viewed as a resource in quantum information in that it allows the ability to perform information tasks that would be impossible or very dicult to do with only classical information. Two such astonishing applications are quantum com- munications which can be harnessed for teleportation, and quantum computers which can drastically outperform the best classical supercomputers. In this thesis our focus is on the theoretical aspect of the eld, and we provide one of the rst expositions on an analogous quantum eect known as entanglement in time. It can be viewed as an interdependence of quantum systems across time, which is stronger than could ever exist between classical systems. We explore this temporal eect within the study of quantum information and its foundations as well as through relativistic quantum information. An original contribution of this thesis is the design of one of the rst quantum information applications of entanglement in time, namely a quantum blockchain. We describe how the entanglement in time provides the quantum advantage over a classical blockchain.
  • Pilot-Wave Theory, Bohmian Metaphysics, and the Foundations of Quantum Mechanics Lecture 6 Calculating Things with Quantum Trajectories

    Pilot-Wave Theory, Bohmian Metaphysics, and the Foundations of Quantum Mechanics Lecture 6 Calculating Things with Quantum Trajectories

    Pilot-wave theory, Bohmian metaphysics, and the foundations of quantum mechanics Lecture 6 Calculating things with quantum trajectories Mike Towler TCM Group, Cavendish Laboratory, University of Cambridge www.tcm.phy.cam.ac.uk/∼mdt26 and www.vallico.net/tti/tti.html [email protected] – Typeset by FoilTEX – 1 Acknowledgements The material in this lecture is to a large extent a summary of publications by Peter Holland, R.E. Wyatt, D.A. Deckert, R. Tumulka, D.J. Tannor, D. Bohm, B.J. Hiley, I.P. Christov and J.D. Watson. Other sources used and many other interesting papers are listed on the course web page: www.tcm.phy.cam.ac.uk/∼mdt26/pilot waves.html MDT – Typeset by FoilTEX – 2 On anticlimaxes.. Up to now we have enjoyed ourselves freewheeling through the highs and lows of fundamental quantum and relativistic physics whilst slagging off Bohr, Heisenberg, Pauli, Wheeler, Oppenheimer, Born, Feynman and other physics heroes (last week we even disagreed with Einstein - an attitude that since the dawn of the 20th century has been the ultimate sign of gibbering insanity). All tremendous fun. This week - we shall learn about finite differencing and least squares fitting..! Cough. “Dr. Towler, please. You’re not allowed to use the sprinkler system to keep the audience awake.” – Typeset by FoilTEX – 3 QM computations with trajectories Computing the wavefunction from trajectories: particle and wave pictures in quantum mechanics and their relation P. Holland (2004) “The notion that the concept of a continuous material orbit is incompatible with a full wave theory of microphysical systems was central to the genesis of wave mechanics.