Hyperbolic Color Codes on Densest Tessellations Clarice Dias de - PowerPoint PPT Presentation

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes on Densest Tessellations Clarice Dias de Albuquerque (UFCA) Reginaldo Palazzo Junior (UNICAMP) 27/07/2018

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Topological Quantum Codes The main characteristic of topological codes is the contrast between the local character of the stabilizer generators and the overall nondetectable errors. This implies the simplicity of the stabilizer generators and the code distance increases as the cardinality of the set of the stabilizer generators increases. Fault-tolerant quantum computation: the code space is realized in a quantum system ordered topologically The stabilizer operators constitute a Hamiltonian with local interactions, whose ground state coincides with the code subspace

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Kitaev’s Toric Code ◮ Square lattice l × l . ◮ qubits → edges of the lattice. ◮ n = | E | = 2 l 2 and k = 2.

C C’ c’ c c c c’ Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Kitaev’s Toric Code ◮ qubits → edges of the lattice. ◮ n = | E | = 2 l 2 and k = 2. ◮ d min = l .

F V Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Kitaev’s Toric Code ◮ Stabilizer operators: � σ j � σ j A v = B f = z . x j ∈ E v j ∈ E f ◮ C = {| ψ � : A v | ψ � = | ψ � , B f | ψ � = | ψ � ∀ v , f } .

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Hyperbolic Toric Codes Conjecture: The performance of a quantum error-correcting codes on surfaces with genus g ≥ 2 can be better, in terms of the error probability, than that codes on surfaces with genus g < 2.

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Hyperbolic Toric Codes Conjecture: The performance of a quantum error-correcting codes on surfaces with genus g ≥ 2 can be better, in terms of the error probability, than that codes on surfaces with genus g < 2. In addition, these surfaces can be tilling by various tessellations, generating different codes that may provide more applications.

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Plane Models of Surfaces A compact topological surface M may be obtained of a polygon P ′ by “pasting” edges in pairs, since length and angle conditions are satisfied. (i) For each edge s of P ′ there exists a unique edge s ′ of P ′ such that s ′ = γ ( s ), where γ is an isometry of an isometry group Γ. (ii) Given edge-pairings of P ′ , for each vertex cycle (a chain of identifications with vertices), the sum of the angles has to be equal to 2 π .

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Plane Models of Surfaces A compact topological surface M may be obtained of a polygon P ′ by “pasting” edges in pairs, since length and angle conditions are satisfied. (i) For each edge s of P ′ there exists a unique edge s ′ of P ′ such that s ′ = γ ( s ), where γ is an isometry of an isometry group Γ. (ii) Given edge-pairings of P ′ , for each vertex cycle (a chain of identifications with vertices), the sum of the angles has to be equal to 2 π . We use polygons P ′ of the type 4 g -gon with the pairings of opposite edges of P ′ as the plane models of the surfaces.

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Tessellations of P ′ ◮ The solution of the following equation results in all possible tessellations { p , q } of P ′ µ ( P ′ ) = n f µ ( P ) , (1) where µ ( P ′ ) is the area of P ′ , µ ( P ) is the area of the polygon associated to { p , q } , n f is a positive integer and ( p − 2)( q − 2) > 4. ◮ Dual tessellation { q , p } has to satisfy the same conditions. ◮ From the Gauss-Bonnet Theorem, (1) may be written as: � ( p − 2) π − 2 p π � 4 π ( g − 1) = n f ) (2) . q 4 q ( g − 1) n f = (3) pq − 2 p − 2 q .

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Toric Codes on Surfaces with g ≥ 2 4 q ( g − 1) ◮ n f = pq − 2 p − 2 q . ◮ n = | E | = n f · p 2 and k = 2 g . ◮ Example: 14 − gon surface with g = 3, with tessellation { 7 , 3 } . We have: n f = 24 , n v = 56 and n = 84.

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Toric Codes on Surfaces with g ≥ 2 ◮ Pairings of opposite edges. � � cos( π/ 4 g ) 2 arccosh [ sin( π/ 4 g ) ] ◮ d = . cos2( π/ q )+cos(2 π/ p ) � � arccosh sin2( π/ q ) ◮ Example: s 2 i +1 → s 2 i +6 . In this case, d min = 4.

Hyperbolic Color Codes on Densest Tessellations Topological Quantum Codes Toric Codes on Surfaces with g ≥ 2 ◮ Stabilizer operators: � σ j � σ j A v = B f = z . x j ∈ E v j ∈ E f ◮ C = {| ψ � : A v | ψ � = | ψ � , B f | ψ � = | ψ � ∀ v , f } .

Hyperbolic Color Codes on Densest Tessellations Color Codes Color Codes - H. Bombin and M. Delgado ◮ Color codes allow the transverse implementation of logic gates � 0 � 1 � � 1 0 X = Z = 1 0 0 − 1  1 0 0 0  0 1 0 0   CNot =  .   0 0 0 1  0 0 1 0 ◮ And the gates � 1 � 1 1 � � 1 0 H = √ K = . 1 − 1 0 i 2 ◮ These gates generate the group of Clifford, composed by the operators that leave invariant by conjugation the group of Pauli, that is sufficient to perform teleportation and distillation protocols, and hence to perform universal computation.

Hyperbolic Color Codes on Densest Tessellations Color Codes Lattice Bidimensional lattice embedded in a torus of arbitrary genus such that let the graph be: (i) trivalent (ii) 3-colorable

Hyperbolic Color Codes on Densest Tessellations Color Codes Lattice Bidimensional lattice embedded in a torus of arbitrary genus such that let the graph be: (i) trivalent (ii) 3-colorable Hexagonal Lattice { 6 , 3 } , Square-octagon Lattice { 4 , 8 , 8 } , Truncated Trihexagonal Lattice { 4 , 6 , 12 } .

Hyperbolic Color Codes on Densest Tessellations Color Codes Lattice Bidimensional lattice embedded in a torus of arbitrary genus such that let the graph be: (i) trivalent (ii) 3-colorable Hexagonal Lattice { 6 , 3 } , Square-octagon Lattice { 4 , 8 , 8 } , Truncated Trihexagonal Lattice { 4 , 6 , 12 } .

Hyperbolic Color Codes on Densest Tessellations Color Codes Parameters ◮ Qubits ← → vertices of the bidimensional lattice of the torus. ◮ Stabilizer operators associated with the lattice faces. � � B X B Z f = f = X i Z i i ∈ f i ∈ f ◮ C = {| ψ � : B X f | ψ � = | ψ � , B Z f | ψ � = | ψ � ∀ f } . ◮ n = | V | ◮ k = 4 g

Hyperbolic Color Codes on Densest Tessellations Color Codes Parameters ◮ d is the minimum length between paths with non-trivial homology. ◮ Consider, for example, red faces, placing a site at each face and connecting them through red edges. In this new (triangular) lattice, known as shrunk lattice, each edge corresponds to two vertices in the initial colored lattice and that the blue and green faces correspond to faces in the new lattice. There is a shrunk lattice for each color.

Hyperbolic Color Codes on Densest Tessellations Color Codes Example - P. Sarvepalli and R. Raussendorf ◮ Hexagonal Lattice - the color code on this lattice has to satisfy certain restrictions on its dimensions in order to be embedded on the torus. ◮ [[18 x 2 m , 4 , 4 x m ]] = [[2(3 x m ) 2 , 4 , 4 x m ]], where m can be any nonnegative integer and x ≥ 2. ◮ [[72 , 4 , 8]] code on the dual tessellation:

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Hyperbolic Color Codes ◮ Tessellations: { 2 p ′ , 3 } ◮ n f = 6( g − 1) p ′ − 3 .

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Operators and Parameters ◮ Operators: B σ f = � i ∈ f σ i σ = X , Z ◮ C = {| ψ � : B X f | ψ � = | ψ � , B Z f | ψ � = | ψ � ∀ f } . p p ◮ n = | V | = n f q = n f 3 . ◮ k = 4 − 2 χ = 4 g .

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Operators and Parameters d is the minimum length between paths with non-trivial homology, considering the shrunk lattice.

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Hyperbolic Color Codes on Densest Tessellations Consider { 12 i − 6 , 3 } , then n f = g − 1 i − 1 .

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Hyperbolic Color Codes on Densest Tessellations Consider { 12 i − 6 , 3 } , then n f = g − 1 i − 1 . { 18 , 3 } tessellation: n → 2 ◮ [[6( g − 1) , 4 g , d ]] and k 3

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Hyperbolic Color Codes on Densest Tessellations Consider { 12 i − 6 , 3 } , then n f = g − 1 i − 1 . { 18 , 3 } tessellation: n → 2 ◮ [[6( g − 1) , 4 g , d ]] and k 3 { 30 , 3 } tessellation: n → 4 ◮ [[5( g − 1) , 4 g , d ]] and k 5

Hyperbolic Color Codes on Densest Tessellations Hyperbolic Color Codes Hyperbolic Color Codes on Densest Tessellations Consider { 12 i − 6 , 3 } , then n f = g − 1 i − 1 . { 18 , 3 } tessellation: n → 2 ◮ [[6( g − 1) , 4 g , d ]] and k 3 { 30 , 3 } tessellation: n → 4 ◮ [[5( g − 1) , 4 g , d ]] and k 5 { 42 , 3 } tessellation: ◮ [[ 14 3 ( g − 1) , 4 g , d ]] and k n → 6 7