DOCSLIB.ORG

Non-Abelian Quantum Error Correction Weibo Feng

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Non-Abelian Quantum Error Correction Weibo Feng Florida State University Libraries 2015 Non-Abelian Quantum Error Correction Weibo Feng Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES NON-ABELIAN QUANTUM ERROR CORRECTION By WEIBO FENG A Dissertation submitted to the Department of Physics in partial fulfillment of the requirements for the degree of Doctor of Philosophy 2015 Copyright c 2015 Weibo Feng. All Rights Reserved. Weibo Feng defended this dissertation on August 31, 2015. The members of the supervisory committee were: Nicholas E Bonesteel Professor Directing Dissertation Philip L Bowers University Representative Jorge Piekarewicz Committee Member Kun Yang Committee Member Peng Xiong Committee Member The Graduate School has verified and approved the above-named committee members, and certifies that the dissertation has been approved in accordance with university requirements. ii ACKNOWLEDGMENTS Here I present my deepest gratitude to my advisor, Nick Bonesteel, without whom the work can never easily be done. Prof. Bonesteel has been constantly supportive of my study here at the Maglab from the first day I joint it. I thank him not only for introducing me to the field of topological quantum computation, but also for his patient guidance and motivation through my research in this field. I shall be forever benefited from what I have learnt from him during this precious period of time. Also to the committee members of my defense, Prof. Philip Bowers, Prof. Takemichi Okui, Prof. Jorge Piekarewicz, Prof. Oskar Vafek, Prof. Pen Xiong and Prof. Kun Yang, I thank them for their challenging questions and helpful comments which have inspired me greatly both in my Prospectus and final Dissertation. I would like to thank my colleagues here in the Maglab, Daniel Zeuch and Julia Wildeboer for their continuous support and feedback throughout the writing and defending of my Dissertation. I thank Julia for the encouragement she gave to me academic-wise and nonacademic-wise. The cakes and cookies she brought to me when I was striving hard to finish my Dissertation were the best! My sincere thanks also go to my good friends in Tally: the list of which can be a really long one and I want to thank them for all the fun we have experienced together here in this lovely town. Our friendship has always been the greatest comfort to me when I was in my hardest time. Finally, I want to thank my parents and my sister. In this past several years their love and support to me are the anchor of my life here in a foreign land. They are the reasons why I never give up on this long life voyage. May my work here and what I shall achieve in the future repay them well. iii TABLE OF CONTENTS ListofFigures ......................................... ... vi Abstract............................................. xiii 1 Introduction 1 1.1 Classical and Quantum Computation . 1 1.1.1 FromBitstoQubits ................................ 2 1.1.2 QuantumGates................................... 4 1.1.3 Decoherence and Quantum Error Correction . 7 1.2 Topological Quantum Computation . 9 1.3 Non-Abelian Quantum Error Correction . 11 1.4 BriefOverviewofDissertation. 12 2 Fibonacci Anyons And Levin-Wen Models 13 2.1 Fibonacci Anyons . 13 2.1.1 Basic Algebraic Theory of Fibonacci Anyons . 16 2.1.2 Pentagon and Hexagon Equations . 21 2.1.3 Quantum Computing by Braiding Fibonacci Anyons . 29 2.2 FibonacciLevin-WenModels . 33 2.3 Summary .......................................... 44 3 Non-Abelian Quantum Error Correction 45 3.1 Previous Work on Measuring Qv and Bp ......................... 45 3.1.1 VertexErrors.................................... 47 3.1.2 Plaquette Errors Measured by Plaquette Reduction . 49 3.2 New Method for Measuring and Correcting Vertex and Plaquette Errors . 60 3.2.1 VertexErrorsonStringEnds . 61 3.2.2 Plaquette Swapping . 65 3.2.3 Plaquette Swapping: Abelian Case . 73 3.3 MovingErrors ...................................... 75 3.3.1 MovingVertexErrors ............................... 76 3.3.2 PlaquetteErrorsRevisited . 79 3.3.3 MovingPlaquetteErrors. .. 81 3.4 FusingErrors ...................................... 85 3.5 SummaryofResults ................................... 87 4 Summary of Dissertation and Future Work 89 iv Appendices A Quantum Circuits to Verify the Pentagon Equation 92 B Quantum Circuits to Verify the Hexagon Equation 94 Bibliography .......................................... 96 BiographicalSketch ..................................... 99 v LIST OF FIGURES 1.1 A classical and quantum bit. (Right) A classical bit can be represented by an arrow which points up if it is in the state 0 or down if it is the state 1. (Left) A qubit can be represented by an arrow which points to a point on the Bloch sphere. Like a classical bit, when the arrow is pointing up or down along the z axis the qubit is in the state 0 or 1 , respectively. However, unlike the classical bit, the qubit can point in an | i | i arbitrary direction, corresponding to a quantum superposition of the states 0 and 1 . 3 | i | i 1.2 One and two qubit quantum gates shown in quantum circuit notation. (a) A single- qubit gate. This gate which applies the unitary operation U to a qubit in the state ψ . The horizontal line represents the qubit with time flowing from left to right. (b) | i A controlled-U two-qubit quantum gate. This gate applies a unitary operation to the bottom qubit in the state ψ if the control qubit is in the state 1 , but otherwise | i | i doesnothing.......................................... 5 1.3 Universal gate set and example of a quantum circuit. (a) The set of all single qubit operations together with the ability to carry out controlled-NOT gates is a universal set of gates, meaning that any unitary operation acting on many qubits can be carried out using them. (b) Example of a quantum circuit acting on 7 qubits. 6 1.4 Toffoli-class quantum gates. (a) A controlled-controlled-U three-qubit gate. This gate applies the operation U to the bottom qubit in the state ψ if and only if the top two | i qubits are both in the state 1 , otherwise it does nothing. (b) A controlled-controlled- | i NOT gate which is also known as a Toffoli gate. (c) A controlled-controlled-controlled- U gate. Such multiqubit controlled gates play an important role in the quantum circuits developed in Chapter 3 of this Dissertation. 8 2.1 A recursive calculation shows that the total quantum dimension of n Fibonacci anyons fusing together follows the Fibonacci series. The first term on the right hand side describes the case when the first two particles fused into a total charge 1, which turns out to be Nn−1. The second term shows when the fused charge of the first two is 0, in which case the number fusion channels is Nn−2 .................... 15 2.2 Two different ways of combining a group of 3 anyons b, a and d are connected by a unitary operation, i.e. the F -tensor. The oval diagram on the left shows how we choose to combine different pairs of anyons( b,a or a,d ). The world line diagram { } { } on the right tells the same story with time flows from top to bottom. 17 2.3 The R-move switches two anyons before combining into one. The difference between ab the original and the rotated wave functions is the so called R-matrix Rc . 18 2.4 The tube version of the R-move. The space-time line of each anyon is represented by a elastic tube that can track how exactly the line is twisted. The anyon pair a and b then undergoes a counter-clockwise exchange. After that we proceed to ”tighten” the vi diagram by pulling the tubes away from each other, which results in a clockwise twist for both of the anyon a and b. Note that the anyon c which represents their total charge is still not rotated yet. To finish the exchange we have to continue to untwist the tube c, giving us a counter-clockwise π rotation. 19 2.5 The topological spin of a Fibonacci anyon a, which is unique to the 2+1 dimensional phases of matter. Rotating the quasi-particle in 2π is equivalent to a full twist on its tube version, which results in an overall phase θa. .................... 21 2.6 The pentagon equation which tells the story of two equivalent path of basis changing. Starting from the basis to the very left, one can end at the basis to the very right either through two F -moves(the upper path), of three F -moves(the lower path), putting together to be a pentagon diagram. The diagram is also isotropic: meaning that every basis can be the starting point or the end point. There are always two equivalent path connecting in between — one only needs to change the direction of the F -moves accordingly........................................... 22 2.7 The world line version of the pentagon equation. Time flows from top to bottom. Each line segment represents an anyon before it merges with another one to create a new anyon that has their total charge. 23 2.8 A deformed version of the F -move equation, which better demonstrates the symme- tries underneath its structure. The dashed red lines mark the symmetric lines of the equation. ........................................... 24 2.9 The F -move for Fibonacci anyons in its every component. For each fusion pattern(tree diagram) the black thick line represents a particle of charge 1, while the light thin line marks a charge 0 anyon. (a)&(b) are the cases where the target particle e is solely | i determined by the fusion rule Eq. 2.1. (c) shows the only two non-trivial F -moves here, which needs to be solved in further discussions.
Load more

Recommended publications
  • Simulating Quantum Field Theory with a Quantum Computer
    Simulating quantum field theory with a quantum computer John Preskill Lattice 2018 28 July 2018 This talk has two parts (1) Near-term prospects for quantum computing. (2) Opportunities in quantum simulation of quantum field theory. Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful We know examples of problems that can be solved efficiently by a quantum computer, where we believe the problems are hard for classical computers.
    [Show full text]
  • Universal Control and Error Correction in Multi-Qubit Spin Registers in Diamond T
    LETTERS PUBLISHED ONLINE: 2 FEBRUARY 2014 | DOI: 10.1038/NNANO.2014.2 Universal control and error correction in multi-qubit spin registers in diamond T. H. Taminiau 1,J.Cramer1,T.vanderSar1†,V.V.Dobrovitski2 and R. Hanson1* Quantum registers of nuclear spins coupled to electron spins of including one with an additional strongly coupled 13C spin (see individual solid-state defects are a promising platform for Supplementary Information). To demonstrate the generality of quantum information processing1–13. Pioneering experiments our approach to create multi-qubit registers, we realized the initia- selected defects with favourably located nuclear spins with par- lization, control and readout of three weakly coupled 13C spins for ticularly strong hyperfine couplings4–10. To progress towards each NV centre studied (see Supplementary Information). In the large-scale applications, larger and deterministically available following, we consider one of these NV centres in detail and use nuclear registers are highly desirable. Here, we realize univer- two of its weakly coupled 13C spins to form a three-qubit register sal control over multi-qubit spin registers by harnessing abun- for quantum error correction (Fig. 1a). dant weakly coupled nuclear spins. We use the electron spin of Our control method exploits the dependence of the nuclear spin a nitrogen–vacancy centre in diamond to selectively initialize, quantization axis on the electron spin state as a result of the aniso- control and read out carbon-13 spins in the surrounding spin tropic hyperfine interaction (see Methods for hyperfine par- bath and construct high-fidelity single- and two-qubit gates. ameters), so no radiofrequency driving of the nuclear spins is We exploit these new capabilities to implement a three-qubit required7,23–28.
    [Show full text]
  • Unconditional Quantum Teleportation
    R ESEARCH A RTICLES our experiment achieves Fexp 5 0.58 6 0.02 for the field emerging from Bob’s station, thus Unconditional Quantum demonstrating the nonclassical character of this experimental implementation. Teleportation To describe the infinite-dimensional states of optical fields, it is convenient to introduce a A. Furusawa, J. L. Sørensen, S. L. Braunstein, C. A. Fuchs, pair (x, p) of continuous variables of the electric H. J. Kimble,* E. S. Polzik field, called the quadrature-phase amplitudes (QAs), that are analogous to the canonically Quantum teleportation of optical coherent states was demonstrated experi- conjugate variables of position and momentum mentally using squeezed-state entanglement. The quantum nature of the of a massive particle (15). In terms of this achieved teleportation was verified by the experimentally determined fidelity analogy, the entangled beams shared by Alice Fexp 5 0.58 6 0.02, which describes the match between input and output states. and Bob have nonlocal correlations similar to A fidelity greater than 0.5 is not possible for coherent states without the use those first described by Einstein et al.(16). The of entanglement. This is the first realization of unconditional quantum tele- requisite EPR state is efficiently generated via portation where every state entering the device is actually teleported. the nonlinear optical process of parametric down-conversion previously demonstrated in Quantum teleportation is the disembodied subsystems of infinite-dimensional systems (17). The resulting state corresponds to a transport of an unknown quantum state from where the above advantages can be put to use. squeezed two-mode optical field.
    [Show full text]
  • Quantum Error Modelling and Correction in Long Distance Teleportation Using Singlet States by Joe Aung
    Quantum Error Modelling and Correction in Long Distance Teleportation using Singlet States by Joe Aung Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2002 @ Massachusetts Institute of Technology 2002. All rights reserved. Author ................... " Department of Electrical Engineering and Computer Science May 21, 2002 72-1 14 Certified by.................. .V. ..... ..'P . .. ........ Jeffrey H. Shapiro Ju us . tn Professor of Electrical Engineering Director, Research Laboratory for Electronics Thesis Supervisor Accepted by................I................... ................... Arthur C. Smith Chairman, Department Committee on Graduate Students BARKER MASSACHUSE1TS INSTITUTE OF TECHNOLOGY JUL 3 1 2002 LIBRARIES 2 Quantum Error Modelling and Correction in Long Distance Teleportation using Singlet States by Joe Aung Submitted to the Department of Electrical Engineering and Computer Science on May 21, 2002, in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science Abstract Under a multidisciplinary university research initiative (MURI) program, researchers at the Massachusetts Institute of Technology (MIT) and Northwestern University (NU) are devel- oping a long-distance, high-fidelity quantum teleportation system. This system uses a novel ultrabright source of entangled photon pairs and trapped-atom quantum memories. This thesis will investigate the potential teleportation errors involved in the MIT/NU system. A single-photon, Bell-diagonal error model is developed that allows us to restrict possible errors to just four distinct events. The effects of these errors on teleportation, as well as their probabilities of occurrence, are determined.
    [Show full text]
  • Phd Proposal 2020: Quantum Error Correction with Superconducting Circuits
    PhD Proposal 2020: Quantum error correction with superconducting circuits Keywords: quantum computing, quantum error correction, Josephson junctions, circuit quantum electrodynamics, high-impedance circuits • Laboratory name: Laboratoire de Physique de l'Ecole Normale Supérieure de Paris • PhD advisors : Philippe Campagne-Ibarcq ([email protected]) and Zaki Leghtas ([email protected]). • Web pages: http://cas.ensmp.fr/~leghtas/ https://philippecampagneib.wixsite.com/research • PhD location: ENS Paris, 24 rue Lhomond Paris 75005. • Funding: ERC starting grant. Quantum systems can occupy peculiar states, such as superpositions or entangled states. These states are intrinsically fragile and eventually get wiped out by inevitable interactions with the environment. Protecting quantum states against decoherence is a formidable and fundamental problem in physics, and it is pivotal for the future of quantum computing. Quantum error correction provides a potential solution, but its current envisioned implementations require daunting resources: a single bit of information is protected by encoding it across tens of thousands of physical qubits. Our team in Paris proposes to protect quantum information in an entirely new type of qubit with two key specicities. First, it will be encoded in a single superconducting circuit resonator whose innite dimensional Hilbert space can replace large registers of physical qubits. Second, this qubit will be rf-powered, continuously exchanging photons with a reservoir. This approach challenges the intuition that a qubit must be isolated from its environment. Instead, the reservoir acts as a feedback loop which continuously and autonomously corrects against errors. This correction takes place at the level of the quantum hardware, and reduces the need for error syndrome measurements which are resource intensive.
    [Show full text]
  • Arxiv:0905.2794V4 [Quant-Ph] 21 Jun 2013 Error Correction 7 B
    Quantum Error Correction for Beginners Simon J. Devitt,1, ∗ William J. Munro,2 and Kae Nemoto1 1National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku Tokyo 101-8340. Japan 2NTT Basic Research Laboratories NTT Corporation 3-1 Morinosato-Wakamiya, Atsugi Kanagawa 243-0198. Japan (Dated: June 24, 2013) Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspect of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. This development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.
    [Show full text]
  • Machine Learning Quantum Error Correction Codes: Learning the Toric Code
    ,, % % hhXPP ¨, hXH(HPXh % ,¨ Instituto de F´ısicaTe´orica (((¨lQ e@QQ IFT Universidade Estadual Paulista el e@@l DISSERTAC¸ AO~ DE MESTRADO IFT{D.009/18 Machine Learning Quantum Error Correction Codes: Learning the Toric Code Carlos Gustavo Rodriguez Fernandez Orientador Leandro Aolita Dezembro de 2018 Rodriguez Fernandez, Carlos Gustavo R696m Machine learning quantum error correction codes: learning the toric code / Carlos Gustavo Rodriguez Fernandez. – São Paulo, 2018 43 f. : il. Dissertação (mestrado) - Universidade Estadual Paulista (Unesp), Instituto de Física Teórica (IFT), São Paulo Orientador: Leandro Aolita 1. Aprendizado do computador. 2. Códigos de controle de erros(Teoria da informação) 3. Informação quântica. I. Título. Sistema de geração automática de fichas catalográficas da Unesp. Biblioteca do Instituto de Física Teórica (IFT), São Paulo. Dados fornecidos pelo autor(a). Acknowledgements I'd like to thank Giacomo Torlai for painstakingly explaining to me David Poulin's meth- ods of simulating the toric code. I'd also like to thank Giacomo, Juan Carrasquilla and Lauren Haywards for sharing some very useful code I used for the simulation and learning of the toric code. I'd like to thank Gwyneth Allwright for her useful comments on a draft of this essay. I'd also like to thank Leandro Aolita for his patience in reading some of the final drafts of this work. Of course, I'd like to thank the admin staff in Perimeter Institute { in partiuclar, without Debbie not of this would have been possible. I'm also deeply indebted to Roger Melko, who supervised this work in Perimeter Institute (where a version of this work was presented as my PSI Essay).
    [Show full text]
  • Arxiv:2009.06242V1 [Quant-Ph] 14 Sep 2020 Special Type of Highly Entangled State
    Quantum teleportation of physical qubits into logical code-spaces Yi-Han Luo,1, 2, ∗ Ming-Cheng Chen,1, 2, ∗ Manuel Erhard,3, 4 Han-Sen Zhong,1, 2 Dian Wu,1, 2 Hao-Yang Tang,1, 2 Qi Zhao,1, 2 Xi-Lin Wang,1, 2 Keisuke Fujii,5 Li Li,1, 2 Nai-Le Liu,1, 2 Kae Nemoto,6, 7 William J. Munro,6, 7 Chao-Yang Lu,1, 2 Anton Zeilinger,3, 4 and Jian-Wei Pan1, 2 1Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, 230026, China 2CAS Centre for Excellence in Quantum Information and Quantum Physics, Hefei, 230026, China 3Austrian Academy of Sciences, Institute for Quantum Optics and Quantum Information (IQOQI), Boltzmanngasse 3, A-1090 Vienna, Austria 4Vienna Center for Quantum Science and Technology (VCQ), Faculty of Physics, University of Vienna, A-1090 Vienna, Austria 5Graduate School of Engineering Science Division of Advanced Electronics and Optical Science Quantum Computing Group, 1-3 Machikaneyama, Toyonaka, Osaka, 560-8531 6NTT Basic Research Laboratories & NTT Research Center for Theoretical Quantum Physics, NTT Corporation, 3-1 Morinosato-Wakamiya, Atsugi-shi, Kanagawa, 243-0198, Japan 7National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Quantum error correction is an essential tool for reliably performing tasks for processing quantum informa- tion on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that non-transverse operations, which are essential for universal quantum computation, lead to the spread of errors.
    [Show full text]
  • Quantum Information Processing and Quantum Optics with Circuit Quantum Electrodynamics
    FOCUS | REVIEW ARTICLE FOCUS | REVIEWhttps://doi.org/10.1038/s41567-020-0806-z ARTICLE Quantum information processing and quantum optics with circuit quantum electrodynamics Alexandre Blais 1,2,3 ✉ , Steven M. Girvin 4,5 and William D. Oliver6,7,8 Since the first observation of coherent quantum behaviour in a superconducting qubit, now more than 20 years ago, there have been substantial developments in the field of superconducting quantum circuits. One such advance is the introduction of the concepts of cavity quantum electrodynamics (QED) to superconducting circuits, to yield what is now known as circuit QED. This approach realizes in a single architecture the essential requirements for quantum computation, and has already been used to run simple quantum algorithms and to operate tens of superconducting qubits simultaneously. For these reasons, circuit QED is one of the leading architectures for quantum computation. In parallel to these advances towards quantum information process- ing, circuit QED offers new opportunities for the exploration of the rich physics of quantum optics in novel parameter regimes in which strongly nonlinear effects are readily visible at the level of individual microwave photons. We review circuit QED in the context of quantum information processing and quantum optics, and discuss some of the challenges on the road towards scalable quantum computation. avity quantum electrodynamics (QED) studies the interac- introduce the basic concepts of circuit QED and how the new tion of light and matter at its most fundamental level: the parameter regimes that can be obtained in circuit QED, compared Ccoherent interaction of single atoms with single photons. with cavity QED, lead to new possibilities for quantum optics.
    [Show full text]
  • Introduction to Quantum Error Correction
    Schrödinger Cats, Maxwell’s Demon and Quantum Error Correction Experiment Theory Michel Devoret SMG Luigi Frunzio Liang Jiang Rob Schoelkopf Leonid Glazman M. Mirrahimi ** Andrei Petrenko Nissim Ofek Shruti Puri Reinier Heeres Yaxing Zhang Philip Reinhold Victor Albert** Yehan Liu Kjungjoo Noh** Zaki Leghtas Richard Brierley Brian Vlastakis Claudia De Grandi +….. Zaki Leghtas Juha Salmilehto Matti Silveri Uri Vool Huaixui Zheng Marios Michael +….. QuantumInstitute.yale.edu 1 Quantum Information Science Control theory, Coding theory, Computational Complexity theory, Networks, Systems, Information theory Ultra-high-speed digital, analog, Programming languages, Compilers microwave electronics, FPGA Electrical Computer Engineering Science QIS Physics Applied Quantum Physics Chemistry Quantum mechanics, Quantum optics, Circuit QED, Materials Science http://quantuminstitute.yale.edu/ 2 Is quantum information carried by waves or by particles? YES! 3 Is quantum information analog or digital? YES! 4 Quantum information is digital: Energy levels of a quantum system are discrete. We use only the lowest two. Measurement of the state of a qubit yields ENERGY (only) 1 classical bit of information. 4 3 2 excited state 1 =e = ↑ 1 0 } ground state 0 =g = ↓ 5 Quantum information is analog: A quantum system with two distinct states can exist in an Infinite number of physical states (‘superpositions’) intermediate between ↓ and ↑ . Bug: We are uncertain which state the bit is in. Measurement results are truly random. Feature: Qubit is in both states at once, so we can do parallel processing. Potential exponential speed up. 6 Quantum Computing is a New Paradigm • Quantum computing: a completely new way to store and process information. • Superposition: each quantum bit can be BOTH a zero and a one.
    [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]
  • Arxiv:Quant-Ph/9705032V3 26 Aug 1997
    CALT-68-2113 QUIC-97-031 quant-ph/9705032 Quantum Computing: Pro and Con John Preskill1 California Institute of Technology, Pasadena, CA 91125, USA Abstract I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum al- gorithms and consider the prospects for finding new ones. Quantum computers are notoriously susceptible to making errors; I discuss recently developed fault-tolerant procedures that enable a quantum computer with noisy gates to perform reliably. Quantum computing hardware is still in its infancy; I comment on the specifications that should be met by future hardware. Over the past few years, work on quantum computation has erected a new classification of computational complexity, has generated profound insights into the nature of decoherence, and has stimulated the formulation of new techniques in high-precision experimental physics. A broad interdisci- plinary effort will be needed if quantum computers are to fulfill their destiny as the world’s fastest computing devices. This paper is an expanded version of remarks that were prepared for a panel discussion at the ITP Conference on Quantum Coherence and Decoherence, 17 December 1996. 1 Introduction The purpose of this panel discussion is to explore the future prospects for quantum computation. It seems to me that there are three main questions about quantum computers that we should try to address here: Do we want to build one? What will a quantum computer be good for? There is no doubt • that constructing a working quantum computer will be a great technical challenge; we will be persuaded to try to meet that challenge only if the potential payoff is correspondingly great.
    [Show full text]