20
Topological Quantum Computation George Toh 11/6/2017

Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

  • Upload
    others

  • View
    7

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

TopologicalQuantumComputation

GeorgeToh11/6/2017

Page 2: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Contents

• QuantumComputing• ComparisonofQCvsTQC• TopologicalQuantumComputation• HowtoimplementTQC?• Examples,progress• Industryinvestment• Futureoutlook

Page 3: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

TimelineofQuantumComputing

• 1980s– Benioff,Manin,FeynmanandDeutsch• 1994– Shor’sAlgorithm(factoring)• 1995– Firstquantumlogicgate(trappedions)• 1997– Kitaev describesTopologicalQC• 2001– 7bitNMRQC+Shor’sAlgo:15• 2011– D-Wave128-bitQuantumAnnealer• 2013– Evidenceofnon-Abeliananyons• 2016– Google&UCSBsimulatehydrogenmolecule• 2016– IBMQX5bitQC(online!)• 2017– IBMQX16bitQC

D-Wavesystemschip

IBM7-bitchip

Page 4: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

QuantumComputing

• Applications• Quantumfactoring(Shor’sAlgorithm)• Efficientsearch(Grover’sAlgorithm)• Quantumsimulation• Quantumsupremacy(>56Qubits)

• Qubits• Trappedions,superconductingloops,quantumdots

Page 5: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

PioneersinTQC

• AlexeiKitaev (Caltech)• 1997- FirstproposedTopologicalquantumcomputation• 2002- ProvedthataTQCcandoanyquantumcomputation(withFreedmanandothers)

• MichaelFreedman(UCSantaBarbara)• 2005- ProposedthataquantumHalldevicecouldrealizeatopologicalqubit• DirectorofMicrosoftStationQatUCSB

Page 6: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Comparison– WhyTQC?

QuantumComputing• Qubits• Quantumdecoherence(Noise)• Extremelyfragile• Needtobeshieldedfromenvironmentalperturbations

TopologicalQuantumComputing• Topologicalqubitsbasedonnon-Abeliananyons• Thesetwo-dimensionalquasiparticlesformbraidswhicharemuchmorestable

Page 7: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Non-Abeliananyons

FermionandBoson• Abelian• Fermi-Diracstatisticsor• Bose-Einsteinstatistics

Anyon• 2-Dimensionalquasiparticle• Non-Abelian• PossibletobesomewhereinbetweenF-DandB-Estatistics• Particleinterchange:phasechangedoesnothavetobe+1or-1

Page 8: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

TopologicalQuantumComputation

• Non-Abeliananyons• Braid=quantumoperation• Fault-tolerant

(a)and(b)aretopologicallyidentical

Page 9: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

https://www-01.ibm.com/events/wwe/grp/grp308.nsf/vLookupPDFs/07%20Quantum%20Computing%20cognitive%20event/$file/07%20Quantum%20Computing%20cognitive%20event.pdf

Page 10: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Candidatesfornon-Abeliananyons

• Nanowireonsuperconductor• Majorana zeromodes

• FractionalQuantumHallStateat(fillingfactor)ν =5/2

Page 11: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

HybridSuperconductor-SemiconductorNanowireDevices

• SemiconductorInSb nanowireincontactwithanordinarysuperconductorNb

• Zeroenergypeaksshowuponlywhenafiniteexternalmagneticfieldisappliedtothewire

2012,Science,TUDelft,Majorana Fermions

Page 12: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

2012,NaturePhysics,WeizmannInst(Israel)

HybridSuperconductor-SemiconductorNanowireDevices

• SimilarexperimenttoDelft,publishedafewmonthslaterin2012

• InAs nanowireonAlsuperconductor

Page 13: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Experimentalevidenceofnon-Abeliananyons• Fabry-PerotInterferometermadeofGaAs/AlGaAsquantumwellwithaSiN layer

• PeriodofA-Boscillationindicativeofnon-Abeliannatureofν=5/2state

2013,PRL,Aharonov-Bohmoscillations

Page 14: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Experimentalevidenceofnon-Abeliananyons• Nextstepistoimplementandtestatwointerferometersetup

201,Quantamagazine

Page 15: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

InvestmentsinTQC

• Microsoft:StationQ• UCSB,ProfMichaelFreedman,Theory• TUDelftandUniversityofSydney,Experimental• Purdue,ProfManfra,Experimental

• IntelandQuTech• DelftUniversity• US$50million

• BellLabs• RobertWillett

Page 16: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Purdue– MicrosoftStationQ

• PurdueUniversityandMicrosoftCorp.havesignedamulti-yearagreementtodevelopauseablequantumcomputer(May2017)• Growandstudyultra-puresemiconductorsandhybridsystemsofsemiconductorsandsuperconductors• Manfra’s grouphasexpertiseinatechniquecalledmolecularbeamepitaxy,usedtobuildlow-dimensionalelectronsystemsthatformthebasisforquantumbits,orqubits.

https://www.purdue.edu/newsroom/releases/2017/Q2/microsoft,-purdue-collaborate-to-advance-quantum-computing-.html

Page 17: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Conclusion

• Quantumcomputersarehotduetothepotentialapplications• TQCofferawaytosolvethedecoherence/noiseproblem• MicrosoftisbettingbigonTQC• TQCnotyetexperimentallydemonstrated

Page 18: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

http://www.sciencemag.org/news/2016/12/scientists-are-close-building-quantum-computer-can-beat-conventional-one

Page 19: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

Diracnotation

Bosons:

Fermions:

Anyons:

Page 20: Topological Quantum Computation - Purdue Universityshalaev/ECE_695... · Timeline of Quantum Computing •1980s –Benioff, Manin, Feynman and Deutsch •1994 –Shor’s Algorithm

WhatisTopology?

• 2016NobelPrizeinPhysics• Toplogy:Inmath,describesapropertythatremainsunchangedundersmoothcontinuousdeformation

Topologicalinvariance:Tochangethetopologicalstate,alargeperturbationmakinganotherholeisrequired