Leakage Suppression in the Toric Code

Total Page:16

File Type:pdf, Size:1020Kb

Leakage Suppression in the Toric Code Leakage Suppression in the Toric Code Martin Suchara Andrew W. Cross Jay M. Gambetta IBM T. J. Watson Research Center IBM T. J. Watson Research Center IBM T. J. Watson Research Center 1101 Kitchawan Road 1101 Kitchawan Road 1101 Kitchawan Road Yorktown Heights, New York 10598 Yorktown Heights, New York 10598 Yorktown Heights, New York 10598 Email: [email protected] Email: [email protected] Email: [email protected] Abstract—Quantum codes excel at correcting local noise but Most prior studies of quantum codes do not consider fail to correct leakage faults that excite qubits to states outside errors due to leakage, and the the impact of leakage on the the computational space. Aliferis and Terhal have shown that performance of error-correcting codes has not been thoroughly an accuracy threshold exists for leakage faults using gadgets understood, particularly in the surface code. Topological codes called leakage reduction units (LRUs). However, these gadgets are known to have a 50% threshold to idealized erasure reduce the threshold and increase experimental complexity, and errors [15], [16]. However, this idealized model is far from the costs have not been thoroughly understood. We explore a variety of techniques for leakage resilience in topological codes. realistic. Moreover, the erasure correction strategy [15], [17] Our contributions are threefold. First, we develop a leakage model measures check operators that each act over a relatively large that is physically motivated and efficient to simulate. Second, we neighborhood, and this is challenging to do with a fixed planar use Monte-Carlo simulations to survey several syndrome extrac- array of qubits [18]. In less idealized leakage models, leakage tion circuits. Third, given the capability to perform 3-outcome errors do not correspond to simple erasures since they may measurements, we present a dramatically improved syndrome remain undetected or are only imprecisely located. Leakage of processing algorithm. Our simulations show that simple circuits this form has been studied for a quantum repetition code [19] with one extra CNOT per qubit reduce the accuracy threshold and for specific types of gates applied to superconducting by less than a factor of 4 when leakage and depolarizing noise qubits [20], [21]. Despite this work, the impact of leakage on rates are comparable compared to a scenario without leakage. the accuracy threshold of topological codes remains unclear. To This becomes a factor of 2 when the decoder uses 3-outcome measurements. Finally, we make the surprising observation that address this problem, we systematically study several leakage for physical error rates less than 2 × 10−4, placing LRUs after reducing circuits and develop a new syndrome processing every gate may achieve the lowest logical error rate. We expect strategy that further enhances the benefits of these circuits. that the ideas may generalize to other topological codes. II. TORIC CODE I. INTRODUCTION Large-scale quantum computers require a fault-tolerant The toric code [1] is the prototypical example of topologi- architecture based on quantum error-correcting codes. Topo- cal stabilizer codes. It is defined on a d by d square array where logical error-correcting codes [1], [2] stand out due to their d is the code distance. The left-right and top-bottom boundaries favorable properties such as local check operators, simple of the array are associated. Vertices of the array are connected syndrome extraction circuits [3], and flexible fault-tolerant to form a graph where each of the n edges carries a physical logic based on transversal gates, code deformation [4], [5], or qubit, called a code or data qubit. Each vertex and each face lattice surgery [6]. These properties endow topological codes carries a qubit used for error-correction, called a syndrome with a high accuracy threshold, estimates of which vary from or ancilla qubit (see Fig. 1a). The stabilizer S of the code is 0:67% [7] to above 1% [8]. generated by a set of check operators fAvg and fBf g that belong to the n-qubit Pauli group and are attached to each These threshold estimates assume a depolarizing noise vertex v and face f of the graph. These operators are tensor model that approximates realistic noise. However, the model products of single qubit Pauli operators X and Z. The vertex does not include so-called leakage faults that map quantum N (or star) operators Av = "2N(v) X" are X-type checks that states out of the 2-dimensional qubit subspace and into a apply an X to the qubits on the four edges N(v) incident on higher-dimensional Hilbert space, a behavior exhibited by N vertex v. The face (or plaquette) operators Bf = "2N(f) Z" many physical realizations of qubits. Leakage errors can be are Z-type checks that apply a Z to the qubits on the four edges mitigated by constructing special quantum circuits that convert N(f) on the boundary of face f. The toric code encodes a pair leakage errors into “regular” errors and may or may not simul- of logical qubits. Representatives for each class of logical Pauli taneously raise a flag to indicate the location of the leakage X and Z operators are shown in Fig. 1a. error. Gadgets that detect leakage convert it into a located loss error that is easier to correct [9]–[11]. Leakage reduction units The check operators are measured simultaneously [3] using (LRUs) convert leakage errors into regular errors but do not circuits shown in Fig. 1b and Fig. 1c. In the first step, all give an indication that leakage has occurred [12], [13]. Leakage plaquette ancillas are prepared in the j0i state and all site mitigation with LRUs was rigorously analyzed by Aliferis and ancillas in the j+i state. In the next four steps, CNOT gates Terhal [12], who showed existence of a threshold to leakage in act between each ancilla and the data qubit above, left, right, concatenated codes. Subsequent work has shown that circuits and below the ancilla, in that order. This corresponds to the can be further simplified while remaining fault-tolerant [14]. gate order used in [7], [8]. Finally, the plaquette ancillas are Z2 X1 Z dD dD Z1 Z Z Z X2 d d plaquette R R X dL dL X X dU dU X star s s data ancilla aZ aX (a) (b) (c) Fig. 1. (a) The toric code has a natural two-dimensional layout on the surface of a torus. Qubits function as either data qubits, used to store the encoded quantum state, or ancilla qubits, used to measure check operators (stabilizers) of the quantum code. Z-type check operators associate to faces (plaquettes) and X-type check operators associate to vertices (stars). Each check operator involves four data qubits and is measured using an ancilla qubit. The torus encodes a pair of qubits whose representative logical Pauli operators X1, Z1, X2, and Z2 are shown. (b,c) These circuits measure (b) plaquette and (c) star operators using four CNOT gates together with preparations and measurements. In each circuit, data qubits dD;R;L;U interact with an ancilla qubit az=x that is prepared in the state j0i or j+i = p1 (j0i + j1i). This ancilla is then measured in the basis of eigenstates of Z or X, respectively. 2 measured in the Z eigenbasis and the star ancillas in the X probability p" on each output qutrit of an ideal gate. There is a eigenbasis. These six steps constitute an error-correction cycle. relaxation process with probability p#, analogous to amplitude Since syndrome measurements may not be reliable, O(d) damping, that acts independently on each output qutrit of an error-correction cycles are performed to improve confidence ideal gate. Another important aspect of our model concerns in the syndrome. A syndrome history consists of these O(d) two-qubit gates. If one of the interacting qubits is leaked, the syndrome measurement outcomes each with 2d2 bits. other qubit is depolarized. Noisy two-qubit gates are followed by independent excitation and relaxation maps on each output The corrective operation is determined by a decoding qutrit. algorithm that processes the syndrome history. The classic approach [3] processes plaquette and star syndromes inde- The model has parameters p (depolarizing error proba- pendently to find bit and phase error corrections. A separate bility), q (syndrome measurement error probability, we set decoding graph G = (V; E) is constructed [22] for the two q = p), p" (probability of excitation outside of the com- cases. The graph is built by translating the unit cell shown putational space), and p# (probability of relaxation back to in Fig. 2a. The edges E correspond to error events in the the computational space). For convenience, we also define error-correction circuits. The horizontal edges b and d represent the relative excitation rate r = p"=p and relaxation rate qubit errors, the vertical edge a represents measurement errors s = p#=p. Elementary quantum gates behave as follows. Idle and the diagonal edges c, e, and f represent correlated errors. qubits depolarize with probability p, where we apply one of The weight of each edge approximates the negative logarithm X, Y , or Z uniformly at random. They undergo free evolution of the probability of the corresponding error. Each nontrivial and do not leak. However, an idle leaked qubit may relax to syndrome in the syndrome history introduces a defect in the the computational space with probability p#. State preparation decoding graph. A corrective operation that is likely to succeed succeeds with probability 1−p, otherwise the orthogonal state is obtained by matching pairs of defects using the minimum is prepared. With probability p" the prepared qubit leaks.
Recommended publications
  • Painstakingly-Edited Typeset Lecture Notes
    Physics 239: Topology from Physics Winter 2021 Lecturer: McGreevy These lecture notes live here. Please email corrections and questions to mcgreevy at physics dot ucsd dot edu. Last updated: May 26, 2021, 14:36:17 1 Contents 0.1 Introductory remarks............................3 0.2 Conventions.................................8 0.3 Sources....................................9 1 The toric code and homology 10 1.1 Cell complexes and homology....................... 21 1.2 p-form ZN toric code............................ 23 1.3 Some examples............................... 26 1.4 Higgsing, change of coefficients, exact sequences............. 32 1.5 Independence of cellulation......................... 36 1.6 Gapped boundaries and relative homology................ 39 1.7 Duality.................................... 42 2 Supersymmetric quantum mechanics and cohomology, index theory, Morse theory 49 2.1 Supersymmetric quantum mechanics................... 49 2.2 Differential forms consolidation...................... 61 2.3 Supersymmetric QM and Morse theory.................. 66 2.4 Global information from local information................ 74 2.5 Homology and cohomology......................... 77 2.6 Cech cohomology.............................. 80 2.7 Local reconstructability of quantum states................ 86 3 Quantum Double Model and Homotopy 89 3.1 Notions of `same'.............................. 89 3.2 Homotopy equivalence and cohomology.................. 90 3.3 Homotopy equivalence and homology................... 91 3.4 Morse theory and homotopy
    [Show full text]
  • Superconducting Quantum Simulator for Topological Order and the Toric Code
    Superconducting Quantum Simulator for Topological Order and the Toric Code Mahdi Sameti,1 Anton Potoˇcnik,2 Dan E. Browne,3 Andreas Wallraff,2 and Michael J. Hartmann1 1Institute of Photonics and Quantum Sciences, Heriot-Watt University Edinburgh EH14 4AS, United Kingdom 2Department of Physics, ETH Z¨urich,CH-8093 Z¨urich,Switzerland 3Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, United Kingdom (Dated: March 20, 2017) Topological order is now being established as a central criterion for characterizing and classifying ground states of condensed matter systems and complements categorizations based on symmetries. Fractional quantum Hall systems and quantum spin liquids are receiving substantial interest because of their intriguing quantum correlations, their exotic excitations and prospects for protecting stored quantum information against errors. Here we show that the Hamiltonian of the central model of this class of systems, the Toric Code, can be directly implemented as an analog quantum simulator in lattices of superconducting circuits. The four-body interactions, which lie at its heart, are in our concept realized via Superconducting Quantum Interference Devices (SQUIDs) that are driven by a suitably oscillating flux bias. All physical qubits and coupling SQUIDs can be individually controlled with high precision. Topologically ordered states can be prepared via an adiabatic ramp of the stabilizer interactions. Strings of qubit operators, including the stabilizers and correlations along non-contractible loops, can be read out via a capacitive coupling to read-out resonators. Moreover, the available single qubit operations allow to create and propagate elementary excitations of the Toric Code and to verify their fractional statistics.
    [Show full text]
  • Arxiv:1803.00026V4 [Cond-Mat.Str-El] 8 Feb 2019 3 Variational Quantum-Classical Simulation (VQCS) 5
    SciPost Physics Submission Efficient variational simulation of non-trivial quantum states Wen Wei Ho1*, Timothy H. Hsieh2,3, 1 Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 2 Kavli Institute for Theoretical Physics, University of California, Santa Barbara, California 93106, USA 3 Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada *[email protected] February 12, 2019 Abstract We provide an efficient and general route for preparing non-trivial quantum states that are not adiabatically connected to unentangled product states. Our approach is a hybrid quantum-classical variational protocol that incorporates a feedback loop between a quantum simulator and a classical computer, and is experimen- tally realizable on near-term quantum devices of synthetic quantum systems. We find explicit protocols which prepare with perfect fidelities (i) the Greenberger- Horne-Zeilinger (GHZ) state, (ii) a quantum critical state, and (iii) a topologically ordered state, with L variational parameters and physical runtimes T that scale linearly with the system size L. We furthermore conjecture and support numeri- cally that our protocol can prepare, with perfect fidelity and similar operational costs, the ground state of every point in the one dimensional transverse field Ising model phase diagram. Besides being practically useful, our results also illustrate the utility of such variational ans¨atzeas good descriptions of non-trivial states of matter. Contents 1 Introduction 2 2 Non-trivial quantum states
    [Show full text]
  • QIP 2010 Tutorial and Scientific Programmes
    QIP 2010 15th – 22nd January, Zürich, Switzerland Tutorial and Scientific Programmes asymptotically large number of channel uses. Such “regularized” formulas tell us Friday, 15th January very little. The purpose of this talk is to give an overview of what we know about 10:00 – 17:10 Jiannis Pachos (Univ. Leeds) this need for regularization, when and why it happens, and what it means. I will Why should anyone care about computing with anyons? focus on the quantum capacity of a quantum channel, which is the case we understand best. This is a short course in topological quantum computation. The topics to be covered include: 1. Introduction to anyons and topological models. 15:00 – 16:55 Daniel Nagaj (Slovak Academy of Sciences) 2. Quantum Double Models. These are stabilizer codes, that can be described Local Hamiltonians in quantum computation very much like quantum error correcting codes. They include the toric code This talk is about two Hamiltonian Complexity questions. First, how hard is it to and various extensions. compute the ground state properties of quantum systems with local Hamiltonians? 3. The Jones polynomials, their relation to anyons and their approximation by Second, which spin systems with time-independent (and perhaps, translationally- quantum algorithms. invariant) local interactions could be used for universal computation? 4. Overview of current state of topological quantum computation and open Aiming at a participant without previous understanding of complexity theory, we will discuss two locally-constrained quantum problems: k-local Hamiltonian and questions. quantum k-SAT. Learning the techniques of Kitaev and others along the way, our first goal is the understanding of QMA-completeness of these problems.
    [Show full text]
  • Fault-Tolerant Quantum Computation: Theory and Practice
    FAULT-TOLERANT QUANTUM COMPUTATION: THEORY AND PRACTICE FAULT-TOLERANT QUANTUM COMPUTATION: THEORY AND PRACTICE Dissertation for the purpose of obtaining the degree of doctor at Delft University of Technology, by the authority of the Rector Magnificus prof. dr. ir. T.H.J.J. van der Hagen, Chair of the Board of Doctorates, to be defended publicly on Wednesday 15th, January 2020 at 12:30 o’clock by Christophe VUILLOT Master of Science in Computer Science, Université Paris Diderot, Paris, France, born in Clamart, France. This dissertation has been approved by the promotor. promotor: prof. dr. B. M. Terhal Composition of the doctoral committee: Rector Magnificus, chairperson Prof. dr. B. M. Terhal Technische Universiteit Delft, promotor Independent members: Prof. dr. C.W.J. Beenakker Universiteit Leiden Prof. dr. L. DiCarlo Technische Universiteit Delft Prof. dr. R.T. König Technische Universität München Dr. A. Leverrier Inria Paris Prof. dr. ir. L.M.K. Vandersypen Technische Universiteit Delft Prof. dr. R.M. de Wolf Centrum Wiskunde & Informatica Keywords: quantum computing, quantum error correction, fault-tolerance Printed by: Gildeprint - www.gildeprint.nl Front: Kandinsky Vassily (1866-1944), Auf Weiss II, 1923 Photo © Centre Pompidou, MNAM-CCI, Dist. RMN-Grand Palais / image Centre Pompidou, MNAM-CCI Copyright © 2019 by C. Vuillot ISBN 978-94-6384-097-2 An electronic version of this dissertation is available at http://repository.tudelft.nl/. This thesis is dedicated to my daughter Andréa and her mother Lisa. CONTENTS Summary xi Preface xiii 1 Introduction 1 1.1 Introduction to quantum computing . 2 1.1.1 Quantum mechanics. 2 1.1.2 Elementary quantum systems .
    [Show full text]
  • Performance of Various Low-Level Decoder for Surface Codes in the Presence of Measurement Error
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-2021 Performance of Various Low-level Decoder for Surface Codes in the Presence of Measurement Error Claire E. Badger Follow this and additional works at: https://scholar.afit.edu/etd Part of the Computer Sciences Commons Recommended Citation Badger, Claire E., "Performance of Various Low-level Decoder for Surface Codes in the Presence of Measurement Error" (2021). Theses and Dissertations. 4885. https://scholar.afit.edu/etd/4885 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. Performance of Various Low-Level Decoders for Surface Codes in the Presence of Measurement Error THESIS Claire E Badger, B.S.C.S., 2d Lieutenant, USAF AFIT-ENG-MS-21-M-008 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this document are those of the author and do not reflect the official policy or position of the United States Air Force, the United States Department of Defense or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENG-MS-21-M-008 Performance of Various Low-Level Decoders for Surface Codes in the Presence of Measurement Error THESIS Presented to the Faculty Department of Electrical and Computer Engineering Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science Claire E Badger, B.S.C.S., B.S.E.E.
    [Show full text]
  • Topology & Entanglement in Driven (Floquet) Many Body Quantum Systems
    Topology & Entanglement in Driven (Floquet) Many Body Quantum Systems Ashvin Vishwanath Harvard University Adrian Po Lukasz Fidkowski Andrew Potter Harvard Seattle Texas Overview 1 ⌫ = log 2 ⌫ = log p log q 2 − Chiral phases in driven systems. The Driven Toric code. arXiv:1701.01440. Chiral Floquet arXiv:1701.01440. `Radical’ chiral phases. Po, Fidkowski, Morimoto, Potter, Floquet phases in a driven Kitaev AV. Phys. Rev. X 6, 041070 (2016) model. Po, Fidkowski, AV, Potter Overview 1 ⌫ = log 2 ⌫ = log p log q 2 − Chiral phases in driven systems. The Driven Toric code. arXiv:1701.01440. Chiral Floquet arXiv:1701.01440. `Radical’ chiral phases. Po, Fidkowski, Morimoto, Potter, Floquet phases in a driven Kitaev AV. Phys. Rev. X 6, 041070 (2016) model. Po, Fidkowski, AV, Potter Introduction: A gapped Hamiltonian J Volume = sites i i ⇠ · H ⌦ H energy H = Hr r X J = maxr Hr | r| excited states ∆ ground state low energy physics 4 Introduction: A gapped Hamiltonian J Volume = sites i i ⇠ · H ⌦ H energy H = Hr r X J = maxr Hr | r| excited states ∆ ground state low energy physics gapless 4 Introduction: A gapped Hamiltonian J Volume = sites i i ⇠ · H ⌦ H energy H = Hr r X J = maxr Hr | r| excited states ∆ ground state low energy physics gapless Need cooling (T=0) 4 Introduction: Entanglement Signatures Gapped Phases Gapless Phases Thermal Phases 1 S(⇢ ) ↵ @R log D + Area Law*log @R S Volume(R) R ⇠ | | − 2 ··· ⇠ Area Law R Volume Law Introduction: Entanglement Signatures Gapped Phases Gapless Phases Thermal Phases 1 S(⇢ ) ↵ @R log D + Area Law*log @R S Volume(R) R ⇠ | | − 2 ··· ⇠ Area Law R Volume Law Introduction: Classifying Gapped Quantum Phases Ground states of gapped local Hamiltonians How do we classify gapped ground states? No symmetry except t -> t+a Introduction: Classifying Gapped Quantum Phases Ground states of gapped local Hamiltonians How do we classify gapped ground states? No symmetry except t -> t+a Example 1:Quantum Hall Phases n=1$ h 1 Von$Klitzing+ n=2$ ⇢xy = e2 n n=3$ Bulk%Gapped% Edge%State% • Different integers - different phases.
    [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]
  • On the Complexity of Two Dimensional Commuting Local Hamiltonians
    On the Complexity of Two Dimensional Commuting Local Hamiltonians Dorit Aharonov School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel [email protected] Oded Kenneth School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel [email protected] Itamar Vigdorovich Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel [email protected] Abstract The complexity of the commuting local Hamiltonians (CLH) problem still remains a mystery after two decades of research of quantum Hamiltonian complexity; it is only known to be contained in NP for few low parameters. Of particular interest is the tightly related question of understanding whether groundstates of CLHs can be generated by efficient quantum circuits. The two problems touch upon conceptual, physical and computational questions, including the centrality of non- commutation in quantum mechanics, quantum PCP and the area law. It is natural to try to address first the more physical case of CLHs embedded on a 2D lattice, but this problem too remained open apart from some very specific cases [4, 17, 24]. Here we consider a wide class of two dimensional CLH instances; these are k-local CLHs, for any constant k; they are defined on qubits set on the edges of any surface complex, where we require that this surface complex is not too far from being “Euclidean”. Each vertex and each face can be associated with an arbitrary term (as long as the terms commute). We show that this class is in NP, and moreover that the groundstates have an efficient quantum circuit that prepares them.
    [Show full text]
  • Arxiv:1512.04528V1 [Cond-Mat.Stat-Mech] 14 Dec 2015 and Any Occupation of Level |1I Slowly Decays Back to Level a Pioneering Work [9]
    Exponential Lifetime Improvement in Topological Quantum Memories Charles-Edouard Bardyn1 and Torsten Karzig2, 1 1Institute for Quantum Information and Matter, Caltech, Pasadena, California 91125, USA 2Station Q, Microsoft Research, Santa Barbara, California 93106-6105, USA We propose a simple yet efficient mechanism for passive error correction in topological quantum memories. Our scheme relies on driven-dissipative ancilla systems which couple to local excitations (anyons) and make them \sink" in energy, with no required interaction among ancillae or anyons. Through this process, anyons created by some thermal environment end up trapped in potential \trenches" that they themselves generate, which can be interpreted as a \memory foam" for anyons. This self-trapping mechanism provides an energy barrier for anyon propagation, and removes entropy from the memory by favoring anyon recombination over anyon separation (responsible for memory errors). We demonstrate that our scheme leads to an exponential increase of the memory-coherence time with system size L, up to an upper bound Lmax which can increase exponentially with ∆=T , where T is the temperature and ∆ is some energy scale defined by potential trenches. This results in a double exponential increase of the memory time with ∆=T , which greatly improves over the Arrhenius (single-exponential) scaling found in typical quantum memories. I. INTRODUCTION The ease with which classical information can be stored is often taken for granted. Yet achieving the analog of simple tasks such as recording a list of bits on a long- lasting piece of paper remains extremely challenging in the quantum realm. Despite tremendous progress in ma- nipulating individual quantum \objects" such as elec- trons or photons, self-correcting classical memories | memories that can store bits at finite temperature for arbitrarily long periods of time without active error cor- rection [1{4] | currently have no known quantum coun- terpart.
    [Show full text]
  • Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes
    Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes Thesis by James William Harrington Advisor John Preskill In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2004 (Defended May 17, 2004) ii c 2004 James William Harrington All rights Reserved iii Acknowledgements I can do all things through Christ, who strengthens me. Phillipians 4:13 (NKJV) I wish to acknowledge first of all my parents, brothers, and grandmother for all of their love, prayers, and support. Thanks to my advisor, John Preskill, for his generous support of my graduate studies, for introducing me to the studies of quantum error correction, and for encouraging me to pursue challenging questions in this fascinating field. Over the years I have benefited greatly from stimulating discussions on the subject of quantum information with Anura Abeyesinge, Charlene Ahn, Dave Ba- con, Dave Beckman, Charlie Bennett, Sergey Bravyi, Carl Caves, Isaac Chenchiah, Keng-Hwee Chiam, Richard Cleve, John Cortese, Sumit Daftuar, Ivan Deutsch, Andrew Doherty, Jon Dowling, Bryan Eastin, Steven van Enk, Chris Fuchs, Sho- hini Ghose, Daniel Gottesman, Ted Harder, Patrick Hayden, Richard Hughes, Deborah Jackson, Alexei Kitaev, Greg Kuperberg, Andrew Landahl, Chris Lee, Debbie Leung, Carlos Mochon, Michael Nielsen, Smith Nielsen, Harold Ollivier, Tobias Osborne, Michael Postol, Philippe Pouliot, Marco Pravia, John Preskill, Eric Rains, Robert Raussendorf, Joe Renes, Deborah Santamore, Yaoyun Shi, Pe- ter Shor, Marcus Silva, Graeme Smith, Jennifer Sokol, Federico Spedalieri, Rene Stock, Francis Su, Jacob Taylor, Ben Toner, Guifre Vidal, and Mas Yamada. Thanks to Chip Kent for running some of my longer numerical simulations on a computer system in the High Performance Computing Environments Group (CCN-8) at Los Alamos National Laboratory.
    [Show full text]
  • Arxiv:2012.05235V2 [Quant-Ph] 20 Aug 2021 Various Analog Quantum Simulators, E.G
    Z2 lattice gauge theories and Kitaev's toric code: A scheme for analog quantum simulation Lukas Homeier,1, 2, ∗ Christian Schweizer,3, 2, ∗ Monika Aidelsburger,3, 2 Arkady Fedorov,4, 5 and Fabian Grusdt1, 2 1Department of Physics and Arnold Sommerfeld Center for Theoretical Physics (ASC), Ludwig-Maximilians-Universit¨atM¨unchen,Theresienstr. 37, D-80333 M¨unchen,Germany 2Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 M¨unchen,Germany 3Fakult¨atf¨ur Physik, Ludwig-Maximilians-Universit¨atM¨unchen,Schellingstr. 4, D-80799 M¨unchen,Germany 4ARC Centre of Excellence for Engineered Quantum Systems, Queensland 4072, Australia 5School of Mathematics and Physics, University of Queensland, St Lucia, Queensland 4072, Australia (Dated: August 23, 2021) Kitaev's toric code is an exactly solvable model with Z2-topological order, which has potential ap- plications in quantum computation and error correction. However, a direct experimental realization remains an open challenge. Here, we propose a building block for Z2 lattice gauge theories coupled to dynamical matter and demonstrate how it allows for an implementation of the toric-code ground state and its topological excitations. This is achieved by introducing separate matter excitations on individual plaquettes, whose motion induce the required plaquette terms. The proposed building block is realized in the second-order coupling regime and is well suited for implementations with superconducting qubits. Furthermore, we propose a pathway to prepare topologically non-trivial initial states during which a large gap on the order of the underlying coupling strength is present. This is verified by both analytical arguments and numerical studies. Moreover, we outline exper- imental signatures of the ground-state wavefunction and introduce a minimal braiding protocol.
    [Show full text]