37
Topological Quantum Computing Michael Freedman April 23, 2009

Topological Quantum Computing

  • Upload
    kacy

  • View
    30

  • Download
    0

Embed Size (px)

DESCRIPTION

Topological Quantum Computing. Michael Freedman April 23, 2009. Station Q. Parsa Bonderson Adrian Feiguin Matthew Fisher Michael Freedman Matthew Hastings Ribhu Kaul Scott Morrison Chetan Nayak Simon Trebst Kevin Walker Zhenghan Wang. - PowerPoint PPT Presentation

Citation preview

Page 1: Topological Quantum Computing

Topological Quantum Computing

Michael Freedman

April 23, 2009

Page 2: Topological Quantum Computing

Parsa BondersonAdrian FeiguinMatthew FisherMichael FreedmanMatthew HastingsRibhu KaulScott MorrisonChetan NayakSimon TrebstKevin WalkerZhenghan Wang

Station Q

Page 3: Topological Quantum Computing

•Explore: Mathematics, Physics, Computer Science, and Engineering required to build and effectively use quantum computers

•General approach: Topological

•We coordinate with experimentalists and other theorists at:

Bell LabsCaltechColumbiaHarvardPrincetonRiceUniversity of ChicagoUniversity of Maryland

Page 4: Topological Quantum Computing

We think about: Fractional Quantum Hall• 2DEG• large B field (~ 10T)• low temp (< 1K)• gapped (incompressible)• quantized filling fractions

• fractionally charged quasiparticles

• Abelian anyons at most filling fractions

• non-Abelian anyons in 2nd Landau level, e.g. n= 5/2, 12/5, …?

0 , , 21 xxe

hxym

n RR nn

Page 5: Topological Quantum Computing

The 2nd Landau level

Willett et al. PRL 59, 1776, (1987)

FQHE state at n=5/2!!!

Pan et al. PRL 83, (1999)

Page 6: Topological Quantum Computing

Our experimental friends show us amazing data which we try to understand.

Page 7: Topological Quantum Computing

12.2

12.0

11.8

11.6

11.4

R D(k)

25002000150010005000time(second)

Test of Statistics Part 1B: Tri-level Telegraph Noise

B=5.5560T

Clear demarcation of 3 values of RD

Mostly transitions from middle<->low & middle<->high; Approximately equal time spent at low/high values of RD

Tri-level telegraph noise is locked in for over 40 minutes!

Woowon Kang

Page 8: Topological Quantum Computing

Charlie Marcus Group

Page 9: Topological Quantum Computing

backscattering = |tleft+tright|2

backscattering = |tleft-tright|2

n5/2

Page 10: Topological Quantum Computing

(A) Dynamically “fusing” a bulk non-Abelian quasiparticle to the edge

non-Abelian “absorbed” by edge

Single p+ip vortex impurity pinned near the edge with Majorana zero mode

Exact S-matrix:

Couple the vortex to the edge

UV IRRG crossover

pi phase shift forMajorana edge fermion

Paul FendleyMatthew FisherChetan Nayak

Page 11: Topological Quantum Computing

Reproducibility

terror ~ 1 week!!24 hrs/run

Bob Willett

Page 12: Topological Quantum Computing

Bob Willett

Page 13: Topological Quantum Computing

Quantum Computing is an historic undertaking.

My congratulations to each of you for being part of this endeavor.

Page 14: Topological Quantum Computing

Briefest History of Numbers• -12,000 years: Counting in unary

• -3000 years: Place notation• Hindu-Arab, Chinese

• 1982: Configuration numbers as basis of a Hilbert space of states

Possible futures contract for sheep in Anatolia

Page 15: Topological Quantum Computing

Within condensed matter physics topological states are the most radical and mathematically demanding new direction

•They include Quantum Hall Effect (QHE) systems

•Topological insulators

•Possibly phenomena in the ruthinates, CsCuCl, spin liquids in frustrated magnets

•Possibly phenomena in “artificial materials” such as optical lattices and Josephson arrays

Page 16: Topological Quantum Computing

One might say the idea of a topological phase goes back to Lord Kelvin (~1867)

•Tait had built a machine that created smoke rings … and this caught Kelvin's attention:

•Kelvin had a brilliant idea: Elements corresponded to Knots of Vortices in the Aether.

•Kelvin thought that the discreteness of knots and their ability to be linked would be a promising bridge to chemistry.

•But bringing knots into physics had to await quantum mechanics.

•But there is still a big problem.

Page 17: Topological Quantum Computing

Problem: topological-invariance is clearly not a symmetry of the underlying Hamiltonian.

In contrast, Chern-Simons-Witten theory:

is topologically invariant, the metric does not appear. Where/how can such a magical theory arise as the low-energy limit of a complex system of interacting electrons which is not topologically invariant?

Page 18: Topological Quantum Computing

The solution goes back to:

Page 19: Topological Quantum Computing

 Chern-Simons Action: A d A + (A A A) has one derivative, while kinetic energy (1/2)mn2 is written with two derivatives.  In condensed matter at low enough temperatures, we expect to see systems in which topological effects dominate and geometric detail becomes irrelevant.

Page 20: Topological Quantum Computing

GaAs

Landau levels. . .

Chern Simons WZW CFT TQFT

2

2p Vm

Mathematical summary of QHE:

QM

effective field theory

Integer

fractions

Page 21: Topological Quantum Computing

1 ,3

Ndeg

n 31/3

/4( ) i iz zi j

i j

z z e

at

12

n at (or )52

/425/2

1 ( ) i jz zi j

i ji j

Pf z z ez z

The effective low energy CFT is so smart it even remembers the high energy theory:

The Laughlin and Moore-Read wave functions arise as correlators.

Page 22: Topological Quantum Computing

When length scales disappear and topological effects dominate, we may see stable degenerate ground states which are separated from each other as far as local operators are concerned. This is the definition of a topological phase.

Topological quantum computation lives in such a degenerate ground state space.

Page 23: Topological Quantum Computing

•The accuracy of the degeneracies and the precision of the nonlocal operations on this degenerate subspace depend on tunneling amplitudes which can be incredibly small.

L×L torus

tunneling MV Le

degeneracy split by atunneling process const Le

well

L

V

Page 24: Topological Quantum Computing

•The same precision that makes IQHE the standard in metrology can make the FQHE a substrate for essentially error less (rates <10-10) quantum computation.

•A key tool will be quasiparticle interferometry

Page 25: Topological Quantum Computing

Topological Charge Measuremente.g. FQH double point contact interferometer

b

Page 26: Topological Quantum Computing

FQH interferometerWillett et al. `08

for n=5/2

(also progress by: Marcus, Eisenstein, Kang, Heiblum, Goldman, etc.)

Page 27: Topological Quantum Computing

Measurement (return to vacuum)

Braiding = program

Initial 0 out of vacuum

time

(or not)

Recall: The “old” topological computation scheme

Page 28: Topological Quantum Computing

ie

'ie

=

New Approach: measurement

“forced measurement”

motion

braiding

Parsa BondersonMichael FreedmanChetan Nayak

Page 29: Topological Quantum Computing

Use “forced measurements” and an entangled ancilla to simulate braiding. Note: ancilla will be restored at the end.

a a

a

a1

a aa a

)23(1

1

)13(1

)34(1

)23(1

1

1

Page 30: Topological Quantum Computing

Measurement Simulated Braiding!

a a

a

a

a aa a

)14()23(1

)13(1

)34(1

)23(1 R

Page 31: Topological Quantum Computing

FQH fluid (blue)

Page 32: Topological Quantum Computing

Reproducibility

terror ~ 1 week!!24 hrs/run

Bob Willett

Page 33: Topological Quantum Computing
Page 34: Topological Quantum Computing

Ising vs Fibonacci(in FQH)

• Braiding not universal (needs one gate supplement)

• Almost certainly in FQH• Dn=5/2 ~ 600 mK• Braids = Natural gates

(braiding = Clifford group)

• No leakage from braiding (from any gates)

• Projective MOTQC (2 anyon measurements)

• Measurement difficulty distinguishing I and (precise phase calibration)

• Braiding is universal (needs one gate supplement)

• Maybe not in FQH• Dn=12/5 ~ 70 mK• Braids = Unnatural gates

(see Bonesteel, et. al.)

• Inherent leakage errors (from entangling gates)

• Interferometrical MOTQC (2,4,8 anyon measurements)

• Robust measurement distinguishing I and e (amplitude of interference)

Page 35: Topological Quantum Computing

Future directions

• Experimental implementation of MOTQC• Universal computation with Ising anyons, in case

Fibonacci anyons are inaccessible - “magic state” distillation protocol (Bravyi `06) (14% error threshold, not usual error-correction) - “magic state” production with partial measurements (work in progress)

• Topological quantum buses

- a new result “hot off the press”:

Page 36: Topological Quantum Computing

... a = I or

Tunneling Amplitudes

... + + +One qp

t

r

-t*

r*

|r|2 = 1-|t|2

1 2

21

0

* ( *) * ...

( *) ( )

i ia ab ba ba ab ba

i n n inab ba ab ba

n

U tR rr R e r t r R R R e

tR r R e t R R e

b

b

Aharonov-Bohmphase

Bonderson, Clark, Shtengel

Page 37: Topological Quantum Computing

21

21

1

(1 )1 *

(1 )1 *

1 *

iba

ab iab ba

iab ba

ab iab ba

iab ba

ab iab ba

t R etR

t e R R

t R R eR t

t R R e

t R R eR

t R R e

1 *

1 *

000 0

i

i

i

i

t eI t e

t et e

UU

U i

For b = s, a = I or