Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "Topological Subsystem Codes with Local Gauge Group Generators Martin Suchara in collaboration with: Sergey Bravyi and Barbara Terhal December 08, 2010."— Presentation transcript:

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

2 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 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 4 Example – Topological Quantum Memory Qubits on links (or sites) in the lattice Measuring these check operators yields error syndromes

5 5 Example – Topological Quantum Memory Logical operators

6 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 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 8 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

9 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 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 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 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 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 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 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 16 The Square-Octagonal Lattice The Logical Operators

17 17 The Square-Octagonal Lattice The Stabilizers

18 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 19 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

20 20 The Five-Squares Lattice The Logical Operators

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

22 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 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 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 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 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 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 28 Correcting Z Errors Potential Z errors Two non-overlapping sublattices

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

30 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 31 Overview I.Construction of topological subsystem codes III.Experimental evaluation of the threshold IV.Conclusion II.The five-squares code

32 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 33 Threshold – Simple Decoding Algorithm Transition sharper for larger lattice size storage threshold ~ 1.5%

34 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 35 Threshold – Improved Decoding Noticeable improvement of threshold storage threshold ~ 2%

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

37 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 38 Thank You!


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

Similar presentations


Ads by Google