Topological Subsystem Codes with Local Gauge Group Generators Martin Suchara in collaboration with: Sergey Bravyi and Barbara Terhal December 08, 2010.

Slides:



Advertisements
Similar presentations
Variations of the Turing Machine
Advertisements

Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
Advanced Piloting Cruise Plot.
1
Feichter_DPG-SYKL03_Bild-01. Feichter_DPG-SYKL03_Bild-02.
1 Vorlesung Informatik 2 Algorithmen und Datenstrukturen (Parallel Algorithms) Robin Pomplun.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2003 Chapter 3 Data Transmission.
Chapter 1 The Study of Body Function Image PowerPoint
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 1 Embedded Computing.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
1 Copyright © 2013 Elsevier Inc. All rights reserved. Appendix 01.
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
UNITED NATIONS Shipment Details Report – January 2006.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Conversion Problems 3.3.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Solve Multi-step Equations
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Break Time Remaining 10:00.
Q U RE: T HE Q UANTUM R ESOURCE E STIMATOR T OOLBOX Martin Suchara (IBM Research) October 9, 2013 In collaboration with: Arvin Faruque, Ching-Yi Lai, Gerardo.
PP Test Review Sections 6-1 to 6-6
Data Structures Using C++
Short seed extractors against quantum storage Amnon Ta-Shma Tel-Aviv University 1.
EU market situation for eggs and poultry Management Committee 20 October 2011.
EU Market Situation for Eggs and Poultry Management Committee 21 June 2012.
Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
CS 6143 COMPUTER ARCHITECTURE II SPRING 2014 ACM Principles and Practice of Parallel Programming, PPoPP, 2006 Panel Presentations Parallel Processing is.
2 |SharePoint Saturday New York City
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
BEEF & VEAL MARKET SITUATION "Single CMO" Management Committee 18 April 2013.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
Copyright © 2013, 2009, 2006 Pearson Education, Inc. 1 Section 5.5 Dividing Polynomials Copyright © 2013, 2009, 2006 Pearson Education, Inc. 1.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Note to the teacher: Was 28. A. to B. you C. said D. on Note to the teacher: Make this slide correct answer be C and sound to be “said”. to said you on.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
25 seconds left…...
Subtraction: Adding UP
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Analyzing Genes and Genomes
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Exponents and Radicals
Clock will move after 1 minute
Intracellular Compartments and Transport
PSSA Preparation.
Essential Cell Biology
Datorteknik TopologicalSort bild 1 To verify the structure Easy to hook together combinationals and flip-flops Harder to make it do what you want.
Immunobiology: The Immune System in Health & Disease Sixth Edition
Energy Generation in Mitochondria and Chlorplasts
Murach’s OS/390 and z/OS JCLChapter 16, Slide 1 © 2002, Mike Murach & Associates, Inc.
Presentation transcript:

Topological Subsystem Codes with Local Gauge Group Generators Martin Suchara in collaboration with: Sergey Bravyi and Barbara Terhal December 08, 2010

2 Quantum Error Correction (QEC) Reliable quantum information storage and computation with unreliable components Much more challenging than classically Analog nature of quantum operations New kinds of errors: partial bit flips, phase flips, small shifts Need error correction to build a practical quantum computer

3 Some Milestones in QEC Research Quantum block error correcting codes (Shor, 1995) Threshold theorem (Knill et al., 1998) Subsystem codes (Poulin, 2005 and Bacon, 2006) Topological quantum codes (Kitaev, 1997)

4 Example – Topological Quantum Memory Qubits on links (or sites) in the lattice Measuring these check operators yields error syndromes

5 Example – Topological Quantum Memory Logical operators

6 Advantages of Topological Stabilizer Codes Qubits laid on two-dimensional grid Local syndrome measurements Can increase lattice size rather than concatenate smaller blocks Permit encoding of multiple qubits and implementation of some gates by code deformation High threshold

7 Error Correction with 2-Body Measurements (Bombin 2010) Earlier codes: measurements of at least four neighboring qubits Simplifies physical implementation Our code: only local two-qubit measurements Main questions How should the lattice look like? How should the decoding algorithm work? Numerical value of the threshold?

8 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

9 Error Correcting Codes Codespace is a subspace of a larger Hilbert space that encodes logical information Syndrome measurements diagnose errors Decoding algorithm returns system to the original logical state Threshold: below some noise level error correction succeeds w. h. p.

10 Stabilizer Subsystem Codes Stabilizer codes characterized by the stabilizer group generated by Have dimensional codespace: logical operators In subsystem codes some logical qubits do not encode any information Can simplify decoding Characterized by gauge group: stabilizers + logicals acting on gauge qubits

11 Desired Code Properties 2.Topological properties of the code: stabilizer group has spatially local generators 1.Syndromes can be extracted by measuring two-qubit gauge operators 3.At least one logical qubit encoded

12 Kitaevs Honeycomb Model on a Torus Link operators XX, YY, and ZZ Anticommute iff share one endpoint Has spatially local stabilizer generators (loop operators) Two-qubit measurements determine syndromes All loop operators commute Does not encode any logical qubits! XX-link YY-link ZZ-link

13 Generalizing the 3-Valent Lattice Links connecting three sites – triangles Loop has an even number of incident links at each site Loop operators anticommute iff they share odd number of triangles XY-linkZZZ-link ZY ZX ZY ZX ZZ-link

14 Generalizing the 3-Valent Lattice Links connecting three sites – triangles Loop has an even number of incident links at each site Loop operators anticommute iff they share odd number of triangles ZX ZYZX ZY ZX ZY XY-linkZZZ-link ZZ-link

15 Generalizing the 3-Valent Lattice Links connecting three sites – triangles Loop has an even number of incident links at each site Loop operators anticommute iff they share odd number of triangles Intersecting loops anticommute at 3 sites X/YX/Y Y/XY/X X/YX/Y XY-linkZZZ-link ZZ-link

16 The Square-Octagonal Lattice The Logical Operators

17 The Square-Octagonal Lattice The Stabilizers

18 The Gauge Group Generators Each triangle gives rise to a triple of generators: Link operators of weight two: Z Z Z Z Z Z X Y XY X Y Y X X Y

19 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

20 The Five-Squares Lattice The Logical Operators

21 Examples of Lattices (with Stabilizers) Five-Squares Lattice

22 The Gauge Group Generators Triangles: Solid XY-links in squares, and ZZ-links connecting squares: Z Z Z Z Z Z Z X Y XY X Y Y X Z

23 The Stabilizers X Y Y X Y X Y X X Y X Y X Y Y X Y X X Y Z Z Z Z X Y Y X X Y X Y Y X X Y Y X X Y X Y X Y Y X Y X Y X X Y Y X Y X A B C D How to measure them?

24 Measuring the Stabilizers B To measure syndromes A, B, C, D need to take 8, 10, 40, and 4 two-qubit measurements Y X Y X X Y YX YX Y X B XZXZ YZYZ XZXZ YZYZ YZYZ XZXZ XZXZYZYZ Y X Y X

25 The Stabilizers X Y Y X Y X Y X X Y X Y X Y Y X Y X X Y Z Z Z Z X Y Y X X Y X Y Y X X Y Y X X Y X Y X Y Y X Y X Y X X Y Y X Y X A B C D How to use them to correct errors? Correct X and Z errors separately.

26 Correcting X Errors Only need to correct errors X 1, X 5, X 9, X 13, and X 17. Consider an arbitrary X error: Easy to do with syndrome Z Z Z Z X XY = iZ X X

27 Correcting Z Errors Similarly, only need to consider Z 1, Z 2, Z 4, Z 19, and Z X Y Y X Y X Y X X Y X Y And Z 4 is corrected using stabilizer B How do the remaining stabilizers act on the errors? B

28 Correcting Z Errors Potential Z errors Two non-overlapping sublattices

29 Correcting Z Errors Two types of stabilizers Two types of stabilizers (A and C) Potential error locations highlighted

30 Correcting Z Errors Find the smallest possible weight error Minimum weight matching algorithm Match pairs of non-trivial syndromes Minimize total weight of the matching Correct Z errors on lines connecting matched syndromes Error correction fails if E actual E guessed is a logical operator

31 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

32 Assumptions and Experimental Setup Depolarizing error model X, Y and Z errors with probability p/3 Noiseless syndrome measurements Monte Carlo simulation in C to 40,960 qubits Generate and correct random error Repeat 1,000 times

33 Threshold – Simple Decoding Algorithm Transition sharper for larger lattice size storage threshold ~ 1.5%

34 Improving the Threshold In the first two correction steps guess the smallest weight error! Original X error locations Syndrome B does not change Syndrome B changes

35 Threshold – Improved Decoding Noticeable improvement of threshold storage threshold ~ 2%

36 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

37 Conclusion Construction of new codes that only require two-qubit measurements for error correction Decoder for the five-squares code achieves 2% storage threshold Price to pay: threshold value and number of measurements needed for syndrome calculation Open question: how to encode multiple logical qubits by creating holes?

38 Thank You!