Local stabilizer codes in 3D without string logical operators - - PowerPoint PPT Presentation

local stabilizer codes in 3d without string logical
SMART_READER_LITE
LIVE PREVIEW

Local stabilizer codes in 3D without string logical operators - - PowerPoint PPT Presentation

Local stabilizer codes in 3D without string logical operators arXiv:1101.1962 Jeongwan Haah IQIM, Caltech 6 Dec 2011 Quantum Error Correction 2011 Problem Theme Find a noise-free subspace/subsystem from a physical system, Problem Theme


slide-1
SLIDE 1

Local stabilizer codes in 3D without string logical operators

arXiv:1101.1962 Jeongwan Haah IQIM, Caltech 6 Dec 2011 Quantum Error Correction 2011

slide-2
SLIDE 2

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system,

slide-3
SLIDE 3

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system, ◮ on which manipulations are still possible.

slide-4
SLIDE 4

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system, ◮ on which manipulations are still possible.

Many-body system

slide-5
SLIDE 5

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system, ◮ on which manipulations are still possible.

Many-body system

◮ Local indistinguishability – Topological order

slide-6
SLIDE 6

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system, ◮ on which manipulations are still possible.

Many-body system

◮ Local indistinguishability – Topological order ◮ Stable at zero temperature

slide-7
SLIDE 7

Problem

Theme

◮ Find a noise-free subspace/subsystem from a physical system, ◮ on which manipulations are still possible.

Many-body system

◮ Local indistinguishability – Topological order ◮ Stable at zero temperature

Topological QC ?

◮ TQC with anyons ∼ Excited states ◮ (Self-correcting) Memory ∼ Ground state

slide-8
SLIDE 8

Why hard?

Kitaev 2D toric code

H = −

s X X X X Z Z

p Z Z ◮ Locally indistinguishable 4-fold degenerate ground state.

slide-9
SLIDE 9

Why hard?

Kitaev 2D toric code

H = −

s X X X X Z Z

p Z Z ◮ Locally indistinguishable 4-fold degenerate ground state. ◮ But, |ψ0 ⇐

⇒ |ψ1 by dragging a quasi-particle across.

  • Z

Z · · · Z •

slide-10
SLIDE 10

Why hard?

Kitaev 2D toric code

H = −

s X X X X Z Z

p Z Z ◮ Locally indistinguishable 4-fold degenerate ground state. ◮ But, |ψ0 ⇐

⇒ |ψ1 by dragging a quasi-particle across.

  • Z

Z · · · Z •

Bad at T > 0.

slide-11
SLIDE 11

Why hard?

Kitaev 2D toric code

H = −

s X X X X Z Z

p Z Z ◮ Locally indistinguishable 4-fold degenerate ground state. ◮ But, |ψ0 ⇐

⇒ |ψ1 by dragging a quasi-particle across.

  • Z

Z · · · Z •

Bad at T > 0. The same had happened for all low dimensional models. Self-correction is possible in 4D or higher.

slide-12
SLIDE 12

3D Cubic Code

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

slide-13
SLIDE 13

3D Cubic Code

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ◮ Two spins per site on a simple cubic lattice.

◮ Local interaction. All terms commuting. Frustration-free.

slide-14
SLIDE 14

3D Cubic Code

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ◮ Two spins per site on a simple cubic lattice.

◮ Local interaction. All terms commuting. Frustration-free. ◮ Rigorous definition for string in the discrete lattice. ◮ The model has only short string segments.

slide-15
SLIDE 15

3D Cubic Code

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ◮ Two spins per site on a simple cubic lattice.

◮ Local interaction. All terms commuting. Frustration-free. ◮ Rigorous definition for string in the discrete lattice. ◮ The model has only short string segments. ◮ Exotic degeneracy: k(L = 2p) = 4L − 2, k(L = 2p + 1) = 2.

slide-16
SLIDE 16

Stabilizer/Additive codes

slide-17
SLIDE 17

Stabilizer/Additive codes

Abelianized Pauli group

◮ σX · σX = I ⇐

⇒ (10) + (10) = (00)

◮ σX · σZ = −iσY ⇐

⇒ (10) + (01) = (11)

slide-18
SLIDE 18

Stabilizer/Additive codes

Abelianized Pauli group

◮ σX · σX = I ⇐

⇒ (10) + (10) = (00)

◮ σX · σZ = −iσY ⇐

⇒ (10) + (01) = (11)

◮ [σX, σZ] = 0 ⇐

⇒ (10)λ1(01)T = 1

◮ [σX ⊗ σX, σZ ⊗ σZ] = 0 ⇐

⇒ (1010)λ2(0101)T = 0

slide-19
SLIDE 19

Stabilizer/Additive codes

Abelianized Pauli group

◮ σX · σX = I ⇐

⇒ (10) + (10) = (00)

◮ σX · σZ = −iσY ⇐

⇒ (10) + (01) = (11)

◮ [σX, σZ] = 0 ⇐

⇒ (10)λ1(01)T = 1

◮ [σX ⊗ σX, σZ ⊗ σZ] = 0 ⇐

⇒ (1010)λ2(0101)T = 0

◮ Abelianized Pauli group is a symplectic vector space over Fp with

λn = In −In

  • .
slide-20
SLIDE 20

Stabilizer/Additive codes

Abelianized Pauli group

◮ σX · σX = I ⇐

⇒ (10) + (10) = (00)

◮ σX · σZ = −iσY ⇐

⇒ (10) + (01) = (11)

◮ [σX, σZ] = 0 ⇐

⇒ (10)λ1(01)T = 1

◮ [σX ⊗ σX, σZ ⊗ σZ] = 0 ⇐

⇒ (1010)λ2(0101)T = 0

◮ Abelianized Pauli group is a symplectic vector space over Fp with

λn = In −In

  • .

Codes

slide-21
SLIDE 21

Stabilizer/Additive codes

Abelianized Pauli group

◮ σX · σX = I ⇐

⇒ (10) + (10) = (00)

◮ σX · σZ = −iσY ⇐

⇒ (10) + (01) = (11)

◮ [σX, σZ] = 0 ⇐

⇒ (10)λ1(01)T = 1

◮ [σX ⊗ σX, σZ ⊗ σZ] = 0 ⇐

⇒ (1010)λ2(0101)T = 0

◮ Abelianized Pauli group is a symplectic vector space over Fp with

λn = In −In

  • .

Codes

◮ Commuting set of Pauli operators = Null subspace S

= stabilizer group

◮ Symmetry group = Hyperbolic subspace in S⊥

= group of logical operators.

slide-22
SLIDE 22

Cubic codes

Generally

◮ Simple cubic lattice with m qubits per site. ◮ t types of cubic interactions with code space dimension > 1.

slide-23
SLIDE 23

Cubic codes

Generally

◮ Simple cubic lattice with m qubits per site. ◮ t types of cubic interactions with code space dimension > 1. ◮ No single site logical operator. ◮ No obvious string operator.

slide-24
SLIDE 24

Cubic codes

Generally

◮ Simple cubic lattice with m qubits per site. ◮ t types of cubic interactions with code space dimension > 1. ◮ No single site logical operator. ◮ No obvious string operator.

Simply

◮ t = 2 : one for X, one for Z type. ◮ Product of all terms in the Hamiltonian be Id. ◮ Logical operator on a site be Id. ◮ Logical operator on a straight line be Id.

slide-25
SLIDE 25

Cubic codes

Generally

◮ Simple cubic lattice with m qubits per site. ◮ t types of cubic interactions with code space dimension > 1. ◮ No single site logical operator. ◮ No obvious string operator.

Simply

◮ t = 2 : one for X, one for Z type. ◮ Product of all terms in the Hamiltonian be Id. ◮ Logical operator on a site be Id. ◮ Logical operator on a straight line be Id.

Finally

◮ Translate the conditions into linear algebra equations on Pm ◮ → Linear equations, rank constraints.

slide-26
SLIDE 26

17 / 237

D′

Z

  • C ′

Z

  • AZ

BZ B′

Z

A′

Z

CZ DZ

  • D′

X

  • C ′

X

  • AX

BX B′

X

A′

X

CX DX

slide-27
SLIDE 27

17 / 237

D′

Z

  • C ′

Z

  • AZ

BZ B′

Z

A′

Z

CZ DZ

  • D′

X

  • C ′

X

  • AX

BX B′

X

A′

X

CX DX

  • ◮ 64 commutation relations determine everything.
slide-28
SLIDE 28

17 / 237

D′

Z

  • C ′

Z

  • AZ

BZ B′

Z

A′

Z

CZ DZ

  • D′

X

  • C ′

X

  • AX

BX B′

X

A′

X

CX DX

  • ◮ 64 commutation relations determine everything.

◮ 27 linear equations ensuring commuting Hamiltonian.

slide-29
SLIDE 29

17 / 237

D′

Z

  • C ′

Z

  • AZ

BZ B′

Z

A′

Z

CZ DZ

  • D′

X

  • C ′

X

  • AX

BX B′

X

A′

X

CX DX

  • ◮ 64 commutation relations determine everything.

◮ 27 linear equations ensuring commuting Hamiltonian. ◮ Find by brute-force the solutions of remaining 30 equations.

slide-30
SLIDE 30

17 / 237

D′

Z

  • C ′

Z

  • AZ

BZ B′

Z

A′

Z

CZ DZ

  • D′

X

  • C ′

X

  • AX

BX B′

X

A′

X

CX DX

  • ◮ 64 commutation relations determine everything.

◮ 27 linear equations ensuring commuting Hamiltonian. ◮ Find by brute-force the solutions of remaining 30 equations. ◮ 17 different solutions up to symmetry group of cube !

slide-31
SLIDE 31

Code 1 / 17

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • Duality QZ ↔ QX.
slide-32
SLIDE 32

Code 1 / 17

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • Duality QZ ↔ QX.

This model has no string...

◮ Wait, is it topologically ordered? ◮ What do you mean by string? What if there is a thick string?

slide-33
SLIDE 33

No local observables distinguish ground states

If O has small support, then ΠGSOΠGS = c(O)ΠGS.

slide-34
SLIDE 34

No local observables distinguish ground states

If O has small support, then ΠGSOΠGS = c(O)ΠGS.

◮ Claim: Any Pauli operator of bounded support commuting with all

stabilizers is a stabilizer.

slide-35
SLIDE 35

No local observables distinguish ground states

If O has small support, then ΠGSOΠGS = c(O)ΠGS.

◮ Claim: Any Pauli operator of bounded support commuting with all

stabilizers is a stabilizer.

◮ Any operator is a linear combination of Pauli operators.

slide-36
SLIDE 36

No local observables distinguish ground states

If O has small support, then ΠGSOΠGS = c(O)ΠGS.

◮ Claim: Any Pauli operator of bounded support commuting with all

stabilizers is a stabilizer.

◮ Any operator is a linear combination of Pauli operators. ◮ Because QX ↔ QZ, it suffices to consider X-type Pauli operator.

slide-37
SLIDE 37

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

slide-38
SLIDE 38

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

= ⇒ ? = II, XX

slide-39
SLIDE 39

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

= ⇒ ? = II, XX

  • [IZ, ?] = 0

[ZI, ?] = 0

slide-40
SLIDE 40

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

= ⇒ ? = II, XX

  • [IZ, ?] = 0

[ZI, ?] = 0 = ⇒ ? = II

slide-41
SLIDE 41

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

= ⇒ ? = II, XX

  • [IZ, ?] = 0

[ZI, ?] = 0 = ⇒ ? = II

  • [IZ, ?] = 0

[ZZ, ?] = 0

slide-42
SLIDE 42

Tool – Eraser

Exercise

If ? is one of II, XI, IX, XX;

◮ [ZZ, ?] = 0

= ⇒ ? = II, XX

  • [IZ, ?] = 0

[ZI, ?] = 0 = ⇒ ? = II

  • [IZ, ?] = 0

[ZZ, ?] = 0 = ⇒ ? = II

slide-43
SLIDE 43

No local observables distinguish ground states

Proof

?

  • ?
  • ?

? ? ? ? XI

  • IZ
  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

slide-44
SLIDE 44

No local observables distinguish ground states

Proof

?

  • ?
  • ?

? ? ? ? XI

  • IZ
  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ?
  • ?
  • ?

? ? ? II

slide-45
SLIDE 45

No local observables distinguish ground states

Proof

?

  • ?
  • ?

? ? ? ? XI

  • IZ
  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ?
  • ?
  • ?

? ? ? II ?

  • ?
  • ?

? ? II

slide-46
SLIDE 46

No local observables distinguish ground states

Proof

?

  • ?
  • ?

? ? ? ? XI

  • IZ
  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ?
  • ?
  • ?

? ? ? II ?

  • ?
  • ?

? ? II ?

  • II
  • ?

?

slide-47
SLIDE 47

No local observables distinguish ground states

Proof

?

  • ?
  • ?

? ? ? ? XI

  • IZ
  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ?
  • ?
  • ?

? ? ? II ?

  • ?
  • ?

? ? II ?

  • II
  • ?

? Q.E.D.

slide-48
SLIDE 48

Elementary Excitations (Syndromes)

Can you make a pair of defects out of these ?

slide-49
SLIDE 49

String?

slide-50
SLIDE 50

String?

slide-51
SLIDE 51

String?

slide-52
SLIDE 52

String?

slide-53
SLIDE 53

String?

slide-54
SLIDE 54

String?

slide-55
SLIDE 55

String?

slide-56
SLIDE 56

String?

slide-57
SLIDE 57

String?

slide-58
SLIDE 58

String?

  • Surface?
slide-59
SLIDE 59

String segment

String?

◮ 1D object..... – Not well-defined; only for special models.

slide-60
SLIDE 60

String segment

String?

◮ 1D object..... – Not well-defined; only for special models. ◮ Need to deal with a family of Hamiltonians.....

slide-61
SLIDE 61

String segment

String?

◮ 1D object..... – Not well-defined; only for special models. ◮ Need to deal with a family of Hamiltonians.....

Definition

A finite Pauli operator that creates excitations at most two locations.

slide-62
SLIDE 62

String segment

String?

◮ 1D object..... – Not well-defined; only for special models. ◮ Need to deal with a family of Hamiltonians.....

Definition

A finite Pauli operator that creates excitations at most two locations.

◮ Anchors envelop excitations. ◮ width = the size of the anchors. ◮ length = the distance between the anchors.

slide-63
SLIDE 63

String segment

String?

◮ 1D object..... – Not well-defined; only for special models. ◮ Need to deal with a family of Hamiltonians.....

Definition

A finite Pauli operator that creates excitations at most two locations.

◮ Anchors envelop excitations. ◮ width = the size of the anchors. ◮ length = the distance between the anchors. ◮ No geometric restriction.

slide-64
SLIDE 64

Trivial string segments

X X X X X X X Z Z Z Z Z Z Z Z Z Z X X Z Z Z

slide-65
SLIDE 65

Trivial string segments

X X X X X X X Z Z Z Z Z Z Z Z Z Z X X Z Z Z

◮ Trivial, if there is a equivalent P s.t. supp(P) = C1 ∪ C2 and

dist(C1, C2) > 1.

slide-66
SLIDE 66

Trivial string segments

X X X X X X X Z Z Z Z Z Z Z Z Z Z X X Z Z Z

◮ Trivial, if there is a equivalent P s.t. supp(P) = C1 ∪ C2 and

dist(C1, C2) > 1.

◮ A trivial string segment only creates trivial charges.

examples...

slide-67
SLIDE 67

String segment: Example

In 2D toric code:

  • Z

Z Z Z

slide-68
SLIDE 68

String segment: Example

In 2D toric code:

  • Z

Z Z Z

  • ◮ Dots are enclosed by two anchors.

◮ Pauli operator commutes with local terms in H except at the

anchors.

◮ Non-trivial string segment. ◮ Width = 1, length = ∞

slide-69
SLIDE 69

String segment: Example

In 2D Ising model: H = −

ij ZiZj

slide-70
SLIDE 70

String segment: Example

In 2D Ising model: H = −

ij ZiZj ◮ Non-trivial X-type string segment. ◮ Two anchors must be adjacent. ◮ length = 0

slide-71
SLIDE 71

No-strings rule

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • A string segment of width w and length ≥ 15w is trivial.
slide-72
SLIDE 72

No-strings rule

X X X X X X X Z Z Z Z Z Z Z Z Z Z X X Z Z Z

Proof

◮ Any long string segment is equivalent to a product of “flat” ones. ◮ Any long flat segment is trivial.

slide-73
SLIDE 73

No-strings rule : Proof

Recall the Eraser: IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ?
  • ?
  • ?

? ? ? ? XI

  • ?
  • ?
  • ?

? ? ? II ?

  • ?
  • ?

? ? ?

◮ IZ–ZI has two independent ends.

slide-74
SLIDE 74

No-strings rule : Proof

IZ ZI ZI ZZ II IZ IZ ZI

slide-75
SLIDE 75

No-strings rule : Proof

IZ ZI ZI ZZ II IZ IZ ZI Reduced to flat segments.

slide-76
SLIDE 76

No-strings rule : Proof

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

slide-77
SLIDE 77

No-strings rule : Proof

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • [O1 − O2, IZ − ZI] = 0

[O1 − O2, II − IZ] = 0

slide-78
SLIDE 78

No-strings rule : Proof

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • [O1 − O2, IZ − ZI] = 0

[O1 − O2, II − IZ] = 0 ⇐ ⇒ O1 − O2 =          II − II XI − II IX − XI XX − XI

slide-79
SLIDE 79

No-strings rule : Proof

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • [O1 − O2, IZ − ZI] = 0

[O1 − O2, II − IZ] = 0 ⇐ ⇒ O1 − O2 =          II − II XI − II IX − XI XX − XI          II − II − II − · · · XX − XI − II − · · · IX − XI − II − · · · XI − II − II − · · ·

slide-80
SLIDE 80

No-strings rule : Proof

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • [O1 − O2, IZ − ZI] = 0

[O1 − O2, II − IZ] = 0 ⇐ ⇒ O1 − O2 =          II − II XI − II IX − XI XX − XI          II − II − II − · · · XX − XI − II − · · · IX − XI − II − · · · XI − II − II − · · · Q.E.D.

slide-81
SLIDE 81

No-strings rule

◮ You can’t drag the defect. ◮ Annihilate it, and then create it.

slide-82
SLIDE 82

Code space dimension under periodic boundary conditions

L k L k 2 6 3 2 4 14 5 2 6 6 7 2 8 30 9 2 10 6 11 2 12 14 13 2 14 6 15 50 16 62 17 2

slide-83
SLIDE 83

Code space dimension under periodic boundary conditions

L k L k 2 6 3 2 4 14 5 2 6 6 7 2 8 30 9 2 10 6 11 2 12 14 13 2 14 6 15 50 16 62 17 2

Formula(?) for odd L

k + 2 4 = degx gcd

  • 1 + (1 + x)L, 1 + (1 + tx)L, 1 + (1 + t2x)L

F4

where t2 + t + 1 = 0.

slide-84
SLIDE 84

Summary

IZ

  • ZI
  • ZI

ZZ II IZ IZ ZI

  • IX
  • XI
  • XI

II XX IX IX XI

  • ◮ Strictly local commuting Hamiltonian, frustration-free.

◮ Defined and proved no-strings rule, with aspect ratio 15. ◮ Exotic degeneracy: k(L = 2p) = 4L − 2, k(L = 2p + 1) = 2. ◮ Logarithmic energy barrier leads to very long memory time

→ Bravyi’s talk 4:40.