DOCSLIB.ORG

Machine-Learning-Assisted Correction of Correlated Qubit Errors in a Topological Code

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Machine-Learning-Assisted Correction of Correlated Qubit Errors in a Topological Code Machine-learning-assisted correction of correlated qubit errors in a topological code P. Baireuther1, T. E. O’Brien1, B. Tarasinski2, and C. W. J. Beenakker1 1Instituut-Lorentz, Universiteit Leiden, P.O. Box 9506, 2300 RA Leiden, The Netherlands 2QuTech, Delft University of Technology, P.O. Box 5046, 2600 GA Delft, The Netherlands December 2017 A fault-tolerant quantum computation re- gorithm. A test on a topological code (Kitaev's toric quires an efficient means to detect and correct code [14]) revealed a performance for phase-flip er- errors that accumulate in encoded quantum in- rors that was comparable to decoders based on the formation. In the context of machine learn- minimum-weight perfect matching (MWPM or \blos- ing, neural networks are a promising new ap- som") algorithm of Edmonds [15{17]. The machine proach to quantum error correction. Here we learning paradigm promises a flexibility that the clas- show that a recurrent neural network can be sic algorithms lack, both with respect to different trained, using only experimentally accessible types of topological codes and with respect to dif- data, to detect errors in a widely used topo- ferent types of errors. logical code, the surface code, with a perfor- Several groups are exploring the capabilities of a mance above that of the established minimum- neural network decoder [18{20], but existing designs weight perfect matching (or “blossom”) de- cannot yet be efficiently deployed as a decoder in a coder. The performance gain is achieved be- surface code architecture [21{23]. Two key features cause the neural network decoder can detect which are essential for this purpose are 1: The neural correlations between bit-flip (X) and phase-flip network must have a \memory", in order to be able (Z) errors. The machine learning algorithm to process repeated cycles of stabilizer measurement adapts to the physical system, hence no noise whilst detecting correlations between cycles; and 2: model is needed. The long short-term memory The network must be able to learn from measured layers of the recurrent neural network main- data, it should not be dependent on the uncertainties tain their performance over a large number of of theoretical modeling. quantum error correction cycles, making it a In this work we design a recurrent neural network practical decoder for forthcoming experimen- decoder that has both these features, and demon- tal realizations of the surface code. strate a performance improvement over a blossom de- coder in a realistic simulation of a forthcoming error correction experiment. Our decoder achieves this im- 1 Introduction provement through its ability to detect bit-flip (X) and phase-flip (Z) errors separately as well as corre- A quantum computer needs the help of a powerful lations (Y). The blossom decoder treats a Y-error as classical computer to overcome the inherent fragility a pair of uncorrelated X and Z errors, which explains of entangled qubits. By encoding the quantum in- the improved performance of the neural network. We formation in a nonlocal way, local errors can be de- study the performance of the decoder in a simplified tected and corrected without destroying the entangle- model where the Y-error rate can be adjusted inde- ment [1,2]. Since the efficiency of the quantum error pendently of the X- and Z-error rates, and measure arXiv:1705.07855v3 [quant-ph] 17 Jan 2018 correction protocol can make the difference between the decoder efficiency in a realistic model (density ma- failure and success of a quantum computation, there trix simulation) of a state-of-the-art 17-qubit surface is a major push towards more and more efficient de- code experiment (Surface-17). coders [3]. Topological codes such as the surface code, The outline of this paper is as follows. In the next which store a logical qubit in the topology of an array section2 we summarize the results from the literature of physical qubits, are particularly attractive because we need on quantum error correction with the surface they combine a favorable performance on small cir- code. The design principles of the recurrent neural cuits with scalability to larger circuits [4{9]. network that we will use are presented in Sec.3, with In a pioneering work [10], Torlai and Melko have particular attention for the need of an internal mem- shown that the data processing power of machine ory in an efficient decoder. This is one key aspect that learning (artificial neural networks [11{13]) can be differentiates our recurrent network from the feedfor- harnessed to produce a flexible, adaptive decoding al- ward networks proposed independently [18{20] (see Accepted in Quantum 2018-01-16, click title to verify 1 √ Figure 1: Schematic of the surface code. Left: N physical data qubits are arranged on a d × d square lattice (where d = N is known as the distance of the code). For each square one makes the four-fold σx or σz correlated measurement of Eq. (2). A further set of two-fold σx and σz measurements are performed on the boundary, bringing the total number of measurements to N − 1. Right: Since direct four-fold parity measurements are impractical, the measurements are instead performed by entanglement with an ancilla qubit, followed by a measurement of the ancilla in the computational basis. Both data qubits and ancilla qubits accumulate errors during idle periods (labeled I) and during gate operations (Hadamard H and cnot), which must be accounted for by a decoder. The data qubits are also entangled with the rest of the surface code by the grayed out gates. Sec.4). A detailed description of the architecture Repeated parity check measurements ~s(t) do not and training protocol is given in Sec.5. In Sec.6 we affect the qubit within this space, nor entanglement compare the performance of the neural network de- between the logical qubit states and other systems. coder to the blossom decoder for a particular circuit However, errors in the system will cause the qubit model with varying error rates. We conclude in Sec. to drift out of the logical subspace. This continuous 7 with a demonstration of the potential of machine drift is discretized by the projective measurement, be- learning for real-world quantum error correction, by coming a series of discrete jumps between subspaces decoding data from a realistic quantum simulation of H~s(t) as time t progresses. Since ~s(t) is directly mea- the Surface-17 experiment. sured, the qubit may be corrected, i.e. brought back to the initial logical subspace H~s(0). When performing this correction, a decision must be made on whether 2 Overview of the surface code ~s(t) ~s(0) to map the logical state |0iL ∈ H~s(t) to |0iL or ~s(0) To make this paper self-contained we first describe |1iL ∈ H~s(0), as no a priori relationship exists be- the operation of the surface code and formulate the tween the labels in these two spaces. If this is done in- decoding problem. The expert reader may skip di- correctly, the net action of the time evolution and cor- rectly to the next section. rection is a logical bit-flip error. A similar choice must In a quantum error correcting (QEC) code, single be made for the {|+iL, |−iL} logical states, which if logical qubits (containing the quantum information incorrect results in a logical phase-flip error. to be protected) are spread across a larger array of N noisy physical data qubits [24, 25]. The encoding is achieved by N − 1 binary parity check measure- Information about the best choice of correction (to ments on the data qubits [26]. Before these measure- most-likely prevent logical bit-flip or phase-flip errors) ments, the state of the physical system is described by is stored within the measurement vectors ~s, which a complex vector |ψi within a 2N -dimensional Hilbert detail the path the system took in state-space from space H. Each parity check measurement Mi projects H~s(0) to H~s(t). The non-trivial task of decoding, or |ψi onto one of two 2N−1-dimensional subspaces, de- extracting this correction, is performed by a classi- pendent on the outcome si of the measurement. As cal decoder. Optimal (maximum-likelihood) decod- all parity check measurements commute, the result of ing is an NP-hard problem [27], except in the pres- a single cycle of N − 1 measurements is to project ence of specific error models [28]. However, a fault- |ψi into the intersection of all subspaces H~s decided tolerant decoder need not be optimal, and polyno- by the measurements ~s = s1, . , sN−1 (si ∈ {0, 1}). mial time decoders exist with sufficient performance This is a Hilbert space of dimension 2N /2N−1 = 2, to demonstrate error mitigation on current quantum giving the required logical qubit |ψiL. hardware [5]. This sub-optimality is quantified by the Accepted in Quantum 2018-01-16, click title to verify 2 decoder efficiency [29] 3 Neural network detection of corre- (opt) D lated errors ηd = L /L , (1) D where L is the probability of a logical error per cycle The sub-optimality of the blossom decoder comes pri- (opt) using the decoder D, and L is the probability of a marily from its inability to optimally detect Pauli-Y logical error per cycle using the optimal decoder [31]. (σy) errors [29, 31, 33]. These errors correspond to a The QEC code currently holding the record for the combination of a bit-flip (X) and a phase-flip (Z) on best performance under a scalable decoder is the sur- the same qubit, and are thus treated by a MWPM face code [3{5, 16].
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]