decoding problem for topological quantum codes
play

Decoding problem for topological quantum codes Guillaume - PowerPoint PPT Presentation

Oct 18, 2023 •136 likes •1.66k views

Decoding problem for topological quantum codes Guillaume Duclos-Cianci Dpartement de Physique Universit de Sherbrooke Joint work with: David Poulin and Hector Bombin Second International Conference on Quantum Error Correction University of

  1. Kitaev’s toric code Error chains Error chains are attached to a pair of particles. X X 1 The syndrome configuration on the X endpoint doesn’t depend on the X 1 X X X geometry (path, length) of the string. Error chains can be stretched freely: constant energy cost. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 8 / 44

  2. Kitaev’s toric code Particle annihilation An error can annihilate two 1 X X X particles. X 1 X X X The particle’s worldline is left behind after fusion. Particle fusion can leave behind a worldline corresponding to a logical operation. X X X X X X X X Memory corruption Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 9 / 44

  3. Kitaev’s toric code Particle annihilation An error can annihilate two particles. X X X X X X X 1 1 X X X X The particle’s worldline is left behind after fusion. Particle fusion can leave behind a worldline corresponding to a logical X X X operation. X X X X X X X X X Memory corruption Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 9 / 44

  4. Kitaev’s toric code Particle annihilation An error can annihilate two particles. X X X X X X X 1 1 X X X X The particle’s worldline is left behind after fusion. Particle fusion can leave behind a worldline corresponding to a logical X X X operation. X X X X X X X X X Memory corruption Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 9 / 44

  5. Kitaev’s toric code Site particles The same story holds for σ z errors Z Z 1 These will create site particles Z located at the lattice’s vertices Z (plaquette of dual lattice). Z Z Z 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 10 / 44

  6. Decoding problem Outline Kitaev’s toric code 1 Decoding problem 2 Renormalization Group Decoder 3 Results for Kitaev’s code 4 5 Extension to other codes Fault-tolerance 6 7 2D Fault-Tolerant Quantum Cellular Automaton Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 11 / 44

  7. Decoding problem Error model Depolarizing error model Independent on every qubit. No error with probability 1 − p . Error X , Y , or Z with probability p / 3. Bit-flip error model Independent on every qubit. No error with probability 1 − p . Error X with probability p . Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 12 / 44

  8. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 Y 1 1 Measure particle position, 1 Z 1 1 1 1 Z X but not worldline. 1 1 Y 1 1 1 Y 1 X 1 Y 1 1 1 Many worldlines consistent 1 1 1 Z 1 Y 1 with defects. 1 Y 1 X 1 1 1 1 1 X 1 1 Worldline with different Z 1 1 homologies have different 1 X 1 X 1 X 1 1 1 Y 1 1 1 effect on ground space: 1 1 1 Y Z 1 Y MUST be distinguished. 1 1 Z 1 1 1 1 1 1 Z Z 1 1 Y 1 X Decoding 1 Y 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  9. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 1 1 Measure particle position, 1 1 1 1 1 but not worldline. 1 1 1 1 1 1 1 1 1 1 Many worldlines consistent 1 1 1 1 1 1 1 1 1 with defects. 1 1 1 1 1 Worldline with different 1 1 homologies have different 1 1 1 1 1 1 1 1 1 effect on ground space: 1 1 1 1 MUST be distinguished. 1 1 1 1 1 1 1 1 1 1 1 Decoding 1 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  10. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 1 1 Measure particle position, 1 1 1 1 1 but not worldline. 1 1 1 1 1 1 1 1 1 1 Many worldlines consistent 1 1 1 1 1 1 1 1 1 with defects. 1 1 1 1 1 Worldline with different 1 1 1 1 homologies have different 1 1 1 1 1 1 1 effect on ground space: 1 1 1 1 MUST be distinguished. 1 1 1 1 1 1 1 1 1 1 1 Decoding 1 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  11. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 1 1 Measure particle position, 1 1 1 1 1 but not worldline. 1 1 1 1 1 1 1 1 1 1 Many worldlines consistent 1 1 1 1 1 1 1 1 1 with defects. 1 1 1 1 1 Worldline with different 1 1 1 1 homologies have different 1 1 1 1 1 1 1 effect on ground space: 1 1 1 1 MUST be distinguished. 1 1 1 1 1 1 1 1 1 1 1 Decoding 1 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  12. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 1 Measure particle position, 1 1 1 1 1 but not worldline. 1 1 1 1 1 1 1 1 1 1 Many worldlines consistent 1 1 1 1 1 1 1 1 1 with defects. 1 1 1 1 1 Worldline with different 1 1 homologies have different 1 1 1 1 1 1 1 1 1 effect on ground space: 1 1 1 1 MUST be distinguished. 1 1 1 1 1 1 1 1 1 1 1 Decoding 1 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  13. Decoding problem Error syndrome & decoding 15 % Noise rate An error produces defects (error syndrome) 1 1 Measure particle position, 1 1 1 1 1 but not worldline. 1 1 1 1 1 1 1 1 1 1 Many worldlines consistent 1 1 1 1 1 1 1 1 1 with defects. 1 1 1 1 1 Worldline with different 1 1 homologies have different 1 1 1 1 1 1 1 1 1 effect on ground space: 1 1 1 1 MUST be distinguished. 1 1 1 1 1 1 1 1 1 1 1 Decoding 1 1 1 1 1 Infer worldline homology from 1 particle location. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 13 / 44

  14. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  15. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  16. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  17. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  18. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  19. Decoding problem Existing methods Energy Minimization Find shortest path connecting all defects. Equivalent to minimizing energy of random bond Ising model. Edmonds’ perfect matching algorithm: O ( ℓ 6 ) Polynomial complexity, but still prohibitive, O ( ℓ 6 ) . Recent progress : average O ( 1 ) decoding time with marginal losses (Fowler et al. 2011). Sub-optimal: Does not take into account the homological equivalence of errors. Does not take into account correlations between site and plaquette defects. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 14 / 44

  20. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight 1 (Energy). Second one is highly 1 degenerate (Entropy). 1 1 Optimal decoding 1 Homology class with lowest free energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) 1 . p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  21. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight 1 (Energy). Second one is highly 1 degenerate (Entropy). 1 1 Optimal decoding 1 Homology class with lowest free energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) 1 . p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  22. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight (Energy). 1 Second one is highly 1 degenerate (Entropy). 1 Optimal decoding 1 Homology class with lowest free 1 energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) . 1 p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  23. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight (Energy). 1 Second one is highly 1 degenerate (Entropy). 1 Optimal decoding 1 Homology class with lowest free 1 energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) . 1 p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  24. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight (Energy). 1 Second one is highly 1 degenerate (Entropy). 1 Optimal decoding 1 Homology class with lowest free 1 energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) . 1 p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  25. Decoding problem Minimum distance vs Degeneracy Two possible pairings with different homologies 1 First one has lower weight (Energy). 1 Second one is highly 1 degenerate (Entropy). 1 Optimal decoding 1 Homology class with lowest free 1 energy F = E − TS . 1 Nishimori T − 1 = ln 3 ( 1 − p ) . 1 p Sum over all equivalent errors. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 15 / 44

  26. Decoding problem Plaquette-Site string correlations 1 1 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight 1 1 A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  27. Decoding problem Plaquette-Site string correlations 1 1 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight 1 1 A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  28. Decoding problem Plaquette-Site string correlations 1 1 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight 1 1 A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  29. Decoding problem Plaquette-Site string correlations 1 1 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight 1 1 A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  30. Decoding problem Plaquette-Site string correlations 1 1 Y Y 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight Y 1 1 Y A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 Y Y 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  31. Decoding problem Plaquette-Site string correlations 1 1 Y Y 1 1 Two possible pairings with 1 1 different homologies Both seemingly have same 1 1 weight Y 1 1 Y A Y error has same weight as X and Z : overcounting. 1 1 Site Z and plaquette X errors are not independent. 1 1 Y Y 1 1 1 1 Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 16 / 44

  32. Renormalization Group Decoder Outline Kitaev’s toric code 1 Decoding problem 2 Renormalization Group Decoder 3 Results for Kitaev’s code 4 5 Extension to other codes Fault-tolerance 6 7 2D Fault-Tolerant Quantum Cellular Automaton Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 17 / 44

  33. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  34. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  35. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  36. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  37. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  38. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  39. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  40. Renormalization Group Decoder Scale invariance Original B p checks Basis change (row operations on C ) Obtain scale invariant generators Structure similar to a concatenated code. Soft-decode each small block. Pass information to next encoding level. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 18 / 44

  41. Renormalization Group Decoder Concatenated code Decoding | 0 � P ( L ) = � ′ U E P ( E ) where | 0 � | 0 � | 0 � U U Sum over E equivalent to L | 0 � | 0 � | 0 � and with right syndrome. U | 0 � P ( E ) given by error model. | 0 � U | ψ � | 0 � | 0 � | 0 � | 0 � U U U | 0 � | 0 � | 0 � Decoding | 0 � U | 0 � Compute error probability for | 0 � U | 0 � each encoded qubit. | 0 � | 0 � U U | 0 � | 0 � Pass that probability to the | 0 � U | 0 � next level up. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 19 / 44

  42. Renormalization Group Decoder Concatenated code Decoding P ( L ) = � ′ E P ( E ) where Sum over E equivalent to L and with right syndrome. P ( E ) given by error model. | ψ � | 0 � U | 0 � Decoding Compute error probability for each encoded qubit. Pass that probability to the next level up. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 19 / 44

  43. Renormalization Group Decoder Concatenated code Decoding P ( L ) = � ′ E P ( E ) where Sum over E equivalent to L and with right syndrome. L P ( E ) given by error model. † Decoding U Compute error probability for each encoded qubit. Pass that probability to the next level up. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 19 / 44

  44. Renormalization Group Decoder Concatenated code Decoding P ( L ) = � ′ E P ( E ) where Sum over E equivalent to L and with right syndrome. L P ( E ) given by error model. † Decoding U Compute error probability for each encoded qubit. Pass that probability to the next level up. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 19 / 44

  45. Renormalization Group Decoder Concatenated code Decoding P ( L ) = � ′ E P ( E ) where L Sum over E equivalent to L and with right syndrome. † U P ( E ) given by error model. Decoding † † † U U U Compute error probability for each encoded qubit. † † † † † † † † † U U U U U U U U U Pass that probability to the next level up. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 19 / 44

  46. Renormalization Group Decoder Renormalization: Information coarse graining Think of Kitaev’s code as a concatenated code: It is made up of a bunch of small (open boundary) topological codes, joined into larger topological codes, etc. Logical operators are strings going across the codes. Given the particle configuration (syndrome) in a unit cell, compute the prob that the a string type went through. There are 16 possibilities corresponding to { I , X , Y , Z } 2 , 2 qubits. This is done by brute force: sum over all worldline configurations. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 20 / 44

  47. Renormalization Group Decoder Renormalization: Information coarse graining Think of Kitaev’s code as a concatenated code: It is made up of a bunch of small (open boundary) topological codes, joined into larger topological codes, etc. Logical operators are strings going across the codes. Given the particle configuration (syndrome) in a unit cell, compute the prob that the a string type went through. There are 16 possibilities corresponding to { I , X , Y , Z } 2 , 2 qubits. This is done by brute force: sum over all worldline configurations. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 20 / 44

  48. Renormalization Group Decoder Renormalization: Information coarse graining Think of Kitaev’s code as a concatenated code: It is made up of a bunch of small (open boundary) topological codes, joined into larger topological codes, etc. Logical operators are strings going across the codes. Given the particle configuration (syndrome) in a unit cell, compute the prob that the a string type went through. There are 16 possibilities corresponding to { I , X , Y , Z } 2 , 2 qubits. This is done by brute force: sum over all worldline configurations. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 20 / 44

  49. Renormalization Group Decoder Renormalization: Information coarse graining Think of Kitaev’s code as a concatenated code: It is made up of a bunch of small (open boundary) topological codes, joined into larger topological codes, etc. Logical operators are strings going across the codes. Given the particle configuration (syndrome) in a unit cell, compute the prob that the a string type went through. There are 16 possibilities corresponding to { I , X , Y , Z } 2 , 2 qubits. This is done by brute force: sum over all worldline configurations. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 20 / 44

  50. Renormalization Group Decoder Overlaping cells Topological codes are NOT concatenated codes. Cannot break lattices into constant-size cells in such a way that each stabilizer overlaps with a single region. Use overlapping cells instead. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 21 / 44

  51. Renormalization Group Decoder Overlaping cells Topological codes are NOT concatenated codes. Cannot break lattices into constant-size cells in such a way that each stabilizer overlaps with a single region. Use overlapping cells instead. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 21 / 44

  52. Renormalization Group Decoder Overlaping cells Topological codes are NOT concatenated codes. Cannot break lattices into constant-size cells in such a way that each stabilizer overlaps with a single region. Use overlapping cells instead. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 21 / 44

  53. Renormalization Group Decoder Self-consistency 1 1 Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  54. Renormalization Group Decoder Self-consistency 1 1 Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  55. Renormalization Group Decoder Self-consistency 1 1 Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  56. Renormalization Group Decoder Self-consistency P L,i ( X ) � = P R,i ( X ) Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  57. Renormalization Group Decoder Self-consistency P � L,i ( X ) = P � R,i ( X ) Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  58. Renormalization Group Decoder Self-consistency P � L,i ( X ) = P � R,i ( X ) Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  59. Renormalization Group Decoder Self-consistency P � L,i ( X ) = P � R,i ( X ) Boundary qubits treated as independent variables on neighboring unit cells. Probabilities assigned by different cells to a given qubit differ. Impose mean-field consistencies conditions on marginal probabilities. Solve by belief propagation. Complexity O ( ℓ 2 ) parallelizable to constant time. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 22 / 44

  60. Results for Kitaev’s code Outline Kitaev’s toric code 1 Decoding problem 2 Renormalization Group Decoder 3 Results for Kitaev’s code 4 5 Extension to other codes Fault-tolerance 6 7 2D Fault-Tolerant Quantum Cellular Automaton Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 23 / 44

  61. Results for Kitaev’s code RG decoder with 3 BP rounds 1 l =8 l =16 l =32 Probabilite d’erreur du decodeur l =64 0.1 0.01 12 13 14 15 16 17 Force du canal depolarizant , p (%) Threshold ≈ 15 % , compared to 15 . 5 % for PMA. O ( log ℓ ) time complexity with marginal performance loss. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 24 / 44

  62. Results for Kitaev’s code Smaller unit cell, 2 × 1 1 l =8 l =16 l =32 Probabilite d’erreur du decodeur l =64 l =128 l =256 l =512 0.1 l =1024 Failure probability 0.01 0.001 0.0001 2 4 6 8 10 20 30 40 50 60 70 80 90 100 Depolarization Strength % Force du canal Bit-Flip , p (%) Bit-flip threshold ≈ 8 . 2 % , compared to 10 . 3 % for PMA. Much faster even without parallelization (10 6 sites). Illustrates flexibility. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 25 / 44

  63. Results for Kitaev’s code Higher threshold 1 l =8 l =16 l =32 Probabilite d’erreur du decodeur l =64 l =128 0.1 PMA 15 15.5 16 16.5 17 17.5 18 Force du canal depolarizant , p (%) Use of additional belief propagation. Threshold ≈ 16 . 5 % , compared to 15 . 5 % for PMA. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 26 / 44

  64. Extension to other codes Outline Kitaev’s toric code 1 Decoding problem 2 Renormalization Group Decoder 3 Results for Kitaev’s code 4 5 Extension to other codes Fault-tolerance 6 7 2D Fault-Tolerant Quantum Cellular Automaton Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 27 / 44

  65. Extension to other codes Topological color code Qubits located on vertices Plaquette stabilizers S p = � j ∈ ∂ p σ j , for σ = σ x and σ z . Same particle types and statistics as 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  66. Extension to other codes Topological color code X X X X Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , for σ = σ x and σ z . Z Z Z Z Z Z Same particle types and statistics as Z Z 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  67. Extension to other codes Topological color code X X X X Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , for σ = σ x and σ z . Same particle types and statistics as Z Z Z Z 2 copies of Kitaev’s code Z Z Z Z Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  68. Extension to other codes Topological color code Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , Z for σ = σ x and σ z . Z Z Z Same particle types and statistics as 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  69. Extension to other codes Topological color code Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , Z for σ = σ x and σ z . Z Z Z Same particle types and statistics as 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  70. Extension to other codes Topological color code Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , Z for σ = σ x and σ z . Z Z Z Same particle types and statistics as 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  71. Extension to other codes Topological color code Qubits located on vertices X X X X Plaquette stabilizers S p = � j ∈ ∂ p σ j , Z for σ = σ x and σ z . Z Z Z Same particle types and statistics as 2 copies of Kitaev’s code Efficient decoding algorithm for this code? Sarvepalli, Raussendorf 2011 : Adaptation of the RG scheme to the 6.6.6. color code → many subtleties : many qubits shared between cells, better to work on the dual lattice. Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 28 / 44

  72. Extension to other codes Equivalence of Topological codes Every 2D, translationally invariant, non-chiral stabilizer code with local generators and macroscopic minimal distance is locally equivalent to a finite number of copies of Kitaev’s code. Topological Color code equivalent to two copies of Kitaev’s code : a local clifford map exists Do the mapping and operate decoding on KTCs instead. Local Clifford Map Noise model remains Pauli and local Map for syndrome bits (particles) Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 29 / 44

  73. Extension to other codes Equivalence of Topological codes Every 2D, translationally invariant, non-chiral stabilizer code with local generators and macroscopic minimal distance is locally equivalent to a finite number of copies of Kitaev’s code. Topological Color code equivalent to two copies of Kitaev’s code : a local clifford map exists Do the mapping and operate decoding on KTCs instead. Local Clifford Map Noise model remains Pauli and local Map for syndrome bits (particles) Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 29 / 44

  74. Extension to other codes Equivalence of Topological codes Every 2D, translationally invariant, non-chiral stabilizer code with local generators and macroscopic minimal distance is locally equivalent to a finite number of copies of Kitaev’s code. Topological Color code equivalent to two copies of Kitaev’s code : a local clifford map exists Do the mapping and operate decoding on KTCs instead. Local Clifford Map Noise model remains Pauli and local Map for syndrome bits (particles) Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 29 / 44

  75. Extension to other codes Local Clifford Map KTC 1 KTC 2 KTC 1 KTC 2 TCC TCC → → → → → → → → → → Local : 1 body →≤ 3 body Preserves commutation relations Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 30 / 44

  76. Extension to other codes Charge Map = ⇒ Z Z → Z → 1 Z 1 = ⇒ → Z → Z Map of hopping operators ⇒ map of the charges Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 31 / 44

  77. Extension to other codes Results for Topological color code 1 l =16 l =32 l =64 l =128 l =256 Decoding error probability 0.1 0.01 7 7.5 8 8.5 9 9.5 10 10.5 11 Bit-Flip channel strength p % Threshold ≈ 8 . 7 % compared to ∼ 11 % . First efficient decoder for this code Guillaume Duclos-Cianci (Sherbrooke) Decoding Problem QEC’11 USC 32 / 44

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Topological Quantum Error Correcting Codes Kasper Duivenvoorden JARA IQI, RWTH Aachen

Topological Quantum Error Correcting Codes Kasper Duivenvoorden JARA IQI, RWTH Aachen

Topological Quantum Error Correcting Codes Kasper Duivenvoorden JARA IQI, RWTH Aachen Topological Phases of Quantum Matter 4 September 2014 Topology Physical errors are local Store information globally Gapped topological phase with

711 views • 42 slides
outline introduction locality in fault-tolerant quantum comp. topological codes &

outline introduction locality in fault-tolerant quantum comp. topological codes &

outline introduction locality in fault-tolerant quantum comp. topological codes & local operations results single-shot error correction self-correction gauge color codes universality via gauge-fixing

687 views • 44 slides
Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and

Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and

Information Theory Lecture 8 BCH codes BCH codes: R8.45 (R5.6) Decoding BCH (and RS) codes: R6 Reed-Solomon codes RS codes: R5.13 Mikael Skoglund, Information Theory 1/15 The BCH Bound Theorem : Let C be cyclic of

276 views • 8 slides
Quantum Algorithms for Topological Invariants Stephen Jordan Wed Feb. 3, 2010 What is a quantum

Quantum Algorithms for Topological Invariants Stephen Jordan Wed Feb. 3, 2010 What is a quantum

Quantum Algorithms for Topological Invariants Stephen Jordan Wed Feb. 3, 2010 What is a quantum algorithm? Classical Quantum 0101101 the rules: solve problem using sequence of local quantum gates the goal: use fewer gates than

1.11k views • 37 slides
List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU

List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU

Contents List decoding of error-correcting codes Fast list decoding of ReedSolomon codes Fast list decoding of certain AG codes List Decoding of Algebraic Codes Peter Beelen, Kristian Brander and Johan S.R. Nielsen DTU Mathematics

1.33k views • 81 slides
Aleksander Kubica , B. Yoshida, F. Pastawski MOTIVATION Topological quantum codes - non-local

Aleksander Kubica , B. Yoshida, F. Pastawski MOTIVATION Topological quantum codes - non-local

(IN)EQUIVALENCE OF COLOR CODE AND TORIC CODE Aleksander Kubica , B. Yoshida, F. Pastawski MOTIVATION Topological quantum codes - non-local DOFs, local generators. Toric code: high threshold, experimentally realizable (2 dim, 4-body terms,

259 views • 21 slides
List-Decoding of Polar Codes Ido Tal and Alexander Vardy University of California San Diego 9500

List-Decoding of Polar Codes Ido Tal and Alexander Vardy University of California San Diego 9500

List-Decoding of Polar Codes Ido Tal and Alexander Vardy University of California San Diego 9500 Gilman Drive, La Jolla, CA 92093, USA Problem and goal Channel polarization is slow. For short to moderate code lengths, polar codes have

1.53k views • 106 slides
Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel Alexei Ashikhmin, Bell Labs

Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel Alexei Ashikhmin, Bell Labs

1 Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel Alexei Ashikhmin, Bell Labs Correction of Erasures by Classical Codes Quantum Erasure Channel (QEC) Probability of Decoding Error in QEC via Combinatorial Invariants

452 views • 20 slides
Decoding Reed-Muller codes over product sets John Kim, Swastik Kopparty Rutgers University May

Decoding Reed-Muller codes over product sets John Kim, Swastik Kopparty Rutgers University May

Error-correcting codes Polynomial-based codes Efficient decoding of Reed-Muller codes Decoding Reed-Muller codes over product sets John Kim, Swastik Kopparty Rutgers University May 30, 2016 John Kim, Swastik Kopparty Decoding Reed-Muller

429 views • 18 slides
Deletion Decoding Codes from GRS Codes L McAven, R Safavi-Naini, Y Wang CIS- UoW AUSTRALIA

Deletion Decoding Codes from GRS Codes L McAven, R Safavi-Naini, Y Wang CIS- UoW AUSTRALIA

Deletion Decoding Codes from GRS Codes L McAven, R Safavi-Naini, Y Wang CIS- UoW AUSTRALIA Motivation 1 2 3 4 4 1 2 3 2 1 3 4 Tracing shortened fingerprints Deletion Correction Codewords, of length n A received word has n-r

542 views • 8 slides
Quantum algorithms for Information Set Decoding Elena Kirshanova ENS Lyon April 11, 2018 Quantum

Quantum algorithms for Information Set Decoding Elena Kirshanova ENS Lyon April 11, 2018 Quantum

Quantum algorithms for Information Set Decoding Elena Kirshanova ENS Lyon April 11, 2018 Quantum ISD | E.Kirshanova Information Set Decoding (ISD) The ISD Problem Given H P F p n k q n , s P F n k , find e P F n 2 s.t. He s 2 2 e

669 views • 38 slides
Quantum Lecture 9 Classical linear codes Quantum codes Mikael Skoglund, Quantum Info

Quantum Lecture 9 Classical linear codes Quantum codes Mikael Skoglund, Quantum Info

Quantum Lecture 9 Classical linear codes Quantum codes Mikael Skoglund, Quantum Info 1/16 Block Codes An ( n, M ) block (channel) code over a field GF( q ) is a set C = { x 1 , x 2 , . . . , x M } of codewords , with x m GF n ( q )

772 views • 8 slides
Topological color codes without translation symmetry and surface codes Arjun Bhagoji 1 Pradeep

Topological color codes without translation symmetry and surface codes Arjun Bhagoji 1 Pradeep

Topological color codes without translation symmetry and surface codes Arjun Bhagoji 1 Pradeep Sarvepalli 1 1 Department of Electrical Engineering Indian Institute of Technology, Madras SP Coding and Information School 2015 Unicamp, Brazil

432 views • 5 slides
Local Optimality Certificates for LP Decoding of Tanner Codes Nissim Halabi Guy Even 1 1 th

Local Optimality Certificates for LP Decoding of Tanner Codes Nissim Halabi Guy Even 1 1 th

Local Optimality Certificates for LP Decoding of Tanner Codes Nissim Halabi Guy Even 1 1 th Haifa Workshop on Interdisciplinary Applications of Graph Theory , Combinatorics and Algorithms. May 2011 1 Error Correcting Codes Worst Case Vs.

305 views • 28 slides
6.02 Fall 2012 Lecture #7 Viterbi decoding of convolutional codes Path and branch metrics

6.02 Fall 2012 Lecture #7 Viterbi decoding of convolutional codes Path and branch metrics

6.02 Fall 2012 Lecture #7 Viterbi decoding of convolutional codes Path and branch metrics Hard-decision & soft-decision decoding Performance issues: decoder complexity, post- decoding BER, free distance concept 6.02 Fall 2012

488 views • 20 slides
On List Decoding of Alternant Codes in the Hamming and Lee metrics Ido Tal Ron M. Roth Computer

On List Decoding of Alternant Codes in the Hamming and Lee metrics Ido Tal Ron M. Roth Computer

On List Decoding of Alternant Codes in the Hamming and Lee metrics Ido Tal Ron M. Roth Computer Science Department, Technion, Haifa 32000, Israel. 1 Previous Work Berlekamp, 1968: Negacyclic codes for the Lee metric. Roth and Siegel, 1994:

850 views • 19 slides
Nonparametric Inference for Geometric Objects Wolfgang Polonik Department of Statistics, UC Davis

Nonparametric Inference for Geometric Objects Wolfgang Polonik Department of Statistics, UC Davis

Overview Integral curves Level set estimation Inference for modes / modal clustering Filament Nonparametric Inference for Geometric Objects Wolfgang Polonik Department of Statistics, UC Davis Van Dantzig Seminar, University of Leiden, The

1.97k views • 162 slides

About Us Focus on targeted attack investigation, incident response, and threat solution research for more than 15 years

1.03k views • 59 slides
Topological measures of similarity Erin Wolf Chambers Saint Louis University

Topological measures of similarity Erin Wolf Chambers Saint Louis University

Topological measures of similarity Erin Wolf Chambers Saint Louis University erin.chambers@slu.edu Erin Chambers Topological measures of similarity Motivation: Measuring Similarity Between Curves How can we tell when two cycles or curves are

1.46k views • 129 slides
Topology of wireless networks L. Decreusefond Institut Also starring (by chronological order of

Topology of wireless networks L. Decreusefond Institut Also starring (by chronological order of

Topology of wireless networks L. Decreusefond Institut Also starring (by chronological order of Mines-Telecom appearance) P. Martins, E. Ferraz, F. Yan, A. Vergne, I. Flint, N.K. Le, A. Vasseur, (T. Bonis, B. Robert) GANDI: Graphs ANalysis

1.19k views • 80 slides
A topological model for studying branching and merging homologies of time flows Philippe Gaucher

A topological model for studying branching and merging homologies of time flows Philippe Gaucher

A topological model for studying branching and merging homologies of time flows Philippe Gaucher http://www.pps.jussieu.fr/gaucher Preuves, Programmes et Syst` emes, CNRS UMR 7126 et Paris 7 A topological model for studying branching and

618 views • 14 slides
INTRODUCTION I to MARSDEN and SYMMETRY Alan Weinstein University of California, Berkeley

INTRODUCTION I to MARSDEN and SYMMETRY Alan Weinstein University of California, Berkeley

INTRODUCTION I to MARSDEN and SYMMETRY Alan Weinstein University of California, Berkeley ICIAM Vancouver July 20, 2011 1 [ slide #1] Jerrold (Jerry) Marsden August 17 1942 September 21, 2010 Berkeley, 1997; George Bergman Websites:

722 views • 38 slides
Prequatization, differential cohomology and the genus integration Rui Loja Fernandes Department

Prequatization, differential cohomology and the genus integration Rui Loja Fernandes Department

Prequatization, differential cohomology and the genus integration Rui Loja Fernandes Department of Mathematics University of Illinois at Urbana-Champaign, USA 2nd Workshop S ao Paulo J. of Math. Sci. USP, November 2019 This talk is an

978 views • 71 slides
Windows API Call Sequences Sanchit Gupta, Sarvjeet Kaur and Harshit Sharma Scientific Analysis

Windows API Call Sequences Sanchit Gupta, Sarvjeet Kaur and Harshit Sharma Scientific Analysis

SPACE - 2016 Malware Characterization using Windows API Call Sequences Sanchit Gupta, Sarvjeet Kaur and Harshit Sharma Scientific Analysis Group DRDO Metcalfe House, Delhi 110054 AIM Extraction of run-time behaviour of Malware by monitoring

358 views • 24 slides

More recommend