Aleksander Kubica , B. Yoshida, F. Pastawski MOTIVATION - - PowerPoint PPT Presentation

aleksander kubica b yoshida f pastawski motivation
SMART_READER_LITE
LIVE PREVIEW

Aleksander Kubica , B. Yoshida, F. Pastawski MOTIVATION - - PowerPoint PPT Presentation

(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,


slide-1
SLIDE 1

(IN)EQUIVALENCE OF COLOR CODE AND TORIC CODE Aleksander Kubica, B. Yoshida, F. Pastawski

slide-2
SLIDE 2

MOTIVATION

Topological quantum codes - non-local DOFs, local generators. Toric code: high threshold, experimentally realizable (2 dim, 4-body terms, effective Hamiltonian of 2-body model). Color code: transversal implementation of logical gates, in particular
 . Classification of quantum phases. Classification of systems with boundaries - beyond 2D.

2

Rd = diag(1, e2πi/2d)

slide-3
SLIDE 3

TORIC CODE IN 2D

3

code space C = ground states of H

X X X X X Z Z Z Z Z

X X X

X

X

Z Z Z Z Z

∀v, p : [X(v), Z(p)] = 0

degeneracy(C) = 22g , where g - genus

H = − X

v

X(v) − X

p

Z(p)

qubits on edges X-vertex and Z-plaquette terms

slide-4
SLIDE 4

for 1< k <= d, TCk(L): qubits - k-cells
 X stabilizers - (k-1)-cells
 Z stabilizers - (k+1)-cells

TORIC CODE IN 3D (OR MORE)

4

X X X X X X Z Z Z Z

lattice L in d dim - d-1 ways of defining toric code

X X

X

X

X

X Z

Z

Z Z

H = − X

v

X(v) − X

p

Z(p)

qubits on edges X-vertex and Z-plaquette terms

slide-5
SLIDE 5

COLOR CODE IN 2D

5

2 dim lattice:


  • 3-valent

  • 3-colorable

qubits on vertices

∀p, p0 : [X(p), Z(p0)] = 0

code space C = ground states of H degeneracy(C) = 24g , where g - genus

X

X X

X X

X

Z

Z

Z

Z

Z Z

H = − X

p

X(p) − X

p

Z(p) Z Z Z Z Z Z X X X X X X

plaquette terms

slide-6
SLIDE 6

COLOR CODE IN 3D (OR MORE)

6

X X X X Z Z Z Z Z Z Z Z H = − X

p

X(p) − X

c

Z(c)

X X

X

X

Z Z

Z Z Z

Z Z

Z

for 1< k <= d, CCk(L): qubits - 0-cells
 X stabilizers - (d+2-k)-cells
 Z stabilizers - k-cells lattice L in d dim - d-1 ways of defining color code d dim lattice:


  • (d+1)-valent

  • (d+1)-colorable

qubits on vertices

slide-7
SLIDE 7

WHY COLOR CODE?

Transversally implementable gates: in 2 dim - Clifford group, in d dim -
 , cf. Bombin’13. Eastin & Knill’09: for any nontrivial local-error-detecting quantum code, the set of logical unitary product operators is not universal. Bravyi & König’13: for a topological stabilizer code in d dim, a unitary implementable by a constant-depth quantum circuit and preserving the codespace implements an encoded gate from dth level of Clifford hierarchy. Pastawski & Yoshida’14: color code saturates many bounds!

7

Rd = diag(1, e2πi/2d)

slide-8
SLIDE 8

COLOR CODE VS TORIC CODE

8

Color code and toric code - very similar but the same? Color code has transversal gates! Chen et al.’10: two gapped ground states belong to the same phase if and

  • nly if they are related by a local unitary evolution.

EQUIVALENCE = up to adding/removing ancillas and local unitaries. Yoshida’11, Bombin’11: 2D stabilizer Hamiltonians with local interactions, translation and scale symmetries are equivalent to toric code*. What if no translation symmetry? TQFT argument!

slide-9
SLIDE 9

OVERVIEW OF RESULTS

QUESTION: how are color code and toric code related? Result 1 (no boundaries):
 color code = multiple decoupled copies of toric code. Result 2 (boundaries):
 color code = folded toric code. Result 3 (logical gates):
 non-Clifford gate Cd-1Z in toric code.

9

slide-10
SLIDE 10

TRANSFORMATION IN 2D

10

Local unitary U between “red” and “turquoise/pink” qubits. Every qubit belongs to exactly one green plaquette! Green plaquettes - local transformations. U

slide-11
SLIDE 11

TRANSFORMATION IN 2D

11

shrink red plaquettes

X X X

Z

Z Z Z

Z Z

X

X X

shrink blue plaquettes initial X/Z-plaquette terms transform into X-vertex/Z-plaquette terms!

X X

X

Z

Z

Z Z X Z Z

slide-12
SLIDE 12

EXISTENCE OF LOCAL UNITARY

12

Technical tool: overlap group O, defined by 
 restriction of stabilizer generators on A. Usually, O is non-Abelian and its canonical form

A

Lemma: if two overlap groups and have the same canonical form and and satisfy the same (anti)commutation relations, then there exists a Clifford unitary U, such that . O1 = hgii O2 = hhii ∀i : hi = UgiU † {gi} {hi} Color code in 2 dim:

X X Z

Z X

X Z

Up

u

Up

u

O = ⌧ g1, . . . , gn1, gn1+1 . . . , , gn2 gn2+1, . . . , gn1+n2

slide-13
SLIDE 13

EQUIVALENCE IN D DIMENSIONS

13

Theorem: there exists a unitary , which is a tensor product of local terms with disjoint support, such that transforms the color code into decoupled copies of the toric code. U [CCk(L)] U † =

n

O

i=1

TCk−1(Li)

n = d

k−1

  • U = N

δ Uδ

CCk(L): qubits on 0-cells, X- and Z-stabilizers on (d+2-k)-cells and k-cells
 TCk(L): qubits on k-cells, X- and Z stabilizers on (k-1)-cells and (k+1)-cells


U

  • btained from by


local deformations

L

slide-14
SLIDE 14

CODES WITH BOUNDARIES

14

X

X X

X X

X X Z Z Z Z Z Z Z Z

Z

Z Z

Z

Z

Z

X X X X

X

X

X 1 logical qubit excitations: electric and magnetic, , , and composite, e m ✏ = e × m m e 2 dim toric code with boundaries: rough and smooth smooth rough

slide-15
SLIDE 15

excitations: red/green/blue of X and Z-type,

CODES WITH BOUNDARIES

15

2 dim color code with boundaries: red, green and blue

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

1 logical qubit RX, RZ, GX, GZ, BX, BZ BX RZ

X X X X X X X

X

Z Z Z Z Z Z Z

Z

slide-16
SLIDE 16

NECESSITY OF FOLDING

16

If U - local unitary implementing logical Hadamard in toric code, then We want to relate color code and toric code. But color code has transversal Hadamard gate! X ← → Z H X ← → Z U smooth rough Z X X Z fold UXU †

slide-17
SLIDE 17

COLOR CODE UNFOLDED

17

local unitaries on green plaquettes and red/blue plaquettes along the green boundary Theorem: color code in d dim with d+1 boundaries is equivalent to multiple copies of toric code attached along (d-1)-dimensional boundary. unfold color
 code toric
 code

slide-18
SLIDE 18

Fact: anyons condensing into a gapped
 boundary have mutually trivial statistics. Toric code: e - rough, m - smooth. Folded toric code:

ANYONS AND CONDENSATION

18

smooth rough e m e1 m2 e2 e1 ∂R ∂G ∂B @G = {1, e1e2, m1m2, ✏1✏2} ∂R = {1, e1, m2, e1m2} ∂B = {1, e2, m1, e2m1} e1 ≡ RX e2 ≡ BX m2 ≡ RZ m1 ≡ BZ Correspondence between anyonic
 excitations in toric code and color code:

slide-19
SLIDE 19

Gates in dth level of Clifford hierarchy
 Color code in d dim has transversally implementable logical Rd. Start with d copies of toric code, switch to color code by local unitary, apply logical Rd, switch back to toric code = implements logical Cd-1Z on d copies of toric code in d dim. Toric code saturates Bravyi-König classification!

TRANSVERSAL GATES

19

Rd|xi = e2πix/2d|xi Cd−1Z|x1, . . . , xdi = (1)x1...xd|x1, . . . , xdi

slide-20
SLIDE 20

SUMMARY

No boundaries: color code = multiple decoupled copies of toric code. Boundaries: color code = folded toric code. Non-Clifford gate Cd-1Z in d copies of toric code implementable via a local unitary transformation. Reverse the procedure: start with multiple copies and apply local transformations to obtain new codes, cf. Brell’14: G-color codes. Insights into classification of TQFTs with boundaries in 2 dim or more.

20

slide-21
SLIDE 21

TRANSFORMATION IN 2D

22

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