DOCSLIB.ORG

Quantum Error-Correcting Codes by Concatenation QEC11

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Error-Correcting Codes by Concatenation QEC11 Quantum Error-Correcting Codes by Concatenation QEC11 Second International Conference on Quantum Error Correction University of Southern California, Los Angeles, USA December 5–9, 2011 Quantum Error-Correcting Codes by Concatenation Markus Grassl joint work with Bei Zeng Centre for Quantum Technologies National University of Singapore Singapore Markus Grassl – 1– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Why Bei isn’t here Jonathan, November 24, 2011 Markus Grassl – 2– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Overview Shor’s nine-qubit code revisited • The code [[25, 1, 9]] • Concatenated graph codes • Generalized concatenated quantum codes • Codes for the Amplitude Damping (AD) channel • Conclusions • Markus Grassl – 3– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Shor’s Nine-Qubit Code Revisited Bit-flip code: 0 000 , 1 111 . | → | | → | Phase-flip code: 0 + ++ , 1 . | → | | → | − −− Effect of single-qubit errors on the bit-flip code: X-errors change the basis states, but can be corrected • Z-errors at any of the three positions: • Z 000 = 000 | | “encoded” Z-operator Z 111 = 111 | −| = Bit-flip code & error correction convert the channel into a phase-error ⇒ channel = Concatenation of bit-flip code and phase-flip code yields [[9, 1, 3]] ⇒ Markus Grassl – 4– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 The Code [[25, 1, 9]] The best single-error correcting code is = [[5, 1, 3]] • C0 Re-encoding each of the 5 qubits with yields = [[52, 1, 32]] = [[25, 1, 9]] • C0 C The code is a subspace of five copies of [[5, 1, 3]] • C The stabilizer of is generated by five copies of the stabilizer of and an • C C0 encoded version of the stabilizer of C0 The code is degenerate • C m-fold self-concatenation of [[n, 1,d]] yields [[nm, 1,dm]] • Markus Grassl – 5– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Level-decoding of [[25, 1, 9]] The code corrects up to t = 4 errors (t<d/2) different error patterns: a) • •••• ••••• • •••• • •••• ••••• b) • • • • • ••••• • • • • • ••••• ••••• errror correction on both levels: • corrects a), but fails for b) errror detection on lowest level, error correction on higer level: • corrects b), but fails for a) = optimal decoding must pass information between the levels ⇒ Markus Grassl – 6– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Overview Shor’s nine-qubit code revisited • The code [[25, 1, 9]] • Concatenated graph codes ⇒ [Beigi, Chuang, Grassl, Shor & Zeng, Graph Concatenation for QECC, JMP 52 (2011), arXiv:0910.4129] Generalized concatenated quantum codes • Codes for the Amplitude Damping (AD) channel • Conclusions • Markus Grassl – 7– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Canonical Basis of a Stabilizer Code fix logical operators Xi and Zℓ • the stabilizer and the logical operators Zℓ mutually commute • S the logical state 00 ... 0 is a stabilizer state • | define the (logical) basis states as • i1 ik i i ...ik = X X 00 ... 0 | 1 2 1 ··· k | in terms of a classical code over a finite field: the logical state 00 ... 0 corresponds to a self-dual code • | C0 the basis states i i ...ik correspond to cosets of • | 1 2 C0 for a stabilizer code, the union of the cosets is an additive code ∗ • C Markus Grassl – 8– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Graphical Quantum Codes [D. Schlingemann & R. F. Werner: QECC associated with graphs, PRA 65 (2002), quant-ph/0012111] [Grassl, Klappenecker & R¨otteler: Graphs, Quadratic Forms, & QECC, ISIT 2002, quant-ph/0703112] Basic idea a classical symplectic self-dual code defines a single quantum state • = [[n, 0,d]]q C0 the standard form of the stabilizer matrix is (I A) • | the generators have exactly one tensor factor X • self-duality implies that A is symmetric • A can be considered as adjacency matrix of a graph with n vertices • logical X-operators give rise to more quantum states in the code • = [[n,k,d′]]q C use additionally k input vectices • Markus Grassl – 9– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Graphical Representation of [[6, 2, 3]]3 100000 000102 010000 001222 001000 010201 000100 122000 000010 020002 000001 221020 000000 101100 000000 100021 stabilizer & logical X-operators graphicalrepresentation Markus Grassl – 10– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Encoder based on Graphical Representation [M. Grassl, Variations on Encoding Circuits for Stabilizer Quantum Codes, LNCS 6639, pp. 142–158, 2011] F -1 × × × • φ ψ0 | in | F -1 × × × • 0 F Z Z2 | × × × × 0 F Z2 Z2 | × ××× 0 F Z2 Z | × × × × φ | enc 0 F X | × × × × 0 F | × × × 0 F X | × × × × × preparation of 0 ... 0 operators X operators Z | Markus Grassl – 11– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Encoder based on Graphical Representation F -1 × × × • φ ψ0 | in | F -1 × × × • 0 F Z Z2 | × × × × 0 F Z2 Z2 | × ××× 0 F Z2 Z | × × × × φ | enc 0 F X | × × × × 0 F | × × × 0 F X | × × × × × preparation of 0 ... 0 operators X operators Z | Markus Grassl – 11– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Concatenation of Graph Codes [Beigi, Chuang, Grassl, Shor & Zeng, Graph Concatenation for QECC, JMP 52 (2011), arXiv:0910.4129] self-concatenation of [[5, 1, 3]] • = ⇒ measure the five auxillary nodes in X-bases • • X-measurement corresponds to sequence of local complementations • = many different choices ⇒ Markus Grassl – 12– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 [[5, 1, 3]] = [[25, 1, 9]] ⇒ Markus Grassl – 13– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 [[5, 1, 3]] = [[25, 1, 9]] ⇒ Markus Grassl – 13– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 [[7, 1, 3]] = [[49, 1, 9]] ⇒ Markus Grassl – 14– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 [[7, 1, 3]] = [[49, 1, 9]] ⇒ Markus Grassl – 14– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 General Concatenation Rule (for qubit codes; see paper for qudit codes) Any edge connecting an input vertex with an auxiilary vertex is replaced by • a set of edges connecting the input vertex with all neighbors of the auxillary vertex. Any edge between two auxiliary vertices A and B is replaced by a complete • bipartite graph connecting any neighbor of A with all neighbors of B. = ⇒ Markus Grassl – 15– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Overview Shor’s nine-qubit code revisited • The code [[25, 1, 9]] • Concatenated graph codes • Generalized concatenated quantum codes ⇒ [Grassl, Shor, Smith, Smolin & Zeng, PRA 79 (2009), arXiv:0901.1319] [Grassl, Shor & Zeng, ISIT 2009, arXiv:0905.0428] Codes for the Amplitude Damping (AD) channel • Conclusions • Markus Grassl – 16– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Stabilizer Codes stabilizer group = S1,...,Sn k generated by n k mutually • S − − commuting tensor products of (generalized) Pauli matrices C = [[n,k,d]] is a common eigenspace of the Si • n orthogonal decomposition of the vector space ⊗ into joint eigenspaces • H E n-k−1 q n E Cq i E1 C labelling of the spaces by the eigenvalues of the Si • errors that change the eigenvalues can be detected • Markus Grassl – 17– 07.12.2011 Markus Grassl Quantum Error-Correcting Codes by Concatenation quantum codes decomposition of new basis: B 0 (1) 0; 0 0; 1 B | | 1 (1) 1; 0 1; 1 B {| | | 2 (1) i ; 2; 0 2; 1 j B | | B 3 : (1) i ( (1) i 3; 0 3; 1 C B = 0 | | 2 = ((5 ) 4 (1) Variations on 4; 0 4; 1 ⊗ ,..., 5 B | | = , 5 (1) 5; 0 5; 1 2 B , 15; B | | 3)) (0) 6 (1) 6; 0 6; 1 2 j = ((5 B | | = 0 7 (1) 7; 0 7; 1 – 18– B , , | | 2 1 8 (1) 5 } 8; 0 8; 1 , 1)) B | | [[5 9 (1) 9; 0 9; 1 2 , into B | | 1 10 (1) 10; 0 10; 1 , 3]] 16 B | | 11 (1) 2 11; 0 11; 1 mutually orthogonal B | | 12 (1) 12; 0 12; 1 B | | 13 (1) 13; 0 13; 1 B | | 14 (1) 14; 0 14; 1 B | | 15 (1) 15; 0 15; 1 | | 07.12.2011 | | 0 1 QEC11 L L Quantum Error-Correcting Codes by Concatenation QEC11 7 Construction of ((15, 2 , 3))2 basis i; j : i = 0,..., 15; j = 0, 1 of B(0) = ((5, 25, 1)) • {| } 2 – states i; 0 and i; 1 are in the code B(1) = ((5, 2, 3)) | | i 2 – for i = i′, some states i; j and i′; j′ have distance < 3 | | protect the quantum number i • a classical code of distance three suffices for this purpose • generalized concatenated QECC ((3 5, 16 23, 3)) with basis • × × i; j i; j i; j : i = 0,..., 15; j = 0, 1; j = 0, 1; j = 0, 1 {| 1| 2| 2 1 2 3 } normalizer code is a generalized concatenated code with • – inner codes (0) = (5, 210, 1) and (1) = (5, 26, 3) B 4 B 4 – outer codes = [3, 1, 3] and = [3, 3, 1] 6 A1 16 A2 2 Markus Grassl – 19– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 7 Encoding of ((15, 2 , 3))2 encoder for the nested codes ((5, 2, 3)) ((5, 25, 1)) 2 ≤ 2 i i i i | 1| 2| 3| 4 ? ? ? ? j - B(1) | i ? ? ? ? ? i , i , i , i ; j |1 2 3 4 Markus Grassl – 20– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 7 Encoding of ((15, 2 , 3))2 generalized concatenated encoder i i i i | 1 | 2 | 3 | 4 ? ? ? ? outer code A @ @ @ @ @ @ @ @ @ @ @ @ © © © © ? ? ? ? @R @R @R @R - (1) - (1) - (1) j1 B j2 B j3 B | i | i | i ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? Markus Grassl – 21– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 A New Qubit Non-Stabilizer Code [Grassl, Shor, Smith,
Load more

Recommended publications
  • Conversion of a General Quantum Stabilizer Code to an Entanglement
    Conversion of a general quantum stabilizer code to an entanglement distillation protocol∗ Ryutaroh Matsumoto Dept. of Communications and Integrated Systems Tokyo Institute of Technology, 152-8552 Japan Email: [email protected] April 4, 2003 Abstract We show how to convert a quantum stabilizer code to a one-way or two- way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor-Preskill and Nielsen-Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2, 1]] stabilizer codes. We also give an example of a two-way protocol converted from a stabilizer bet- ter than the recurrence protocol and the quantum privacy amplification protocol. The distillable entanglement by the class of one-way protocols converted from stabilizer codes for a certain class of states is equal to or greater than the achievable rate of stabilizer codes over the channel cor- responding to the distilled state, and they can distill asymptotically more entanglement from a very noisy Werner state than the hashing protocol. 1 Introduction arXiv:quant-ph/0209091v4 4 Apr 2003 In many applications of quantum mechanics to communication, the sender and the receiver have to share a maximally entangled quantum state of two particles. When there is a noiseless quantum communication channel, the sender can send one of two particles in a maximally entangled state to the receiver and sharing of it is easily accomplished. However, the quantum communication channel is usually noisy, that is, the quantum state of the received particle changes probabilistically from the original state of a particle.
    [Show full text]
  • A New Family of Fault Tolerant Quantum Reed-Muller Codes
    Clemson University TigerPrints All Theses Theses December 2020 A New Family of Fault Tolerant Quantum Reed-Muller Codes Harrison Beam Eggers Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_theses Recommended Citation Eggers, Harrison Beam, "A New Family of Fault Tolerant Quantum Reed-Muller Codes" (2020). All Theses. 3463. https://tigerprints.clemson.edu/all_theses/3463 This Thesis is brought to you for free and open access by the Theses at TigerPrints. It has been accepted for inclusion in All Theses by an authorized administrator of TigerPrints. For more information, please contact [email protected]. A New Family of Fault Tolerant Quantum Reed-Muller Codes A Thesis Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Master of Science Mathematics by Harrison Eggers December 2020 Accepted by: Dr. Felice Manganiello, Committee Chair Dr. Shuhong Gao Dr. Kevin James Abstract Fault tolerant quantum computation is a critical step in the development of practical quan- tum computers. Unfortunately, not every quantum error correcting code can be used for fault tolerant computation. Rengaswamy et. al. define CSS-T codes, which are CSS codes that admit the transversal application of the T gate, which is a key step in achieving fault tolerant computation. They then present a family of quantum Reed-Muller fault tolerant codes. Their family of codes admits a transversal T gate, but the asymptotic rate of the family is zero. We build on their work by reframing their CSS-T conditions using the concept of self-orthogonality.
    [Show full text]
  • Fault-Tolerant Quantum Gates Ph/CS 219 2 February 2011
    Fault-tolerant quantum gates Ph/CS 219 2 February 2011 Last time we considered the requirements for fault-tolerant quantum gates that act nontrivially on the codespace of a quantum error-correcting code. In the special case of a code that corrects t=1 error, the requirements are: -- if the gate gadget is ideal (has no faults) and its input is a codeword, then the gadget realizes the encoded operation U acting on the code space. -- if the gate gadget is ideal and its input has at most one error (is one-deviated from the codespace), then the output has at most one error in each output block. -- if the gate has one fault and its input has no errors, then the output has at most one error in each block (the errors are correctable). We considered the Clifford group, the finite subgroup of the m-qubit unitary group generated by the Hadamard gate H, the phase gate P (rotation by Pi/2 about the z-axis) and the CNOT gate. For a special class of codes, the generators of the Clifford group can be executed transversally (i.e., bitwise). The logical U can be done by applying a product of n U (or inverse of U) gates in parallel (where n is the code's length). If we suppose that the number of encoded qubits is k=1, then: -- the CNOT gate is transversal for any CSS code. -- the H gate is transversal for a CSS code that uses the same classical code to correct X errors and Z errors.
    [Show full text]
  • Arxiv:2104.09539V1 [Quant-Ph] 19 Apr 2021
    Practical quantum error correction with the XZZX code and Kerr-cat qubits Andrew S. Darmawan,1, 2 Benjamin J. Brown,3 Arne L. Grimsmo,3 David K. Tuckett,3 and Shruti Puri4, 5 1Yukawa Institute for Theoretical Physics (YITP), Kyoto University, Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, Japan∗ 2JST, PRESTO, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012, Japan 3Centre for Engineered Quantum Systems, School of Physics, University of Sydney, Sydney, New South Wales 2006, Australia 4 Department of Applied Physics, Yale University, New Haven, Connecticut 06511, USAy 5Yale Quantum Institute, Yale University, New Haven, Connecticut 06511, USA (Dated: April 21, 2021) The development of robust architectures capable of large-scale fault-tolerant quantum computa- tion should consider both their quantum error-correcting codes, and the underlying physical qubits upon which they are built, in tandem. Following this design principle we demonstrate remarkable error correction performance by concatenating the XZZX surface code with Kerr-cat qubits. We contrast several variants of fault-tolerant systems undergoing different circuit noise models that reflect the physics of Kerr-cat qubits. Our simulations show that our system is scalable below a threshold gate infidelity of pCX 6:5% within a physically reasonable parameter regime, where ∼ pCX is the infidelity of the noisiest gate of our system; the controlled-not gate. This threshold can be reached in a superconducting circuit architecture with a Kerr-nonlinearity of 10MHz, a 6:25 photon cat qubit, single-photon lifetime of > 64µs, and thermal photon population < 8%.∼ Such parameters are routinely achieved in superconducting∼ circuits. ∼ I. INTRODUCTION qubit [22, 34, 35].
    [Show full text]
  • Lecture 6: Quantum Error Correction and Quantum Capacity
    Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde∗ The quantum capacity theorem is one of the most important theorems in quantum Shannon theory. It is a fundamentally \quantum" theorem in that it demonstrates that a fundamentally quantum information quantity, the coherent information, is an achievable rate for quantum com- munication over a quantum channel. The fact that the coherent information does not have a strong analog in classical Shannon theory truly separates the quantum and classical theories of information. The no-cloning theorem provides the intuition behind quantum error correction. The goal of any quantum communication protocol is for Alice to establish quantum correlations with the receiver Bob. We know well now that every quantum channel has an isometric extension, so that we can think of another receiver, the environment Eve, who is at a second output port of a larger unitary evolution. Were Eve able to learn anything about the quantum information that Alice is attempting to transmit to Bob, then Bob could not be retrieving this information|otherwise, they would violate the no-cloning theorem. Thus, Alice should figure out some subspace of the channel input where she can place her quantum information such that only Bob has access to it, while Eve does not. That the dimensionality of this subspace is exponential in the coherent information is perhaps then unsurprising in light of the above no-cloning reasoning. The coherent information is an entropy difference H(B) − H(E)|a measure of the amount of quantum correlations that Alice can establish with Bob less the amount that Eve can gain.
    [Show full text]
  • Graphical and Programming Support for Simulations of Quantum Computations
    AGH University of Science and Technology in Kraków Faculty of Computer Science, Electronics and Telecommunications Institute of Computer Science Master of Science Thesis Graphical and programming support for simulations of quantum computations Joanna Patrzyk Supervisor: dr inż. Katarzyna Rycerz Kraków 2014 OŚWIADCZENIE AUTORA PRACY Oświadczam, świadoma odpowiedzialności karnej za poświadczenie nieprawdy, że niniejszą pracę dyplomową wykonałam osobiście i samodzielnie, i nie korzystałam ze źródeł innych niż wymienione w pracy. ................................... PODPIS Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie Wydział Informatyki, Elektroniki i Telekomunikacji Katedra Informatyki Praca Magisterska Graficzne i programowe wsparcie dla symulacji obliczeń kwantowych Joanna Patrzyk Opiekun: dr inż. Katarzyna Rycerz Kraków 2014 Acknowledgements I would like to express my sincere gratitude to my supervisor, Dr Katarzyna Rycerz, for the continuous support of my M.Sc. study, for her patience, motivation, enthusiasm, and immense knowledge. Her guidance helped me a lot during my research and writing of this thesis. I would also like to thank Dr Marian Bubak, for his suggestions and valuable advices, and for provision of the materials used in this study. I would also thank Dr Włodzimierz Funika and Dr Maciej Malawski for their support and constructive remarks concerning the QuIDE simulator. My special thank goes to Bartłomiej Patrzyk for the encouragement, suggestions, ideas and a great support during this study. Abstract The field of Quantum Computing is recently rapidly developing. However before it transits from the theory into practical solutions, there is a need for simulating the quantum computations, in order to analyze them and investigate their possible applications. Today, there are many software tools which simulate quantum computers.
    [Show full text]
  • Basic Probability Theory A
    Basic Probability Theory A In order to follow many of the arguments in these notes, especially when talking about entropies, it is necessary to have some basic knowledge of probability theory. Therefore, we review here the most important tools of probability theory that are used. One of the basic notions of probability theory that also frequently appears throughout these notes is that of a discrete random variable. A random variable X can take one of several values, the so-called realizations x,givenbythealphabet X. The probability that a certain realization x ∈ X occurs is given by the probability distribution pX(x). We usually use upper case letters to denote the random variable, lower case letters to denote realizations thereof, and calligraphic letters to denote the alphabet. Suppose we have two random variables X and Y , which may depend on each other. We can then define the joint probability distribution pX,Y (x, y) of X and Y that tells you the probability that Y = y and X = x. This notion (and the following definition) can be expanded to n random variables, but we restrict ourselves to the case of pairs X, Y here to keep the notation simple. Given the joint probability distribution of the pair X, Y , we can derive the marginal distribution PX(x) by pX(x) = pX,Y (x, y) ∀ x ∈ X (A.1) y∈Y and analogously for PY (y). The two random variables X and Y are said to be independent if pX,Y (x, y) = pX(x)pY (y). (A.2) © The Author(s), under exclusive license to Springer Nature Switzerland AG 2021 219 R.
    [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]
  • Universal Quantum Computation with Ideal Clifford Gates and Noisy Ancillas
    PHYSICAL REVIEW A 71, 022316 ͑2005͒ Universal quantum computation with ideal Clifford gates and noisy ancillas Sergey Bravyi* and Alexei Kitaev† Institute for Quantum Information, California Institute of Technology, Pasadena, 91125 California, USA ͑Received 6 May 2004; published 22 February 2005͒ We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state ͉0͘, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state ␳, which should be regarded as a parameter of the model. Our goal is to determine for which ␳ universal quantum computation ͑UQC͒ can be efficiently simu- lated. To answer this question, we construct purification protocols that consume several copies of ␳ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain “magic” directions. If the polarization of ␳ along a magic direction exceeds a threshold value ͑about 65%͒, the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed. DOI: 10.1103/PhysRevA.71.022316 PACS number͑s͒: 03.67.Lx, 03.67.Pp I. INTRODUCTION AND SUMMARY additional operations ͑e.g., measurements by Aharonov- Bohm interference ͓13͔ or some gates that are not related to The theory of fault-tolerant quantum computation defines topology at all͒. Of course, these nontopological operations an important number called the error threshold.
    [Show full text]
  • UC Riverside UC Riverside Electronic Theses and Dissertations
    UC Riverside UC Riverside Electronic Theses and Dissertations Title Codeword Stabilized Quantum Codes and Their Error Correction Permalink https://escholarship.org/uc/item/67h4j8p8 Author Li, Yunfan Publication Date 2010 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA RIVERSIDE Codeword Stabilized Quantum Codes and Their Error Correction A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Electrical Engineering by Yunfan Li August 2010 Dissertation Committee: Dr. Ilya Dumer, Chairperson Dr. Leonid Pryadko Dr. Alexander N. Korotkov Copyright by Yunfan Li 2010 The Dissertation of Yunfan Li is approved: Committee Chairperson University of California, Riverside Acknowledgments I would like to thank all people who have helped and inspired me during my doctoral study. I especially want to thank my advisor, Professor Ilya Dumer, for his important and valuable guidance during my research and study at UC Riverside. His perpetual energy and enthusiasm in research had motivated me. In addition, he was always willing to help his students with their research. As a result, research life became smooth and rewarding for me. I was delighted to interact with Professor Leonid Pryadko by attending his classes and having him as my co-advisor. I want to thank him for his guidance and joint effort in my research. I would like to thank Professor Alexander N. Korotkov. I got deep understanding about quantum computation and quantum error correcting codes from his lectures. I also want to express my thanks to Bei Zeng for the detailed explanation of the CWS code construction, to Markus Grassl for the important joint effort.
    [Show full text]
  • Introduction to Quantum Error Correction
    Introduction to Quantum Error Correction Gilles Zémor Nomade Lodge, May 2016 1 Qubits, quantum computing 1.1 Qubits A qubit is a mathematical description of a particle, e.g. a photon, it is a vector of unit norm in a Hilbert space H of dimension 2. It is customary to give oneself a basis of this space, that is written in Dirac notation (j0i; j1i) rather than the usual mathematical notation (e0; e1). A qubit is therefore a quantity expressed as αj0i + βj1i with jαj2 + jβj2 = 1. The physical state of n particles is described by a vector in the Hilbert space H⊗n, which consists of all complex linear combinations of products jx1i⊗jx2i⊗· · ·⊗jxni, where jxii ranges over the two basis vectors of the i-th copy of the Hilbert space H. Typically one uses the convention xi 2 f0; 1g and the basis vectors of the 2n-dimensional complex vector space H⊗n are written, to lighten notation as jx1ijx2i · · · jxni or simply as jx1x2 : : : xni: This basis of H⊗n will be referred to as the computational basis. Quantum states are described by vectors of unit norm in H⊗n. Quantum states are also not changed by multiplication by a complex number of modulus 1, so that strictly speaking quantum states are unit vectors of H⊗n modulo the multiplicative group of complex numbers of unit norm. Unitary transformations. A quantum state j i may be changed into another quantum state j 0i by any unitary transformation U of the Hilbert space H⊗n. A unitary transformation is an operator of H⊗n that preserves the hermitian inner product.
    [Show full text]
  • A Decoding Algorithm for CSS Codes Using the X/Z Correlations Nicolas Delfosse, Jean-Pierre Tillich
    A decoding algorithm for CSS codes using the X/Z correlations Nicolas Delfosse, Jean-Pierre Tillich To cite this version: Nicolas Delfosse, Jean-Pierre Tillich. A decoding algorithm for CSS codes using the X/Z correlations. 2014. hal-00937128 HAL Id: hal-00937128 https://hal.archives-ouvertes.fr/hal-00937128 Preprint submitted on 27 Jan 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A decoding algorithm for CSS codes using the X/Z correlations Nicolas Delfosse* and Jean-Pierre Tillich** *Département de Physique, Université de Sherbrooke, Sherbrooke, Québec, J1K 2R1, Canada, [email protected] **INRIA, Project-Team SECRET, 78153 Le Chesnay Cedex, France, [email protected] January 27, 2014 Abstract We propose a simple decoding algorithm for CSS codes taking into account the cor- relations between the X part and the Z part of the error. Applying this idea to surface codes, we derive an improved version of the perfect matching decoding algorithm which uses these X=Z correlations. 1 Introduction Low Density Parity–Check (LDPC) codes are linear codes defined by low weight parity-check equations. It is one of the most satisfying construction of error-correcting codes since they are both capacity approaching and endowed with an efficient decoding algorithm.
    [Show full text]