Topological Quantum Computation from non-abelian anyons

Transcription

1 Topological Quantum Computation from non-abelian anyons Paul Fendley Experimental and theoretical successes have made us take a close look at quantum physics in two spatial dimensions. We have now found (mostly theoretically, but also experimentally) behavior unseen in 3+1 dimensions. The mathematics describing the physics also can be quite different. 1

2 One potential application of this novel physics is a topological quantum computer. This idea relies on one particularly unusual property possible only in two dimensions: non-abelian statistics. There are several possibilities for realizing non-abelian statistics experimentally: a two-dimensional electron gas in a large magnetic field (the fractional quantum Hall effect); rapidly rotating Bose-Einstein condensates frustrated magnets. 2

3 Outline: 1. What are non-abelian statistics? 2. What does this have to do with quantum computation? 3. What does this have to do with mathematics? The Potts model and the BMW algebra: 2002, with N. Read Quantum Potts nets: 2005, with E. Fradkin New classical loop models: 2006; 2008 with J. Jacobsen Quantum Potts loop models: 2007; 2008 The BMW algebra, the chromatic algebra, and the golden identity: 2007, with V. Krushkal 3

4 4

5 The fundamentally weird thing about quantum mechanics: The quantum two-state system is really an infinite number of states: any linear combination of two quantum states is also a quantum state. Currently-fashionable buzzword: Entanglement A conventional computer uses bits, which are classical two-state systems. A quantum computer uses qubits, which are quantum two-state systems:... A quantum computation is done by a unitary transformation on the initial quantum state. 5

6 A quantum computer is massively parallel: the initial state can be a superposition of every phone number in the Manhattan phone book. A single unitary transformation acts on all of these at once: could do reverse lookups in order N time as opposed to order N. Numbers could be prime-factored in polynomial time. But with every silver lining

7 Errors! In a classical computer, just be redundant. In a quantum computer, errors are continuous, not just bit flips. Moreover, measurement destroys the superposition. How do we know errors have occurred?!? Need to preserve + α It s non-trivial to show that error correction is even possible for quantum computers. 7

8 The idea behind a topological quantum computer to exploit systems with quantum redundancy. In particular, in 2+1 dimensions, identical particles can have some very striking properties. 8

9 In three dimensions, the only statistics for identical particles are bosonic and fermionic: ψ(x 1, x 2,... ) = ±ψ(x 2, x 1,... ) Exchanging twice is a closed loop in configuration space x 1 x 2 In three dimensions, this can be adiabatically deformed to the identity. 9

10 In two dimensions, it cannot! Identical particles can pick up an arbitrary phase: ψ(x 1, x 2 ) = e iα ψ(x 2, x 1 ) Particles with α 0, π are called anyons. They have been observed in the fractional quantum Hall effect (these have fractional charge as well). 10

11 In 2+1 dimensions, the statistics comes from behavior under braiding. Each particle traces out a worldline in time, and these braid around each other. figure from Skjeltorp et al Braiding is a purely topological property. 11

12 Even more spectacular phenomena than anyons can occur under braiding. Particles can change quantum numbers! ψ a (x 1, x 2... ) = B ab ψ b (x 2, x 1... ) When the matrix B is diagonal with entries ±1, particles are bosons and fermions. When B is diagonal with entries e iα, particles are anyons. When B is not diagonal, can get non-abelian statistics. With non-abelian statistics, the probability amplitude changes depending on the order in which the particles are braided. 12

13 Braiding particles with non-abelian statistics entangles them! This is the fundamental idea behind topological quantum computation. Kitaev; excellent review in Preskill s lecture notes 13

14 We need to understand fusion: what are the statistics of a pair of particles? This is non-trivial even for abelian anyons. Say we have two identical particles which pick up a phase e iα when exchanged, or equivalently, e 2iα under a 2π rotation of one around the other. Then a pair of these picks a phase e 8iα when exchanged with different pair. In the non-abelian case, fusing two particles can give a linear combination of states, analogous to in SU(2) =

15 The simplest kind of non-abelian statistics is in the braiding of Fibonacci anyons. Fusing two Fibonacci anyons gives a linear combination of a single Fibonacci anyon (denoted φ) and a state with trivial statistics (denoted 1). They satisfy the fusion rule φ φ 1 + φ This is like the tensor product of two spin-1 representations if we throw out the spin-2 piece. The consistency rules governing braiding and fusing of anyons are identical to those of 2d rational conformal field theory. These are known as the Moore-Seiberg axioms for a universal modular tensor category. 15

16 φ φ = I + φ Precise meaning in field theory: The operator product expansion of two φ fields contains both the identity field I and the field φ itself. Precise meaning in conformal field theory: the fusion coefficients for the primary fields I and φ are N I φφ = N φ φφ = 1. Precise meaning for this talk: There are two possible quantum states for two Fibonacci anyons. One has trivial statistics, the other has the braiding properties of a single Fibonacci anyon. 16

17 This fusion algebra allows us to count the number of quantum states for 2N quasiparticles: 1 : I 1 : φ 2 : φ φ = I + φ 3 : φ φ φ = I + φ + φ 5 : φ φ φ φ = φ + 2(I + φ) 8 : φ φ φ φ φ = 3I + 5φ The number of states for n particles is the nth Fibonacci number. 17

18 To make a qubit requires 4 Fibonacci anyons. There are two different ways of fusing these four into an overall identity channel the two states of a qubit! Namely, when the overall channel is I, when the combination of anyons 1 and 2 fuses to state φ, then anyons 3 and 4 must also be in the state φ. If anyons 1 and 2 fuse to I, then anyons 3 and 4 must also fuse to I. The system can be in any linear combination of these two states. We can change the state, by braiding particle 2 around particle 3. This entanglement is possible even if none of the particles are near each other! 18

19 This is why non-abelian statistics allow a fault-tolerant quantum computer. The braiding of particle 2 with particle 3 allows us to do quantum computation. The result of this braiding depends only on the topological properties of the system: these particles can be very far from each other. No local perturbation will change the results of the braiding. 19

20 One can find the braiding and fusing matrices from standard conformal field theory techniques. For example, for four Fibonacci anyons in overall channel I, B = 1 τ e4πi/5 e 2πi/5 τ e 2πi/5 τ 1 where τ = 2 cos(π/5) = (1 + 5)/2 is the golden mean. However, a much more intuitive and instructive way to study non-abelian braiding in depth is to use algebras and draw pictures! 20

21 We project the world lines of the particles onto the plane. Then the braids become overcrossings and undercrossings The braids must satisfy the consistency condition = which in closely related contexts is called the Yang-Baxter equation. 21

22 A simple way of satisfying the consistency conditions leads to the Jones polynomial in knot theory. Replace the braid with the linear combination = q 1/2 1/2 q 1/2 = q q 1/2 so that the lines no longer cross. q is a parameter which is a root of unity in the cases of interest: the Fibonacci case corresponds to q = e iπ/5. 22

23 This gives a representation of the braid group if the resulting loops satisfy d-isotopy. isotopy: Configurations related by deforming without making any lines cross receive the same weight. d: A configuration with a closed loop receives weight d = q + q 1 relative to the configuration without the loop. 23

24 These relations can all be treated in terms of the Temperley-Lieb algebra, which graphically is = d = This is usually written in terms of generators e i acting on the ith and i + 1st stands: e 2 i = de i e i e i±1 e i = e i 24

25 To ensure finite-dimensional representations of this algebra, need with k a positive integer. d = 2 cos[π/(k + 2)] i.e. q = e iπ/(k+2) This is related to SU(2) k Chern-Simons theory. In this topological field theory, all physical quantities follow from topological data (how the loops link with each other). Witten 25

26 The problem: find a quantum Hamiltonian acting on a two-dimensional Hilbert space which has the above properties. 26

27 One answer: Fig. 1, Pan et al 0.5 T e ~ 4 mk 2 Sample R xy (h/e 2 ) 0.4 8/3 5/2 7/3 3 5/ /3 7/3 R xx (kω) 19/7 13/5 12/5 16/ MAGNETIC FIELD [T] 27

28 The leading candidate wavefunction for the ν = 5/2 plateau is the Moore-Read Pfaffian, which contains non-abelian anyons with d = 2. A closely-related theory describes the superconductor with p x + ip y pairing, believed to be realized in strontium ruthenate. The vortices here are non-abelian anyons. 28

29 Another idea: Much effort has been devoted to constructing quantum loop models whose quasiparticles have abelian and non-abelian braiding. Such models are closely related to frustrated magnets, and there is hope that they can be realized in the lab, in what are often known as spin-liquid phases. 29

30 A (hopefully not unique) procedure to construct such a quantum loop model is 1. find a 2d classical loop model which has a critical point 2. use each loop configuration as a basis element of the quantum Hilbert space 3. use a Rokhsar-Kivelson Hamiltonian to make the quantum ground state a sum over loop configurations with the appropriate weighting. Kitaev; Moessner and Sondhi; Freedman The inner product must be topological, i.e. a b depends only on topological data. Levin; Fendley 30

31 To realize this form of braiding, each loop in the ground state gets a weight d (= τ for Fibonacci) i.e. the ground state is the sum over all loop configurations g.s. = L d n L L where n L is the number of loops in configuration L. 31

32 The excitations with non-abelian braiding are defects in the sea of loops. When the defects are deconfined, they will braid with each other like the loops in the ground state. Kitaev; Freedman 32

33 To find a quantum loop model which has Fibonacci anyons, one needs to overcome several technical obstacles: the d = 2 barrier, and finding a topological inner product. These both end up being solved by allowing loops to branch, so the degrees of freedom are best called nets. A very exciting mathematical byproduct is that using quantum topology we find new algebraic proofs of the golden identity for the chromatic polynomial. We also find many generalizations. 33

34 These nets can be described using the SO(3) Birman-Murakami-Wenzl algebra: 1 = q q = q q 1 Here the lines are spin-1 versions of the spin-1/2 Temperley-Lieb lines. Note there are 3 possibilities on the right, i.e. 1 1 =

35 The generalization of d-isotopy for spin-1 lines depends on a parameter Q = q + q Graphically, it is = Q 1 = (Q 1) = (Q 2) + plus a three-strand relation. To get Fibonacci anyons, one still has q = e πi/5, so closed loops still get weight Q 1 = q + q 1 = τ. 35

36 Such loops satisfy a property understood long before BMW, or even Temperley-Lieb. Weights obeying this generalization of d-isotopy have have exactly the same properties as the chromatic polynomial χ Q. When Q is an integer, χ Q is the number of coloring each region with Q colors such that adjacent regions have different colors. For Q not an integer, the chromatic polynomial χ Q is defined recursively via the contraction-deletion relation Think of these loops as domain walls in the low-temperature expansion of the Q-state Potts model. 36

37 The chromatic algebra satisfies Fendley and Krushkal 1. d-isotopy with closed non-intersecting loops getting a weight Q Tadpoles get vanishing weight. = 0 3. Crossings can be rewritten in terms of pairs of trivalent vertices (or vice versa) via = + = + 37

38 We find models with deconfined Fibonacci anyons by exploiting a miracle called the golden identity. Tutte 1969 For branching lines on the sphere with only trivalent vertices: χ τ+2 = τ + 2 τ 4 τ 3N tri/2 ( χ τ+1 ) 2 where N tri is the number of trivalent vertices. Incidentally, this identity gives a color theorem. 38

39 Graphically, = τ 3/2 The two types of blue line (solid and dashed) are independent. Physically, this means that the weight of each domain-wall configuration in the the low-temperature expansion of the Potts model with Q = τ + 2 = (5 + 5)/2 is the square of the weight of the same configuration in the Potts model with Q = τ + 1 (and times an extra weight per vertex). 39

40 This allows construction of a quantum loop model with non-abelian braiding, the quantum Potts net. Fendley and Fradkin; Fidkowski, Freedman, Nayak, Walker and Wang; see also Levin and Wen The degrees of freedom are branching nets with only trivalent vertices allowed, e.g. One creates two Fibonacci anyons by cutting one of the strands, i.e. each anyon corresponds to the end of a strand. 40

41 The new proof of the golden identity using quantum topology exploits the chromatic algebra plus two special properties valid at special values of Q. 1. The Jones-Wenzl projector exists when q is a root of unity. When q = e iπ/5, i.e. Q = τ + 1, setting it to zero gives τ = + This can be viewed as an identity for chromatic polynomials. 41

42 2. Level-rank duality: Here we exploit O(3) 4 O(4) 3, and the fact that as algebras O(4) = O(3) O(3). = = τ+1 = τ 2 = τ + τ Each type (solid and dashed) of blue line behaves as a independent non-crossing loop! Each loop receives a weight d = τ. The golden identity can now be proved by drawing pictures! 42

43 Conclusions New identities for the chromatic polynomial can be derived using the Jones-Wenzl projector when Q = cos(2πj/(k + 2)) and j k are positive integers. For j = 1, these are the Beraha numbers. Models with non-abelian braiding have been constructed. Because they are gapped, there is hope that they might be realized in frustrated magnets. Topological quantum computation is not likely in the near future, but you never know... 43