DOCSLIB.ORG

Quantum Computation and Information Storage in Quantum Double Models

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Computation and Information Storage in Quantum Double Models Quantum Computation and Information Storage in Quantum Double Models Thesis by Anna Kómár In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy CALIFORNIA INSTITUTE OF TECHNOLOGY Pasadena, California 2018 Defended May 3, 2018 ii © 2018 Anna Kómár ORCID: 0000-0002-4701-4931 All rights reserved iii ‘Would you tell me, please, which way I ought to go from here?’ ‘That depends a good deal on where you want to get to,’ said the Cat. ‘I don’t much care where–’ said Alice. ‘Then it doesn’t matter which way you go,’ said the Cat. ‘–so long as I get somewhere,’ Alice added as an explanation. ‘Oh, you’re sure to do that,’ said the Cat, ‘if only you walk long enough.’ Alice in Wonderland [1,2] Lewis Carroll iv ACKNOWLEDGEMENTS I would like to thank John Preskill, for taking the risk of becoming my advisor, and for guiding my academic growth throughout the years. I could always count on his physical intuition and patience during our discussions. I thank Olivier Landon- Cardinal for being my mentor, for supporting me, both academically and personally, throughout the years; and for putting up with my trivial questions about physics. I thank my thesis committee: Xie Chen, Manuel Endres, Alexei Kitaev, and John Preskill for their valuable comments about the first version of this thesis, especially those regarding Chapter4. I would like to thank my collaborators and colleagues: Kristan Temme, for helping me take my first steps as a researcher in the field; Elizabeth Crosson, for helping me appreciate Markov chains more; Sujeet Shukla, Burak Sahinoglu and Dave Aasen, for their time and patience while discussing quantum doubles and ribbon operators with me; Aleksander Kubica, for always being there when I needed advice. I thank Alexei Kitaev for his time he spent discussing quantum doubles with me; and David Poulin and Anirudh Krishna for making me feel welcome in Sherbrooke during my visit. Spending five years at Caltech made me appreciate the importance of personal relationships. I would like to thank all my Caltech friends for being there during these five years, for throwing board game nights, coming to dinners, and playing Dungeons & Dragons together. You’re all awesome. Special thanks is due to Ioana Craiciu, my mentee then friend, with whom I could discuss topics encompassing quantum physics, philosophy, travel, arts and crafts, and so much more. To my other best friend, Lena Murchikova: you’re the strongest person I know, and I feel honored to be your friend. I wouldn’t be here without the two people who helped me start my career in science, my former advisors: Gergő Pokol and Tünde Fülöp. Thank you for helping me realize that doing research is fun, and for supporting me even after I left the field. Last, but not least, I thank my family for their continuing support, in particular my parents, Antal and Erzsébet, for raising me to be a curious, skeptical, hard-working adult, for teaching me to never give up. I thank you both for encouraging and consoling me throughout all these years, and for accepting that I decided to move thousands of miles away from home. I thank my brother, Péter, for being a friend, a role model, someone who’s always there to help. Thank you for being a caring big brother. Finally, I would like to thank my husband, Dávid, for being there with me along the road. I thank you for listening to my ramblings about quantum physics, for celebrating milestones with me, and for picking up my pieces when needed. You have been my anchor throughout these years. v ABSTRACT The results of this thesis concern the real-world realization of quantum computers, specifically how to build their “hard drives” or quantum memories. These are many- body quantum systems, and their building blocks are qubits, the same way bits are the building blocks of classical computers. Quantum memories need to be robust against thermal noise, noise that would other- wise destroy the encoded information, similar to how strong magnetic field corrupts data classically stored in magnetic many-body systems (e.g., in hard drives). In this work I focus on a subset of many-body models, called quantum doubles, which, in addition to storing the information, could be used to perform the steps of the quantum computation, i.e., work as a “quantum processor”. In the first part of my thesis, I investigate how long a subset of quantum doubles (qudit surface codes) can retain the quantum information stored in them, referred to as their memory time. I prove an upper bound for this memory time, restricting the maximum possible performance of qudit surface codes. Then, I analyze the structure of quantum doubles, and find two interesting properties. First, that the high-level description of doubles, utilizing only their quasi-particles to describe their states, disregards key components of their microscopic proper- ties. In short, quasi-particles (anyons) of quantum doubles are not in a one-to-one correspondence with the energy eigenstates of their Hamiltonian. Second, by in- vestigating phase transitions of a simple quantum double, D¹S3º, I map its phase diagram, and interpret the physical processes the theory undergoes through terms borrowed from the Landau theory of phase transitions. vi PUBLISHED CONTENT AND CONTRIBUTIONS Anna Kómár, Olivier Landon-Cardinal, and Kristan Temme. Necessity of an energy barrier for self-correction of Abelian quantum doubles. Physical Review A, 93 (5):052337, 2016. doi: 10.1103/PhysRevA.93.052337. The project idea was conceived during discussions between AK, OLC and KT, as a non-trivial extension of the pioneering work done by KT [3]. AK derived the main result (upper bound on memory time), and proved that it is a constant. The value of the prefactor of the bound was derived and proven collaboratively by AK and OLC. The writing of the manuscript was led by AK, and collaboratively done by all authors. Anna Kómár, and Olivier Landon-Cardinal. Anyons are not energy eigenspaces of quantum double Hamiltonians. Physical Review B, 96(19):195150, 2017. doi: 10.1103/PhysRevB.96.195150. The project idea was conceived during discussions between AK and OLC. AK derived the main results (construction of projectors, including their commuta- tive and orthogonality properties). The proofs and interpretations of the results were finalized during discussions between AK and OLC. The writing of the manuscript was led by AK, and collaboratively done by the authors. Anna Kómár, and Olivier Landon-Cardinal. Topological phase diagram of D¹S3º induced by forbidding charges and fluxes. arXiv preprint: 1805.00032. The project idea was conceived during discussions between AK and OLC. AK derived the main results (what new phases emerge in each case of phase transition), and categorized the intermediate processes during these phase transitions. The writing of the manuscript was led by AK, and collaboratively done by the authors. vii TABLE OF CONTENTS Acknowledgements............................... iv Abstract..................................... v Published Content and Contributions...................... vi Table of Contents................................ vii Nomenclature.................................. x Chapter I: Overview............................... 1 1.1 Topological Quantum Computation.................. 3 1.1.1 Topological order....................... 4 1.1.2 Anyons ............................ 4 1.1.3 Error Correction ....................... 6 1.1.4 Toric code........................... 8 1.2 Summary of results .......................... 11 1.2.1 Memory time of Abelian quantum doubles.......... 12 1.2.2 Computation with non-Abelian quantum doubles . 13 Chapter II: Self correction requires an energy barrier for Abelian quantum doubles ................................... 17 2.1 Introduction .............................. 17 2.2 Framework............................... 20 2.2.1 Abelian quantum doubles................... 20 2.2.2 Thermal noise model..................... 24 2.3 Generalized energy barrier....................... 26 2.3.1 Definition of the generalized energy barrier ......... 26 2.3.2 Arrhenius upper bound on the mixing time.......... 28 2.3.3 Generalized energy barrier is constant for Abelian doubles . 29 2.3.4 Length of the local errors path................ 33 2.3.5 The effect of defect lines ................... 36 2.4 Discussion............................... 39 2.4.1 Possible improvements.................... 39 2.4.2 Implication for entropy protection .............. 39 2.5 Details of the derivation........................ 41 2.5.1 Diagonalizing the Hamiltonian, Jump operators . 42 2.5.2 Construction of the Dirichlet matrix and the variance matrix 45 2.5.3 Bounds on the gap (comparison theorem and canonical paths) 48 2.5.4 Evaluation of the bound and the generalized energy barrier . 50 2.6 Conclusions .............................. 54 2.A Maximum cardinality and sum of multisets without a zero-sum subset 54 Chapter III: Anyons are not energy eigenspaces of quantum double Hamiltonians 58 3.1 Introduction .............................. 58 3.2 The Drinfeld double construction and the quantum double models . 60 viii 3.2.1 Non-Abelian Aharonov-Bohm effect............. 61 3.2.2 Kitaev’s quantum double on a lattice............. 66 3.3 Refined quantum double Hamiltonian for arbitrary group . 71 3.3.1 Refined quantum double construction ............ 71 3.3.2 Example of G = S3 ...................... 77 3.4 Hilbert space splitting......................... 78 3.4.1 Two distinct yet consistent ways to split the Hilbert space . 78 3.4.2 Dimension of the proper Hilbert space of a site . 80 3.4.3 Diagrammatic representation and energy sectors . 81 3.5 Local degrees of freedom ....................... 85 3.5.1 Disagreement between anyons and energy sectors . 85 3.5.2 The role of finite lattice spacing ............... 86 3.5.3 Local vs. global degrees of freedom............. 88 3.6 Discussion............................... 89 3.6.1 Consequences for quantum computation........... 89 3.6.2 Consequences for quantum memories ............ 90 3.6.3 Holography between local, topological, and fusion degrees of freedom?.......................... 90 3.A Mathematical proofs.........................
Load more

Recommended publications
  • Four Results of Jon Kleinberg a Talk for St.Petersburg Mathematical Society
    Four Results of Jon Kleinberg A Talk for St.Petersburg Mathematical Society Yury Lifshits Steklov Institute of Mathematics at St.Petersburg May 2007 1 / 43 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 / 43 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 2 / 43 4 Navigation in a Small World 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 2 / 43 5 Bursty Structure in Streams Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 2 / 43 Outline 1 Nevanlinna Prize for Jon Kleinberg History of Nevanlinna Prize Who is Jon Kleinberg 2 Hubs and Authorities 3 Nearest Neighbors: Faster Than Brute Force 4 Navigation in a Small World 5 Bursty Structure in Streams 2 / 43 Part I History of Nevanlinna Prize Career of Jon Kleinberg 3 / 43 Nevanlinna Prize The Rolf Nevanlinna Prize is awarded once every 4 years at the International Congress of Mathematicians, for outstanding contributions in Mathematical Aspects of Information Sciences including: 1 All mathematical aspects of computer science, including complexity theory, logic of programming languages, analysis of algorithms, cryptography, computer vision, pattern recognition, information processing and modelling of intelligence.
    [Show full text]
  • Navigability of Small World Networks
    Navigability of Small World Networks Pierre Fraigniaud CNRS and University Paris Sud http://www.lri.fr/~pierre Introduction Interaction Networks • Communication networks – Internet – Ad hoc and sensor networks • Societal networks – The Web – P2P networks (the unstructured ones) • Social network – Acquaintance – Mail exchanges • Biology (Interactome network), linguistics, etc. Dec. 19, 2006 HiPC'06 3 Common statistical properties • Low density • “Small world” properties: – Average distance between two nodes is small, typically O(log n) – The probability p that two distinct neighbors u1 and u2 of a same node v are neighbors is large. p = clustering coefficient • “Scale free” properties: – Heavy tailed probability distributions (e.g., of the degrees) Dec. 19, 2006 HiPC'06 4 Gaussian vs. Heavy tail Example : human sizes Example : salaries µ Dec. 19, 2006 HiPC'06 5 Power law loglog ppk prob{prob{ X=kX=k }} ≈≈ kk-α loglog kk Dec. 19, 2006 HiPC'06 6 Random graphs vs. Interaction networks • Random graphs: prob{e exists} ≈ log(n)/n – low clustering coefficient – Gaussian distribution of the degrees • Interaction networks – High clustering coefficient – Heavy tailed distribution of the degrees Dec. 19, 2006 HiPC'06 7 New problematic • Why these networks share these properties? • What model for – Performance analysis of these networks – Algorithm design for these networks • Impact of the measures? • This lecture addresses navigability Dec. 19, 2006 HiPC'06 8 Navigability Milgram Experiment • Source person s (e.g., in Wichita) • Target person t (e.g., in Cambridge) – Name, professional occupation, city of living, etc. • Letter transmitted via a chain of individuals related on a personal basis • Result: “six degrees of separation” Dec.
    [Show full text]
  • A Decade of Lattice Cryptography
    Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Constraint Based Dimension Correlation and Distance
    Preface The papers in this volume were presented at the Fourteenth Annual IEEE Conference on Computational Complexity held from May 4-6, 1999 in Atlanta, Georgia, in conjunction with the Federated Computing Research Conference. This conference was sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, in cooperation with the ACM SIGACT (The special interest group on Algorithms and Complexity Theory) and EATCS (The European Association for Theoretical Computer Science). The call for papers sought original research papers in all areas of computational complexity. A total of 70 papers were submitted for consideration of which 28 papers were accepted for the conference and for inclusion in these proceedings. Six of these papers were accepted to a joint STOC/Complexity session. For these papers the full conference paper appears in the STOC proceedings and a one-page summary appears in these proceedings. The program committee invited two distinguished researchers in computational complexity - Avi Wigderson and Jin-Yi Cai - to present invited talks. These proceedings contain survey articles based on their talks. The program committee thanks Pradyut Shah and Marcus Schaefer for their organizational and computer help, Steve Tate and the SIGACT Electronic Publishing Board for the use and help of the electronic submissions server, Peter Shor and Mike Saks for the electronic conference meeting software and Danielle Martin of the IEEE for editing this volume. The committee would also like to thank the following people for their help in reviewing the papers: E. Allender, V. Arvind, M. Ajtai, A. Ambainis, G. Barequet, S. Baumer, A. Berthiaume, S.
    [Show full text]
  • Inter Actions Department of Physics 2015
    INTER ACTIONS DEPARTMENT OF PHYSICS 2015 The Department of Physics has a very accomplished family of alumni. In this issue we begin to recognize just a few of them with stories submitted by graduates from each of the decades since 1950. We want to invite all of you to renew and strengthen your ties to our department. We would love to hear from you, telling us what you are doing and commenting on how the department has helped in your career and life. Alumna returns to the Physics Department to Implement New MCS Core Education When I heard that the Department of Physics needed a hand implementing the new MCS Core Curriculum, I couldn’t imagine a better fit. Not only did it provide an opportunity to return to my hometown, but Carnegie Mellon itself had been a fixture in my life for many years, from taking classes as a high school student to teaching after graduation. I was thrilled to have the chance to return. I graduated from Carnegie Mellon in 2008, with a B.S. in physics and a B.A. in Japanese. Afterwards, I continued to teach at CMARC’s Summer Academy for Math and Science during the summers while studying down the street at the University of Pittsburgh. In 2010, I earned my M.A. in East Asian Studies there based on my research into how cultural differences between Japan and America have helped shape their respective robotics industries. After receiving my master’s degree and spending a summer studying in Japan, I taught for Kaplan as graduate faculty for a year before joining the Department of Physics at Cornell University.
    [Show full text]
  • The BBVA Foundation Recognizes Charles H. Bennett, Gilles Brassard
    www.frontiersofknowledgeawards-fbbva.es Press release 3 March, 2020 The BBVA Foundation recognizes Charles H. Bennett, Gilles Brassard and Peter Shor for their fundamental role in the development of quantum computation and cryptography In the 1980s, chemical physicist Bennett and computer scientist Brassard invented quantum cryptography, a technology that using the laws of quantum physics in a way that makes them unreadable to eavesdroppers, in the words of the award committee The importance of this technology was demonstrated ten years later, when mathematician Shor discovered that a hypothetical quantum computer would drive a hole through the conventional cryptographic systems that underpin the security and privacy of Internet communications Their landmark contributions have boosted the development of quantum computers, which promise to perform calculations at a far greater speed and scale than machines, and enabled cryptographic systems that guarantee the inviolability of communications The BBVA Foundation Frontiers of Knowledge Award in Basic Sciences has gone in this twelfth edition to Charles Bennett, Gilles Brassard and Peter Shor for their outstanding contributions to the field of quantum computation and communication Bennett and Brassard, a chemical physicist and computer scientist respectively, invented quantum cryptography in the 1980s to ensure the physical inviolability of data communications. The importance of their work became apparent ten years later, when mathematician Peter Shor discovered that a hypothetical quantum computer would render effectively useless the communications. The award committee, chaired by Nobel Physics laureate Theodor Hänsch with quantum physicist Ignacio Cirac acting as its secretary, remarked on the leap forward in quantum www.frontiersofknowledgeawards-fbbva.es Press release 3 March, 2020 technologies witnessed in these last few years, an advance which draws heavily on the new .
    [Show full text]
  • Quantum-Proofing the Blockchain
    QUANTUM-PROOFING THE BLOCKCHAIN Vlad Gheorghiu, Sergey Gorbunov, Michele Mosca, and Bill Munson University of Waterloo November 2017 A BLOCKCHAIN RESEARCH INSTITUTE BIG IDEA WHITEPAPER Realizing the new promise of the digital economy In 1994, Don Tapscott coined the phrase, “the digital economy,” with his book of that title. It discussed how the Web and the Internet of information would bring important changes in business and society. Today the Internet of value creates profound new possibilities. In 2017, Don and Alex Tapscott launched the Blockchain Research Institute to help realize the new promise of the digital economy. We research the strategic implications of blockchain technology and produce practical insights to contribute global blockchain knowledge and help our members navigate this revolution. Our findings, conclusions, and recommendations are initially proprietary to our members and ultimately released to the public in support of our mission. To find out more, please visitwww.blockchainresearchinstitute.org . Blockchain Research Institute, 2018 Except where otherwise noted, this work is copyrighted 2018 by the Blockchain Research Institute and licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Public License. To view a copy of this license, send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA, or visit creativecommons.org/ licenses/by-nc-nd/4.0/legalcode. This document represents the views of its author(s), not necessarily those of Blockchain Research Institute or the Tapscott Group. This material is for informational purposes only; it is neither investment advice nor managerial consulting. Use of this material does not create or constitute any kind of business relationship with the Blockchain Research Institute or the Tapscott Group, and neither the Blockchain Research Institute nor the Tapscott Group is liable for the actions of persons or organizations relying on this material.
    [Show full text]
  • Quantum Error Correction
    Quantum Error Correction Peter Young (Dated: March 6, 2020) I. INTRODUCTION Quantum error correction has developed into a huge topic, so here we will only be able to describe the main ideas. Error correction is essential for quantum computing, but appeared at first to be impossible, for reasons that we shall see. The field was transformed in 1995 by Shor[1] and Steane[2] who showed that quantum error correction is feasible. Before Shor and Steane, the goal of building a useful quantum computer seemed clearly unattainable. After those two papers, while building a quantum computer obviously posed enormous challenges, it was not necessarily impossible. Some general references on quantum error correction are Refs. [3{6]. Let us start by giving a simple discussion of classical error correction which will motivate our study of quantum error correction. In classical computers error correction is not necessary. This is because the hardware for one bit is huge on an atomic scale and the states 0 and 1 are so different that the probability of an unwanted flip is tiny. However, error correction is needed classically for transmitting a signal over large distances where it attenuates and can be corrupted by noise. To do error correction one needs to have redundancy. One simple way of doing classical error correction is to encode each logical bit by three physical bits, i.e. j0i ! j0i ≡ j0ij0ij0i ≡ j000i ; (1a) j1i ! j1i ≡ j1ij1ij1i ≡ j111i : (1b) The sets of three bits, j000i and j111i, are called codewords. One monitors the codewords to look for errors. If the bits in a codeword are not all the same one uses \majority rule" to correct.
    [Show full text]
  • Pairwise Independence and Derandomization
    Pairwise Independence and Derandomization Pairwise Independence and Derandomization Michael Luby Digital Fountain Fremont, CA, USA Avi Wigderson Institute for Advanced Study Princeton, NJ, USA [email protected] Boston – Delft Foundations and TrendsR in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 USA Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 A Cataloging-in-Publication record is available from the Library of Congress The preferred citation for this publication is M. Luby and A. Wigderson, Pairwise R Independence and Derandomization, Foundation and Trends in Theoretical Com- puter Science, vol 1, no 4, pp 237–301, 2005 Printed on acid-free paper ISBN: 1-933019-22-0 c 2006 M. Luby and A. Wigderson All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Cen- ter, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Quantum Error Correction Todd A
    Quantum Error Correction Todd A. Brun Summary Quantum error correction is a set of methods to protect quantum information—that is, quantum states—from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting code, which is a subspace in a larger Hilbert space. This code is designed so that the most common errors move the state into an error space orthogonal to the original code space while preserving the information in the state. It is possible to determine whether an error has occurred by a suitable measurement and to apply a unitary correction that returns the state to the code space, without measuring (and hence disturbing) the protected state itself. In general, codewords of a quantum code are entangled states. No code that stores information can protect against all possible errors; instead, codes are designed to correct a specific error set, which should be chosen to match the most likely types of noise. An error set is represented by a set of operators that can multiply the codeword state. Most work on quantum error correction has focused on systems of quantum bits, or qubits, which are two-level quantum systems. These can be physically realized by the states of a spin-1/2 particle, the polarization of a single photon, two distinguished levels of a trapped atom or ion, the current states of a microscopic superconducting loop, or many other physical systems. The most widely-used codes are the stabilizer codes, which are closely related to classical linear codes. The code space is the joint +1 eigenspace of a set of commuting Pauli operators on n qubits, called stabilizer generators; the error syndrome is determined by measuring these operators, which allows errors to be diagnosed and corrected.
    [Show full text]
  • Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T
    Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense coding begins with the question: How much information can one qubit convey? Holevo's bound (we discuss this later) says that one qubit can only convey one bit. However, if a sender and receiver share entanglement, i.e., one EPR pair, they can use this entanglement and one qubit to send two classical bits. 2 The four states (the Bell basis) are mutually orthogonal 1 ( 00 + 11 ) 1 ( 00 11 ) 1 ( 01 + 10 ) 1 ( 01 10 ) p2 j i j i p2 j i−j i p2 j i j i p2 j i−j i Any one can be turned into any other (up to a phase factor) by applying the appropriate Pauli matrix to either of the two qubits. 1 0 0 1 id = σx = 0 0 1 1 0 1 0 1 @ A @ A 0 i 1 0 σy = − σz = 0 i 0 1 0 0 1 1 − @ A @ A 3 Superdense Coding: Receiver Two classical bits Sender One qubit Two classical bits EPR Pair of qubits 4 Superdense Coding Alice and Bob start with the state 1 ( 00 + 11 ), where p2 j iAB j iAB Alice holds the first qubit and Bob the second. Alice applies one of the four Pauli matrices to her qubit, and sends her qubit to Bob. He can then tell all four Bell states apart, so he knows which Pauli matrix Alice applied.
    [Show full text]
  • Quantum Computation Beyond the Circuit Model by Stephen Paul Jordan
    Quantum Computation Beyond the Circuit Model by Stephen Paul Jordan Submitted to the Department of Physics in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Physics at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2008 c Stephen Paul Jordan, MMVIII. All rights reserved. The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis document in whole or in part. Author............................................. ............................... Department of Physics May 2008 Certified by.......................................... .............................. Edward H. Farhi Professor of Physics Thesis Supervisor arXiv:0809.2307v1 [quant-ph] 13 Sep 2008 Accepted by......................................... .............................. Thomas J. Greytak Professor of Physics 2 Quantum Computation Beyond the Circuit Model by Stephen Paul Jordan Submitted to the Department of Physics on May 2008, in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Physics Abstract The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implementations of quantum computers. In this thesis, I first present necessary
    [Show full text]