quantum computing - mit lincoln laboratory eventsquantum computing - 4 ead 03/05/18 computation vs....

11
Quantum Computing Dr. Eric Dauler MIT Lincoln Laboratory 5 March 2018 The Future of Advanced (Secure) Computing This material is based upon work supported by the Assistant Secretary of Defense for Research and Engineering and the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via Air Force Contract FA8721-05-C- 0002 and/or FA8702-15-D-0001. Any opinions, findings, conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of ODNI, IARPA, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Distribution Statement A: Approved for public release: distribution unlimited. © 2018 Massachusetts Institute of Technology. Delivered to the U.S. Government with Unlimited Rights, as defined in DFARS Part 252.227-7013 or 7014 (Feb 2014). Notwithstanding any copyright notice, U.S. Government rights in this work are defined by DFARS 252.227-7013 or DFARS 252.227-7014 as detailed above. Use of this work other than as specifically authorized by the U.S. Government may violate any copyrights that exist in this work.

Upload: others

Post on 22-Jul-2020

0 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing

Dr. Eric Dauler

MIT Lincoln Laboratory

5 March 2018

The Future of Advanced (Secure) Computing

This material is based upon work supported by the Assistant Secretary of Defense for Research and Engineering and the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via Air Force Contract FA8721-05-C-0002 and/or FA8702-15-D-0001. Any opinions, findings, conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of ODNI, IARPA, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon.

Distribution Statement A: Approved for public release: distribution unlimited.

© 2018 Massachusetts Institute of Technology.

Delivered to the U.S. Government with Unlimited Rights, as defined in DFARS Part 252.227-7013 or 7014 (Feb 2014). Notwithstanding any copyright notice, U.S. Government rights in this work are defined by DFARS 252.227-7013 or DFARS 252.227-7014 as detailed above. Use of this work other than as specifically authorized by the U.S. Government may violate any copyrights that exist in this work.

Page 2: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 2EAD 03/05/18

Historical Perspective on Computing

Classical (Electronic) Computing

First vacuum tube

(1907)

ENIAC

(1946)

First fully transistor-based computer: TX-0

(1953)

Transistor invented

(1947)

4.5M transistors: Pentium(1998)

30k transistors: i8088(1971)

15B transistors: GP100(2016)

Quantum Computing

Quantum computer proposed

(1981)

Shor’s algorithmdeveloped

(1994)

Several to tens of quantum bits manipulated

(2010–18)

Ions

SC qubits

Richard Feynman

Progress on both quantum computing algorithms and hardware is supporting the exploration and

development of a revolutionary approach to information processing

Page 3: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 3EAD 03/05/18

Quantum Computing Applications

Quantum computing algorithms and applications continue to expand

Configuration

Co

st QuantumTunneling

ThermalJump

Linear Algebra (HHL) Optimization

Search and Database (Grover)Molecular and Material Simulations

Exponential speed-up is possible with continued progress on efficient data loading for large matrices

Quantum annealing may improve optimization with

a faster time to more diverse and optimal solutions

Offers a polynomial speed-up that is useful within other quantum algorithms or with efficient data loading

Accurate simulation of molecular and material properties that are poorly approximated by classical methods

Page 4: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 4EAD 03/05/18

Computation vs. Optimization(Quantum Computing vs. Annealing)

From among manysolutions, find:

those with highestpossible quality

Solve a problemdeterministically to find:

its unique solution

Computation

Optimization

Classical Quantumvs.

Titan supercomputer

Quantum Computing

Trapped ion qubits(MIT LL and

Prof. Chuang/Ram)

Superconducting qubits(MIT LL and

Prof. Oliver/Orlando)

Quantum Annealing

Monte-Carlooptimization

vs.

Digitalcomputing

Proven exponentialspeed-up over classical

for few problems

e.g., Shor’s integer factoring algorithm

Computational powervirtually unknown

Quantum fault-tolerance protocolscan suppress decoherence

Requirements on qubits appearto be substantially less

Initial work by D-Wave Systems hasled to efforts by Google and IARPA

Page 5: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 5EAD 03/05/18

Qubit Modalities

1.E+00

1.E+01

1.E+02

1.E+03

1.E+04

1.E+05

1.E+06

1.E+02 1.E+03 1.E+04 1.E+05 1.E+06 1.E+07 1.E+08 1.E+09

Series1

Gate Speed (Hz)

Figu

re o

f M

eri

t: C

oh

ere

nce

Tim

e/G

ate

Tim

e

Nuclear Spin in Silicon

Ensemble NMR

Optical Quantum Dot

Trapped Ion

Neutral Atoms

Viable qubit for scaling

Not yet demonstrated to be viable

Lowest thresholdfor quantum error correction

Electron Spin in Silicon

Solid State Quantum Dots

NV-Centers in Diamond

Superconducting Qubits

BestPerformanceTrapped-Ion Qubit

Gate time: 10–100 msCoherence time: 1–50 s

Gate time: 10 nsCoherence time: 100 ms

Superconducting Qubit

1 mm

|𝟎 = |𝟏 =| |

Page 6: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 6EAD 03/05/18

Quantum Computing Experiments

Superconducting qubits in a dilution refrigerator

Trapped ions on an optical table

Superconducting Qubits Trapped Ion Qubits

Classical control signals are used to initialize, manipulate, and measure qubits

Qubits must be sufficiently isolated from the classical environment, noise…

Page 7: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 7EAD 03/05/18

Superconducting Qubits

• Manufactured/designed “atoms”

• Planar fabrication

• RF and microwave control

• 100 MHz gate operations

• “Moore’s Law” for coherence times

Oliver & Welander, MRS Bulletin (2013)

Blue: MIT & LL

Lowest thresholds

for error correction

Several groups 50–150 ms

(Delft, IBM, Google, MIT, NIST, Yale, …)

MIT and Lincoln Laboratory are at the forefront

of superconducting qubit materials, fabrication, design,

and extensible 3D integration

Page 8: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 8EAD 03/05/18

Through-substrate via

(TSV)

High-Q metal

TSV

Qubit

Technologies for 3D Integration of Superconducting Qubits

Three-Layer stack architecture with separate qubit and I/O layers

separated by a TSV chip

Traveling wave parametric amplifiers

(TWPAs)

Silicon substrate

Superconducting bumps

Readout amplifiers and passive routing

Through-substrate

vias

Increase qubit coherence (unchanged by introducing

additional layer)

I/O and RO

Page 9: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 9EAD 03/05/18

Trapped Ion Qubits

• Electronic states of ionized atoms

• RF trapping, optical control

• Coupling via Coulomb interaction

• 100 kHz gate times

• High-fidelity preparation, control, and readout (99.9%–99.999%)

Lincoln Surface-Electrode Chip Traps

Array trapLinear trap

MIT and Lincoln Laboratory are leaders in developing integrated technologies

for quantum control of trapped ions

Page 10: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 10EAD 03/05/18

Trapped-Ion Quantum Processor

Page 11: Quantum Computing - MIT Lincoln Laboratory EventsQuantum Computing - 4 EAD 03/05/18 Computation vs. Optimization (Quantum Computing vs. Annealing) From among many solutions, find:

Quantum Computing - 11EAD 03/05/18

Collaboration Opportunities

• Challenging scientific and fundamental engineering questions remain to be addressed:

– Spans many academic domains: material science, solid-state and atomic physics, electrical engineering, mathematics, and computer science

– Collaborations and internships are important to addressing these key research challenges

• Progress is also enabled by specialized research infrastructure:

– Test equipment and electronics

– Software tools for experimental control, modeling, and simulation