Quantum Computing Our journey so far Henry Yuen Assistant - - PowerPoint PPT Presentation

▶
quantum computing
SMART_READER_LITE
LIVE PREVIEW

Quantum Computing Our journey so far Henry Yuen Assistant - - PowerPoint PPT Presentation

Dec 15, 2023 299 likes •695 views

Quantum Computing Our journey so far Henry Yuen Assistant Professor of Computer Science and Mathematics University of Toronto Quantum mechanics is weird Uncertainty principle Wave/particle duality Superposition Quantum mechanics governs

slide-1
SLIDE 1

Quantum Computing

Our journey so far

Henry Yuen

Assistant Professor

  • f Computer Science and Mathematics

University of Toronto

slide-2
SLIDE 2
slide-3
SLIDE 3

Quantum mechanics is weird

Uncertainty principle Wave/particle duality Superposition

slide-4
SLIDE 4

Quantum mechanics governs everything from the mundane…

…to exotic physical phenomena

Photosynthesis Protein folding Superconductivity Superfluidity

slide-5
SLIDE 5

Richard Feynman (1982): Q: Can a computer simulate this? A: Not very easily!

slide-6
SLIDE 6

Classical computer

1

Bit

slide-7
SLIDE 7

Classical computer

1

Classical bit

0 1 0 0 1 1

slide-8
SLIDE 8

Qubit

slide-9
SLIDE 9

Qubit

slide-10
SLIDE 10

Qubit

slide-11
SLIDE 11

Qubit

1

slide-12
SLIDE 12

Qubit

slide-13
SLIDE 13

Qubit

slide-14
SLIDE 14

Qubit

slide-15
SLIDE 15

Qubit

slide-16
SLIDE 16
slide-17
SLIDE 17
slide-18
SLIDE 18

1

slide-19
SLIDE 19

1

The whole is greater than the sum of its parts! 3 qubits: requires 8x3 = 24 classical bits N qubits: requires at least 2N classical bits!

slide-20
SLIDE 20

We need a new kind of computer!

slide-21
SLIDE 21

What can a quantum computer do?

slide-22
SLIDE 22

Simulating quantum physics, of course!

slide-23
SLIDE 23

Example: Artificial nitrogen fixation for fertilizer production (i.e. Haber process) Consumes > 1% of world’s energy output.

Quantum computers could speed up

  • finding more efficient reaction

pathways

  • develop exotic materials
  • drug design
slide-24
SLIDE 24

P = 15904 Q = 93520 P × Q = 1487342080

slide-25
SLIDE 25

P × Q = 597680597 P = 17449 Q = 34253

slide-26
SLIDE 26

Peter Shor (1994): quantum computers can factor large numbers very quickly!

1977 - 1994 Diffie- Hellman 1977 – 1994 RSA

slide-27
SLIDE 27

Crossroads

Since Shor’s algorithm, physicists and computer scientists have been faced with three options: 1. Quantum mechanics is wrong.

  • 2. There is a fast classical algorithm for factoring.
  • 3. Quantum computers are more powerful than classical

computers.

At least one of these must be true!

slide-28
SLIDE 28

Public Service Announcement

slide-29
SLIDE 29

Myth: Quantum computers solve things by trying every possibility at

  • nce.
slide-30
SLIDE 30

Fact: Quantum computers can solve certain types of problems faster via interference patterns.

slide-31
SLIDE 31

Myth: Quantum computers can solve the traveling salesman problem quickly.

slide-32
SLIDE 32

Fact: Quantum computers probably cannot solve TSP quickly.

slide-33
SLIDE 33

Quantum computing today

slide-34
SLIDE 34

The big questions

  • How will we scale up quantum computers to

millions of qubits?

  • Are small-scale, rudimentary quantum

computers useful for anything?

  • What kinds of problems are quantum computers

good at solving?

  • What can quantum computing tell us

about nature?

slide-35
SLIDE 35

Quantum Machine Learning?

ML for classical data ML for quantum data

slide-36
SLIDE 36

Quantum Computing

Condensed Matter Physics

Chemistry Mathematics

Quantum gravity String theory

Computer Science Physics

Quantum Field Theory Statistics Operator algebras Number theory Representation theory Algebraic geometry Algorithms Complexity theory Cryptography Machine learning Information theory Quantum chemistry simulations Fermionic encoding methods Optimization Chemical dynamics

Engineering

Key distribution Quantum networks Quantum enhanced sensing

slide-37
SLIDE 37

We’re in the early days of quantum computing.

=

Uncharted territory

Thanks!