DOCSLIB.ORG

Introduction to Quantum Information Science Lecture Notes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Quantum Information Science Lecture Notes Introduction to Quantum Information Science Lecture Notes Scott Aaronson1 Fall 2018 1With crucial help from: Corey Ostrove and Paulo Alves Contents Page 1 Course Introduction and The Extended Church-Turing Thesis 7 2 Probability Theory and Quantum Mechanics 11 2.1 Linear Algebra Approach to Probability Theory . 15 3 Basic Rules of Quantum Mechanics 19 3.1 Quantum States and The Ket Notation . 19 3.2 Transforming Quantum States . 21 3.3 Quantum Interference . 22 3.3.1 Global and Relative Phase . 23 4 Quantum Gates and Circuits, Quantum Zeno and The Elitzur-Vaidman Bomb 25 4.1 Quantum Gates . 25 4.1.1 Generalized Born Rule . 26 4.1.2 General Properties of Quantum Gates and Measurements 27 4.2 Quantum Circuit Notation . 29 4.3 Quantum Zeno Effect . 32 4.4 The Elitzur-Vaidman Bomb . 32 5 The Coin Problem, Distinguishability, Multi-Qubit States and Entanglement 35 5.1 The Coin Problem . 35 5.2 Distinguishability of Quantum States . 36 5.3 Multi-Qubit States and Operations . 38 5.3.1 Multi-Qubit Operations . 38 5.3.2 Entanglement . 40 2 CONTENTS 3 6 Mixed States 43 6.1 Mixed States . 43 6.1.1 Density Matrices . 44 6.1.2 Properties of Density Matrices . 47 6.1.3 Partial Trace and Reduced Density Matrices . 48 7 The Bloch Sphere, No-Cloning Theorem and Wiesner's Quantum Money Scheme 51 7.1 The Bloch Sphere . 51 7.1.1 Quantum Gates in the Bloch Sphere Representation . 54 7.2 The No-Cloning Theorem . 55 7.3 Quantum Money . 57 7.3.1 Wiesner's Quantum Money Scheme . 57 8 Quantum Money and Quantum Key Distribution 59 8.1 Quantum Money Attacks . 59 8.1.1 Interactive Attacks . 60 8.1.2 Public-Key Quantum Money . 62 8.2 Quantum Key Distribution . 62 9 Superdense Coding 66 9.1 Superdense Coding . 66 10 Teleportation, Entanglement Swapping, GHZ State and The Monogamy of Entanglement 68 10.1 Quantum Teleportation . 68 10.1.1 Multi-Qubit Teleportation and Entanglement Swapping 71 10.1.2 The GHZ State and Monogamy of Entanglement . 73 11 Quantifying Entanglement 76 11.1 Schmidt Decomposition . 77 11.2 Von Neumann Entropy . 77 11.2.1 Entanglement Entropy . 78 11.3 Mixed State Entanglement . 80 12 Interpretations of Quantum Mechanics 83 12.1 The Copenhagen Interpretation . 84 12.1.1 \Shut Up and Calculate" . 84 12.2 Schr¨odinger'sCat and Wigner's Friend . 85 12.3 Dynamical Collapse . 86 12.3.1 Ghirardi-Rimini-Weber (GRW) Theory . 88 4 CONTENTS 12.3.2 Penrose Theory . 88 12.4 The Many-Worlds Interpretation . 91 13 Hidden Variables and Bell's Inequality 97 13.1 Hidden Variable Theories . 97 13.1.1 Bohmian Mechanics . 97 13.1.2 Local Hidden Variable Theories . 99 13.2 The CHSH Game . 100 14 Nonlocal Games 104 14.1 CHSH Game: Quantum Strategy . 104 14.1.1 Analysis of Protocol . 105 14.1.2 CHSH Game: Interpretations and Local Realism . 107 14.1.3 Tsirelson's Inequality . 108 14.1.4 Experimental Tests of Bell's Inequalities . 110 14.2 The Odd Cycle Game . 112 14.3 The Magic Square Game . 114 15 Einstein-Certified Randomness 116 15.1 Guaranteed Random Numbers . 116 15.1.1 Leashing Quantum Systems . 120 16 Quantum Computing and Universal Gate Sets 121 16.1 Complexity of General Unitaries: Counting Argument . 124 16.2 Universal Gate Sets . 126 16.2.1 Classical Universality . 126 16.2.2 Quantum Universality . 128 16.2.3 The Solovay-Kitaev Theorem . 130 17 Quantum Query Complexity and The Deutsch-Josza Problem132 17.1 Quantum Query Complexity . 133 17.2 Quantum Garbage Collection . 135 17.3 Deutsch's Algorithm . 138 17.4 Deutsch-Josza Algorithm . 139 18 Bernstein-Vazirani and Simon's Algorithm 142 18.1 The Bernstein-Vazirani Problem . 142 18.1.1 Quantum Algorithm . 142 18.2 Simon's Problem . 144 18.2.1 Classical Lower Bound . 146 18.2.2 Quantum Algorithm . 147 CONTENTS 5 19 RSA and Shor's Algorithm 151 19.1 RSA Encryption . 151 19.2 Period Finding . 153 19.2.1 Factoring to Period-Finding Reduction . 154 19.2.2 Quantum Algorithm for Period-Finding . 157 20 Quantum Fourier Transform 159 20.1 Quantum Fourier Transform . 159 20.1.1 Implementing the QFT . 162 20.1.2 Period Finding Using the QFT . 165 21 Continued Fractions and Shor's Algorithm Wrap-Up 169 21.1 Continued Fraction Algorithm . 170 21.2 Applications of Shor's Algorithm . 172 21.2.1 Graph Isomorphism . 173 21.2.2 Lattice-Based Cryptography . 173 22 Grover's Algorithm 175 22.1 The Algorithm . 177 22.1.1 Implementing the Diffusion Operator . 180 22.1.2 Geometric Interpretation . 181 22.1.3 Analysis . 182 22.1.4 Multiple Marked Items . 185 23 BBBV Theorem and Applications of Grover's Algorithm 189 23.1 The BBBV Theorem . 189 23.2 Applications of Grover's Algorithm . 195 23.2.1 OR of ANDs . 195 24 More Grover Applications and Quantum Complexity Theory199 24.1 More Applications of Grover's Algorithm . 199 24.1.1 The Collision Problem . 199 24.1.2 Element Distinctness . 201 24.2 Parity Lower Bound . 203 24.3 Quantum Complexity Theory . 204 25 Hamiltonians 207 25.1 Quantum Algorithms for NP-complete Problems . 207 25.2 Hamiltonians . 208 25.2.1 Matrix Exponentiation . 209 25.2.2 Energy . 212 6 CONTENTS 25.2.3 Tensor Products of Hamiltonians . 216 25.2.4 Addition of Hamiltonians . 216 26 The Adiabatic Algorithm 221 26.1 Local Hamiltonians . 221 26.2 The Adiabatic Algorithm . 223 27 Quantum Error Correction 234 27.1 Classical Error Correction . 235 27.1.1 Classical Fault-Tolerance . 237 27.2 Quantum Error Correction . 238 27.2.1 The Shor 9-Qubit Code . 242 27.2.2 Quantum Fault Tolerance . 247 28 The Stabilizer Formalism 249 28.1 The Gottesman-Knill Theorem . 253 28.1.1 The Gottesman-Knill Algorithm . 254 28.2 Stabilizer Codes . 257 28.2.1 Transversal Gates . 259 Lecture 1: Course Introduction and The Extended Church-Turing Thesis I Quantum Information Science is an inherently interdisciplinary field (Physics, CS, Math, Engineering, Philosophy) I It's not just about inventing useful devices and algorithms, but also about clarifying the workings of quantum mechanics. { We use it to ask questions about what you can and can't do with quantum mechanics { It can help us better understand the nature of quantum mechanics itself. I Professor Aaronson is very much on the theoretical end of research. I Theorists inform what experimentalists make, which in turn informs the- orists' queries Today we'll articulate several \self-evident" statements about the physical world. We'll then see that quantum mechanics leaves some of these statements in place, but overturns others|with the distinctions between the statements it upholds and the ones it overturns often extremely subtle! To start with. Probability (P 2 [0; 1]) is the standard way of representing uncertainty in the world. Probabilities have to follow certain axioms such as: I Given a set of n mutually exclusive exhaustive events, the sum of the probabilities satisfies P1 + P2 + ··· + Pn = 1 I The probability of any particular event satisfies Pi ≥ 0 ... 7 8 LECTURE 1. COURSE INTRODUCTION AND THE ECT There's a view that \probabilities are all in our heads." Which is to say that if we knew everything about the uni- verse (let's say position/velocity of all atoms in the solar system) that we could just crunch the equations and see that things either happen or they don't. Let's suppose we have two points separated by a barrier with an open slit, and we want to measure the probability that a particle goes from one point to the other. It seems obviously true that increasing the number of paths (say, by opening another slit) should increase, or at any rate not decrease, the likelihood that it will reach the other end. We refer to this property by saying that probabilities are monotone. Locality is the idea that things can only propagate through the universe at a certain speed. When we update the state of a little patch of space, it should only require knowledge of a small neighborhood around it. Conway's Game Of Life (left) is a good model here: changes you make to the system can affect it, but since each cell only directly interacts with its nearest neighbors the changes only propagate at a certain speed. In physics, locality naturally emerges due to Einstein's Special Theory of Relativity which im- plies that no signal can propagate faster than the (finite) speed of light; this simple princi- ple can explain a large number of physical phe- nomena. In special relativity anything travel- ing faster than the speed of light would be ef- fectively traveling backwards in time, from some observer's standpoint. Local Realism is the principle that any in- stantaneous update in knowledge about faraway events can be explained by correlations of random variables. For example, if you in Austin and a friend in San Francisco both subscribe to the same newspaper then when you read your copy in the morning your knowledge of the headline on your friend-in- San-Francisco's copy instantly collapses to whatever your copy's headline is. Before picking up the copy in the morning your knowledge of the headline for yourself and your friend may have been best described by a probability 9 distribution over various possibilities, but since the outcomes are perfectly correlated, as soon as you learn the headline on your copy you instantly know that your friend's must be the same.
Load more

Recommended publications
  • Programm 5 Layout 1
    SPONSORS Pauli Center for Theoretical Studies QAP European Project PAULI CENTER for Theoretical Studies Sandia National Laboratories The Swiss National Science Foundation Institute for Quantum Computing ETH Zurich (Computer Science and Physics Department) id Quantique Quantum Science and Technology (ETH) CQT Singapore VENUE W-LAN ETH Zürich, Rämistrasse 101, CH-8092 Zürich 1. Check available WLAN’s Main building / Hauptgebäude 2. Connect to WLAN „public“ Conference Helpline 0041 (0)79 770 84 29 3. Open browser 4.Login at welcome page with Login: qip2010 Password: 2010qipconf Main entrance FLOOR E Registration/Information desk Poster session Computer room E 26.3 Main entrance Registration desk Information Computer room E 26.3 Poster session 1 FLOOR E. 0 Poster session FLOOR F Auditorium F 5: Tutorial (January 15 – 17, 2010) Auditorium maximum F 30: Scientific programme (January 18 – 22, 2010) F 33.1: Congress-Office, F 33.2: Cloak room Foyer and “Uhrenhalle”: Coffee breaks, Poster session Auditorium Maximum F 30 Scientific programmme January 18 – 22, 2010 F 33.1: Congress-Office Foyer: F 33.2 Cloak room Coffee breaks Poster session Auditorium F 5 Tutorial January 15 – 17, 2010 Uhrenhalle: Coffee breaks 2 RUMP SESSION StuZ, ETH Zürich, Universitätsstrasse 6, CH-8092 Zürich CAB Building room No. CAB F21 to CAB F27 18.30 – 23.00 h (January 20, 2010) Entry ETH CAB Building ETH Main Building 3 CONFERENCE DINNER Thursday, January 21, 2010, 19.00h Restaurant Lake Side Bellerivestrasse 170 CH-8008 Zürich Phone: +41 (0) 44 385 86 00 Directions from ETH main building • (Tram No. 9 to “Bellevue” (direction “Triemli”).
    [Show full text]
  • A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper
    A tutorial introduction to quantum circuit programming in dependently typed Proto-Quipper Peng Fu1, Kohei Kishida2, Neil J. Ross1, and Peter Selinger1 1 Dalhousie University, Halifax, NS, Canada ffrank-fu,neil.jr.ross,[email protected] 2 University of Illinois, Urbana-Champaign, IL, U.S.A. [email protected] Abstract. We introduce dependently typed Proto-Quipper, or Proto- Quipper-D for short, an experimental quantum circuit programming lan- guage with linear dependent types. We give several examples to illustrate how linear dependent types can help in the construction of correct quan- tum circuits. Specifically, we show how dependent types enable program- ming families of circuits, and how dependent types solve the problem of type-safe uncomputation of garbage qubits. We also discuss other lan- guage features along the way. Keywords: Quantum programming languages · Linear dependent types · Proto-Quipper-D 1 Introduction Quantum computers can in principle outperform conventional computers at cer- tain crucial tasks that underlie modern computing infrastructures. Experimental quantum computing is in its early stages and existing devices are not yet suitable for practical computing. However, several groups of researchers, in both academia and industry, are now building quantum computers (see, e.g., [2,11,16]). Quan- tum computing also raises many challenging questions for the programming lan- guage community [17]: How should we design programming languages for quan- tum computation? How should we compile and optimize quantum programs? How should we test and verify quantum programs? How should we understand the semantics of quantum programming languages? In this paper, we focus on quantum circuit programming using the linear dependently typed functional language Proto-Quipper-D.
    [Show full text]
  • Key Concepts for Future QIS Learners Workshop Output Published Online May 13, 2020
    Key Concepts for Future QIS Learners Workshop output published online May 13, 2020 Background and Overview On behalf of the Interagency Working Group on Workforce, Industry and Infrastructure, under the NSTC Subcommittee on Quantum Information Science (QIS), the National Science Foundation invited 25 researchers and educators to come together to deliberate on defining a core set of key concepts for future QIS learners that could provide a starting point for further curricular and educator development activities. The deliberative group included university and industry researchers, secondary school and college educators, and representatives from educational and professional organizations. The workshop participants focused on identifying concepts that could, with additional supporting resources, help prepare secondary school students to engage with QIS and provide possible pathways for broader public engagement. This workshop report identifies a set of nine Key Concepts. Each Concept is introduced with a concise overall statement, followed by a few important fundamentals. Connections to current and future technologies are included, providing relevance and context. The first Key Concept defines the field as a whole. Concepts 2-6 introduce ideas that are necessary for building an understanding of quantum information science and its applications. Concepts 7-9 provide short explanations of critical areas of study within QIS: quantum computing, quantum communication and quantum sensing. The Key Concepts are not intended to be an introductory guide to quantum information science, but rather provide a framework for future expansion and adaptation for students at different levels in computer science, mathematics, physics, and chemistry courses. As such, it is expected that educators and other community stakeholders may not yet have a working knowledge of content covered in the Key Concepts.
    [Show full text]
  • Engineering the Coupling of Superconducting Qubits
    Engineering the coupling of superconducting qubits Von der Fakultät für Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von M. Sc. Alessandro Ciani aus Penne, Italien Berichter: Prof. Dr. David DiVincenzo Prof. Dr. Fabian Hassler Tag der mündlichen Prüfung: 12 April 2019 Diese Dissertation ist auf den Internetseiten der Universitätsbibliothek verfügbar. ii «Considerate la vostra semenza: fatti non foste a viver come bruti, ma per seguir virtute e conoscenza.» Dante Alighieri, "La Divina Commedia", Inferno, Canto XXVI, vv. 118-120. iii Abstract The way to build a scalable and reliable quantum computer that truly exploits the quantum power faces several challenges. Among the various proposals for building a quantum computer, superconducting qubits have rapidly progressed and hold good promises in the near-term future. In particular, the possibility to design the required interactions is one of the most appealing features of this kind of architecture. This thesis deals with some detailed aspects of this problem focusing on architectures based on superconducting transmon-like qubits. After reviewing the basic tools needed for the study of superconducting circuits and the main kinds of superconducting qubits, we move to the analyisis of a possible scheme for realizing direct parity measurement. Parity measurements, or in general stabilizer measurements, are fundamental tools for realizing quantum error correct- ing codes, that are believed to be fundamental for dealing with the problem of de- coherence that affects any physical implementation of a quantum computer. While these measurements are usually done indirectly with the help of ancilla qubits, the scheme that we analyze performs the measurement directly, and requires the engi- neering of a precise matching condition.
    [Show full text]
  • Introduction to Quantum Information and Computation
    Introduction to Quantum Information and Computation Steven M. Girvin ⃝c 2019, 2020 [Compiled: May 2, 2020] Contents 1 Introduction 1 1.1 Two-Slit Experiment, Interference and Measurements . 2 1.2 Bits and Qubits . 3 1.3 Stern-Gerlach experiment: the first qubit . 8 2 Introduction to Hilbert Space 16 2.1 Linear Operators on Hilbert Space . 18 2.2 Dirac Notation for Operators . 24 2.3 Orthonormal bases for electron spin states . 25 2.4 Rotations in Hilbert Space . 29 2.5 Hilbert Space and Operators for Multiple Spins . 38 3 Two-Qubit Gates and Entanglement 43 3.1 Introduction . 43 3.2 The CNOT Gate . 44 3.3 Bell Inequalities . 51 3.4 Quantum Dense Coding . 55 3.5 No-Cloning Theorem Revisited . 59 3.6 Quantum Teleportation . 60 3.7 YET TO DO: . 61 4 Quantum Error Correction 63 4.1 An advanced topic for the experts . 68 5 Yet To Do 71 i Chapter 1 Introduction By 1895 there seemed to be nothing left to do in physics except fill out a few details. Maxwell had unified electriciy, magnetism and optics with his theory of electromagnetic waves. Thermodynamics was hugely successful well before there was any deep understanding about the properties of atoms (or even certainty about their existence!) could make accurate predictions about the efficiency of the steam engines powering the industrial revolution. By 1895, statistical mechanics was well on its way to providing a microscopic basis in terms of the random motions of atoms to explain the macroscopic predictions of thermodynamics. However over the next decade, a few careful observers (e.g.
    [Show full text]
  • Exercises in Classical Mechanics 1 Moments of Inertia 2 Half-Cylinder
    Exercises in Classical Mechanics CUNY GC, Prof. D. Garanin No.1 Solution ||||||||||||||||||||||||||||||||||||||||| 1 Moments of inertia (5 points) Calculate tensors of inertia with respect to the principal axes of the following bodies: a) Hollow sphere of mass M and radius R: b) Cone of the height h and radius of the base R; both with respect to the apex and to the center of mass. c) Body of a box shape with sides a; b; and c: Solution: a) By symmetry for the sphere I®¯ = I±®¯: (1) One can ¯nd I easily noticing that for the hollow sphere is 1 1 X ³ ´ I = (I + I + I ) = m y2 + z2 + z2 + x2 + x2 + y2 3 xx yy zz 3 i i i i i i i i 2 X 2 X 2 = m r2 = R2 m = MR2: (2) 3 i i 3 i 3 i i b) and c): Standard solutions 2 Half-cylinder ϕ (10 points) Consider a half-cylinder of mass M and radius R on a horizontal plane. a) Find the position of its center of mass (CM) and the moment of inertia with respect to CM. b) Write down the Lagrange function in terms of the angle ' (see Fig.) c) Find the frequency of cylinder's oscillations in the linear regime, ' ¿ 1. Solution: (a) First we ¯nd the distance a between the CM and the geometrical center of the cylinder. With σ being the density for the cross-sectional surface, so that ¼R2 M = σ ; (3) 2 1 one obtains Z Z 2 2σ R p σ R q a = dx x R2 ¡ x2 = dy R2 ¡ y M 0 M 0 ¯ 2 ³ ´3=2¯R σ 2 2 ¯ σ 2 3 4 = ¡ R ¡ y ¯ = R = R: (4) M 3 0 M 3 3¼ The moment of inertia of the half-cylinder with respect to the geometrical center is the same as that of the cylinder, 1 I0 = MR2: (5) 2 The moment of inertia with respect to the CM I can be found from the relation I0 = I + Ma2 (6) that yields " µ ¶ # " # 1 4 2 1 32 I = I0 ¡ Ma2 = MR2 ¡ = MR2 1 ¡ ' 0:3199MR2: (7) 2 3¼ 2 (3¼)2 (b) The Lagrange function L is given by L('; '_ ) = T ('; '_ ) ¡ U('): (8) The potential energy U of the half-cylinder is due to the elevation of its CM resulting from the deviation of ' from zero.
    [Show full text]
  • Arxiv:Quant-Ph/0504183V1 25 Apr 2005 † ∗ Elsae 1,1,1] Oee,I H Rcs Fmea- Is of Above the Process the Vandalized
    Deterministic Bell State Discrimination Manu Gupta1∗ and Prasanta K. Panigrahi2† 1 Jaypee Institute of Information Technology, Noida, 201 307, India 2 Physical Research Laboratory, Navrangpura, Ahmedabad, 380 009, India We make use of local operations with two ancilla bits to deterministically distinguish all the four Bell states, without affecting the quantum channel containing these Bell states. Entangled states play a key role in the transmission and processing of quantum information [1, 2]. Using en- tangled channel, an unknown state can be teleported [3] with local unitary operations, appropriate measurement and classical communication; one can achieve entangle- ment swapping through joint measurement on two en- tangled pairs [4]. Entanglement leads to increase in the capacity of the quantum information channel, known as quantum dense coding [5]. The bipartite, maximally en- FIG. 1: Diagram depicting the circuit for Bell state discrimi- tangled Bell states provide the most transparent illustra- nator. tion of these aspects, although three particle entangled states like GHZ and W states are beginning to be em- ployed for various purposes [6, 7]. satisfactory, where the Bell state is not required further Making use of single qubit operations and the in the quantum network. Controlled-NOT gates, one can produce various entan- We present in this letter, a scheme which discriminates gled states in a quantum network [1]. It may be of inter- all the four Bell states deterministically and is able to pre- est to know the type of entangled state that is present in serve these states for further use. As LOCC alone is in- a quantum network, at various stages of quantum compu- sufficient for this purpose, we will make use of two ancilla tation and cryptographic operations, without disturbing bits, along with the entangled channels.
    [Show full text]
  • Limits on Efficient Computation in the Physical World
    Limits on Efficient Computation in the Physical World by Scott Joel Aaronson Bachelor of Science (Cornell University) 2000 A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the GRADUATE DIVISION of the UNIVERSITY of CALIFORNIA, BERKELEY Committee in charge: Professor Umesh Vazirani, Chair Professor Luca Trevisan Professor K. Birgitta Whaley Fall 2004 The dissertation of Scott Joel Aaronson is approved: Chair Date Date Date University of California, Berkeley Fall 2004 Limits on Efficient Computation in the Physical World Copyright 2004 by Scott Joel Aaronson 1 Abstract Limits on Efficient Computation in the Physical World by Scott Joel Aaronson Doctor of Philosophy in Computer Science University of California, Berkeley Professor Umesh Vazirani, Chair More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which. In the first part of the thesis, I attack the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known. In partic- ular, any quantum algorithm that solves the collision problem—that of deciding whether a sequence of n integers is one-to-one or two-to-one—must query the sequence Ω n1/5 times.
    [Show full text]
  • Using Graph States for Quantum Computation and Communication
    Using Graph States for Quantum Computation and Communication Thesis by Kovid Goyal In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2009 (Submitted May 27, 2009) ii c 2009 Kovid Goyal All Rights Reserved iii To Dr. Ajay Patwardhan, for inspiring a whole generation of physicists. iv Acknowledgements I would like to start by acknowledging my thesis adviser, John Preskill, for giving me the freedom to pursue my interests and for setting a very high standard for me to aspire to. John has also provided the direction I needed at critical points in my career. I would like to thank Robert Raussendorf for sharing a lot of his ideas with me and patiently explaining them when needed. Most of the great ideas in Chapter 2 were orig- inated by him. Robert has been a mentor and a guide. I would like to thank Jim Harrington for introducing me to the numerical techniques needed for the analysis of the measurement based quantum computer and for writing relatively clear and easy to follow code. I would like to thank Austin Fowler for asking me a lot of questions and thereby greatly improving the clarity and depth of my understanding. Austin also inspired me to make this work as clear and easy to follow as possible. The magic state distillation circuit diagrams and the CNOT gate construction in Chapter 2 are his. I would like to thank Ben Toner, Panos Aliferis, Greg Ver Steeg and Prabha Mandayam Dodamanne for many stimulating discussions. I would like to thank my parents, Ashima and Niraj, for supporting my desire to be- come a physicist and for providing me with a stimulating and enjoyable childhood.
    [Show full text]
  • A Paradox Regarding Monogamy of Entanglement
    A paradox regarding monogamy of entanglement Anna Karlsson1;2 1Institute for Advanced Study, School of Natural Sciences 1 Einstein Drive, Princeton, NJ 08540, USA 2Division of Theoretical Physics, Department of Physics, Chalmers University of Technology, 412 96 Gothenburg, Sweden Abstract In density matrix theory, entanglement is monogamous. However, we show that qubits can be arbitrarily entangled in a different, recently constructed model of qubit entanglement [1]. We illustrate the differences between these two models, analyse how the density matrix property of monogamy of entanglement originates in assumptions of classical correlations in the construc- tion of that model, and explain the counterexample to monogamy in the alternative model. We conclude that monogamy of entanglement is a theoretical assumption, not necessarily a phys- ical property, and discuss how contemporary theory relies on that assumption. The properties of entanglement entropy are very different in the two models — a priori, the entropy in the alternative model is classical. arXiv:1911.09226v2 [hep-th] 7 Feb 2020 Contents 1 Introduction 1 1.1 Indications of a presence of general entanglement . .2 1.2 Non-signalling and detection of general entanglement . .3 1.3 Summary and overview . .4 2 Analysis of the partial trace 5 3 A counterexample to monogamy of entanglement 5 4 Implications for entangled systems 7 A More details on the different correlation models 9 B Entropy in the orthogonal information model 11 C Correlations vs entanglement: a tolerance for deviations 14 1 Introduction The topic of this article is how to accurately model quantum correlations. In quantum theory, quan- tum systems are currently modelled by density matrices (ρ) and entanglement is recognized to be monogamous [2].
    [Show full text]
  • A Scanning Transmon Qubit for Strong Coupling Circuit Quantum Electrodynamics
    ARTICLE Received 8 Mar 2013 | Accepted 10 May 2013 | Published 7 Jun 2013 DOI: 10.1038/ncomms2991 A scanning transmon qubit for strong coupling circuit quantum electrodynamics W. E. Shanks1, D. L. Underwood1 & A. A. Houck1 Like a quantum computer designed for a particular class of problems, a quantum simulator enables quantitative modelling of quantum systems that is computationally intractable with a classical computer. Superconducting circuits have recently been investigated as an alternative system in which microwave photons confined to a lattice of coupled resonators act as the particles under study, with qubits coupled to the resonators producing effective photon–photon interactions. Such a system promises insight into the non-equilibrium physics of interacting bosons, but new tools are needed to understand this complex behaviour. Here we demonstrate the operation of a scanning transmon qubit and propose its use as a local probe of photon number within a superconducting resonator lattice. We map the coupling strength of the qubit to a resonator on a separate chip and show that the system reaches the strong coupling regime over a wide scanning area. 1 Department of Electrical Engineering, Princeton University, Olden Street, Princeton 08550, New Jersey, USA. Correspondence and requests for materials should be addressed to W.E.S. (email: [email protected]). NATURE COMMUNICATIONS | 4:1991 | DOI: 10.1038/ncomms2991 | www.nature.com/naturecommunications 1 & 2013 Macmillan Publishers Limited. All rights reserved. ARTICLE NATURE COMMUNICATIONS | DOI: 10.1038/ncomms2991 ver the past decade, the study of quantum physics using In this work, we describe a scanning superconducting superconducting circuits has seen rapid advances in qubit and demonstrate its coupling to a superconducting CPWR Osample design and measurement techniques1–3.
    [Show full text]
  • Do Black Holes Create Polyamory?
    Do black holes create polyamory? Andrzej Grudka1;4, Michael J. W. Hall2, Michał Horodecki3;4, Ryszard Horodecki3;4, Jonathan Oppenheim5, John A. Smolin6 1Faculty of Physics, Adam Mickiewicz University, 61-614 Pozna´n,Poland 2Centre for Quantum Computation and Communication Technology (Australian Research Council), Centre for Quantum Dynamics, Griffith University, Brisbane, QLD 4111, Australia 3Institute of Theoretical Physics and Astrophysics, University of Gda´nsk,Gda´nsk,Poland 4National Quantum Information Center of Gda´nsk,81–824 Sopot, Poland 5University College of London, Department of Physics & Astronomy, London, WC1E 6BT and London Interdisciplinary Network for Quantum Science and 6IBM T. J. Watson Research Center, 1101 Kitchawan Road, Yorktown Heights, NY 10598 Of course not, but if one believes that information cannot be destroyed in a theory of quantum gravity, then we run into apparent contradictions with quantum theory when we consider evaporating black holes. Namely that the no-cloning theorem or the principle of entanglement monogamy is violated. Here, we show that neither violation need hold, since, in arguing that black holes lead to cloning or non-monogamy, one needs to assume a tensor product structure between two points in space-time that could instead be viewed as causally connected. In the latter case, one is violating the semi-classical causal structure of space, which is a strictly weaker implication than cloning or non-monogamy. This is because both cloning and non-monogamy also lead to a breakdown of the semi-classical causal structure. We show that the lack of monogamy that can emerge in evaporating space times is one that is allowed in quantum mechanics, and is very naturally related to a lack of monogamy of correlations of outputs of measurements performed at subsequent instances of time of a single system.
    [Show full text]