<<

Schrödinger Cats, Maxwell’s Demon and Error Correction

Experiment SMG Luigi Frunzio Liang Jiang Rob Schoelkopf Leonid Glazman M. Mirrahimi ** Andrei Petrenko Nissim Ofek Shruti Puri Reinier Heeres Yaxing Zhang Philip Reinhold Victor Albert** Yehan Liu Kjungjoo Noh** Zaki Leghtas Richard Brierley Brian Vlastakis Claudia De Grandi +….. Zaki Leghtas Juha Salmilehto Matti Silveri Uri Vool Huaixui Zheng Marios Michael +….. QuantumInstitute.yale.edu

1 Quantum Science , , theory, Networks, Systems, Ultra-high-speed digital, analog, Programming languages, electronics, FPGA Electrical Engineering Science QIS Applied Quantum Physics Chemistry Quantum , Quantum , Circuit QED,

http://quantuminstitute.yale.edu/ 2 Is carried by waves or by particles?

YES!

3 Is quantum information analog or digital?

YES!

4 Quantum information is digital:

Energy levels of a quantum system are discrete.

We use only the lowest two.

Measurement of the state of a yields (only) 1 classical of information. 4 3 2 1 =e = ↑ 1 0 } 0 =g = ↓

5 Quantum information is analog:

A quantum system with two distinct states can exist in an Infinite number of physical states (‘superpositions’) intermediate between ↓ and ↑ .

Bug: We are uncertain which state the bit is in. Measurement results are truly random.

Feature: Qubit is in both states at once, so we can do parallel processing. Potential exponential speed up. 6 Quantum is a New Paradigm

: a completely new way to store and process information.

• Superposition: each quantum bit can be BOTH a zero and a one.

• Entanglement: can have non-classical correlations. (Einstein: ‘Spooky action at a distance.’)

• Massive parallelism: carry out that are impossible on ANY conventional computer. Daily routine engineering and calibration test: Carry out spooky operations that Einstein said were impossible!

7 Register of N conventional bits can be in 1 of 2N states.

000, 001, 010, 011, 100, 101, 110, 111 Register of NThe quantum Power of bits Quantum can be Information in an arbitrary superposition of 2N states

N Just this set of different superpositions represents ~ 22 states! Ψ~ 000 ±±±±±±± 001 010 011 100 101 110 111

Even a small quantum computer of 50 will be so powerful its operation would be difficult to simulate on a conventional .

Quantum are good for problems that have simple input and simple output but must explore a large space of states at intermediate stages of the calculation.

8 Applications of Quantum Computing

Solving the Schrödinger Eqn. (even with fermions!)

Quantum Quantum materials chemistry

Machine learning* and *read the fine print Privacy Enhancement

9 Storing information in quantum states sounds great…,

but how on earth do you build a quantum computer?

10 ATOM vs CIRCUIT

Hydrogen atom Superconducting circuit oscillator

L C

10−7 mm 0.1 - 1 mm (Not to scale!) 1 ~ 1012 ‘Artificial atom’

11 How to Build a Qubit with an Artificial Atom…

Superconducting T = 0.01 K integrated circuits are a promising technology for scalable quantum computing

Josephson junction: 200 nm Aluminum/AlOx/Aluminum The “ of quantum computing”

Provides anharmonic structure AlOx tunnel barrier (like an atom)

12 Qubit Antenna pads are plates ωω01≠ 12 ω Josephson 12 1 = e tunnel ω junction Energy 01 0 = g ~1 mm

ω01 ~ 5− 10 GHz

1012 mobile electrons gaps out single-particle excitations Quantized energy level spectrum is simpler than

Quality factor QT = ω 1 comparable to that of hydrogen 1s-2p Enormous : ultra-strong coupling to microwave “Circuit QED” 13 The first electronic quantum (2009) was based on ‘Circuit QED’

Executed Deutsch-Josza and Grover search

Lithographically produced with replaced by superconductors.

Michel Rob Devoret Schoelkopf

DiCarlo et al., Nature 460, 240 (2009) 14 The huge information content of quantum superpositions

comes with a price:

Great sensitivity to noise perturbations and dissipation.

The quantum phase of superposition states is well-defined only for a finite ‘ time’ T 2

Despite this sensitivity, we have made exponential progress in qubit coherence times. 15 Cat Code Exponential Growth in QEC 3D multi-mode SC Qubit Coherence “Moore’s Law” for T2 cavity several groups 100-200 us (Delft, IBM, MIT, Yale, …)

lowest thresholds for NIST/IBM, Yale, ...

MIT-LL Nb Trilayer

Oliver & Welander, MRS Bulletin (2013) R. Schoelkopf and M. Devoret 16 Girvin’s Law:

There is no such thing as too much coherence.

We need quantum error correction!

17 The Quantum Error Correction Problem

I am going to give you an unknown .

If you measure it, it will change randomly due to state collapse (‘back action’).

If it develops an error, please fix it.

Mirable dictu: It can be done!

18 Quantum Error Correction for an unknown state requires storing the quantum information non-locally in (non- classical) correlations over multiple physical qubits. ‘Logical’ qubit ‘Physical’ qubits ‘Physical’ N

Non-locality: No single physical qubit can “know” the state of the logical qubit. 19 Quantum Error Correction

‘Logical’ qubit Cold bath

Entropy ‘Physical’ qubits ‘Physical’ Maxwell N Demon

N qubits have errors N times faster. Maxwell demon must overcome this factor of N – and not introduce errors of its own! (or at least not uncorrectable errors) 20 1. Quantum Information

2. Quantum Measurements

3. Quantum Error Heralding

4. Quantum Error Correction

21 1. Quantum Information

2. Quantum Measurements

3. Quantum Error Heralding

4. Quantum Error Correction

22 Quantum information is analog:

A quantum system with two distinct states can exist in an Infinite number of physical states (‘superpositions’) intermediate between ↓ and ↑ .

θθiϕ  ψ = cos↓+e sin  ↑ 22 

θ = latitude ENERGY STATE ↑ 4 ϕ = longitude 3 2 State defined by ‘ 1 polarization vector’ 0 } STATE ↓ on 23 Quantum information is analog/digital:

Equivalently: a quantum bit is like a classical bit except there are an infinite number of encodings (aka ‘ axes’). Z = ±1 Z′ = ±1 If Alice gives Bob a Z = + 1, Bob measures: θ ZP′ = +1 with = cos2 + 2 θ ZP′ = −1 with probability = sin2 − 2 ‘Back action’ of Bob’s Alice Bob measurement changes the state, but it is

invisible to Bob. 24 1. Quantum Information

2. Quantum Measurements

3. Quantum Error Heralding

4. Quantum Error Correction

25 What is knowable?

Z Consider just 4 states:

X

We are allowed to ask only one of two possible questions:

Does the spin lie along the Z axis? Answer is always yes! (± 1) Does the spin lie along the X axis? Answer is always yes! (± 1)

BUT WE CANNOT ASK BOTH!

Z and X are INCOMPATIBLE 26 What is knowable?

We are allowed to ask only one of two possible questions:

Does the spin lie along the Z axis? Answer is always yes! (± 1) Does the spin lie along the X axis? Answer is always yes! (± 1)

BUT WE CANNOT ASK BOTH! Z and X are INCOMPATIBLE OBSERVABLES

Heisenberg

If you know the answer to the Z question you cannot know the answer to the X question and vice versa.

(If you know position you cannot know .) 27 Measurements 1.

Result: quantum state State: Z is unaffected.

measurement

State: X Result: ± 1 randomly! State is changed by measurement measurement to lie along X axis. Unpredictable result

28 Measurements 2.

Result: quantum state State: X is unaffected.

measurement

State: Z Result: ± 1 randomly! State is changed by measurement measurement to lie along Z axis. Unpredictable result

29 No Cloning Theorem

Given an unknown quantum state, it is impossible to make multiple copies

Unknown state:

X

Guess which measurement to make ---if you guess wrong you change the state and you have no way of knowing if you did….

30 No Cloning Theorem

Given an unknown quantum state, it is impossible to make multiple copies

Big Problem:

Classical error correction is based on cloning! (or at least on measuring) 0 → 000 Replication code: 11→11

Majority Rule voting corrects single bit flip errors.

31 1. Quantum Information

2. Quantum Measurements

3. Quantum Error Heralding

4. Quantum Error Correction

32 Let’s start with classical error heralding Classical duplication code: 0 →→00 1 11

Herald error if bits do not match.

In Out # of Errors Probability Herald?

00 00 0 (1− p ) 2 Yes 00 01 1 (1− ) Yes 00 10 1 (1− pp ) Yes 00 11 2 p2 Fail

And similarly for 11 input. 33 Using duplicate bits: -lowers channel bandwidth by factor of 2 (bad) -lowers the fidelity from (1-pp ) to (1- )2 (bad) -improves unheralded error rate from pp to 2 (good)

In Out # of Errors Probability Herald?

00 00 0 (1− p ) 2 Yes 00 01 1 (1− pp ) Yes 00 10 1 (1− pp ) Yes 00 11 2 p2 Fail

And similarly for 11 input. 34 Quantum Duplication Code

35 No cloning prevents duplication

U αβ↓↑↓+⊗=+⊗+ αβ ↓↑ αβ ↓↑ (      )  ( ) ( )

Unknown quantum state Ancilla initialized to ground state

Proof of no-cloning theorem: αβ and are unknown; Hence U cannot depend on them. No such unitary can exist if QM is linear. Q.E. D .

36 Don’t clone – entangle!

U αβ↓+ ↑ ⊗= ↓ α ↓↓ + β ↑↑ (      ) 

Unknown quantum state Ancilla initialized to ground state

Quantum circuit notation:

αβ↓ + ↑ U = CNOT αβ↓↓+ ↑↑ ↓ 37 Heralding Quantum Errors

Z12, Z = ±1

Measure the Π = Z Z Joint : 12 1 2

Π12 ↑↑= + ↑↑

Π12 ↓↓= + ↓↓

Π12 ↑↓= − ↑↓

Π↓12 ↑ = − ↓↑

Π12 (αβ ↓↓++ ↑↑) = +( αβ↓↓ ↑↑)

Π12 = −1 heralds single bit flip errors 38 Heralding Quantum Errors

Π12= Z 1Z 2

Not easy to measure a joint operator while not accidentally measuring individual operators!

(Typical ‘natural’ coupling is M Z = Z 12 + Z )

↑↑ and ↓↓ are very different, yet we must make that difference invisible

But it can be done if you know the right experimentalists... 39 Heralding Quantum Errors

Example of error heralding:

Ψ=αβ ↓↓+ ↑↑ Introduce single qubit error on 1 (over rotation, say) θ i X1 θθ e 2 Ψ=cos Ψ+i sin X Ψ 221 Relative weight of αβ , is untouched. θ Probability of error: sin2 2 If no error is heralded, state collapses to Ψ and there is no error!

40 Heralding Quantum Errors

Example of error heralding: Ψ=αβ ↓↓+ ↑↑ Introduce single qubit rotation error on 1 (say) θ i X1 θθ e 2 Ψ=cos Ψ+Ψi sin X 221 Relative weight of αβ , is untouched. θ Probability of error: sin 2 2

If error is heralded, state collapses to X1 Ψ and there is a full bitflip error. We cannot correct it because we don't know which qubit flipped. 41 Heralding Quantum Errors

Quantum errors are continuous (analog!).

But the detector result is discrete.

The measurement back action renders the error discrete (digital!) – either no error or full bit flip.

42 1. Quantum Information

2. Quantum Measurements

3. Quantum Error Heralding

4. Quantum Error Correction

43 Correcting Quantum Errors

Extension to 3-qubit code allows full correction of bit-flip errors Ψ=αβ ↓↓↓+ ↑↑↑

Π12= ZZ 1ZZ 2 and Π322= 3

Provide two classical bits of information to diagnose and correct all 4 possible bit-flip errors:

IX, 123, X, X

44 Correcting Quantum Errors

Joint parity measurements provide two classical bits of information to diagnose and correct all 4 possible bit-flip errors:

Ψ=αβ ↓↓↓+ ↑↑↑

Error Z1Z2 Z2Z3

I +1 +1

X1 -1 -1

X2 -1 -1

X3 +1 -1

45 Correcting Quantum Errors Extension to 5,7,or 9-qubit code allows full correction of ALL single qubit errors

I (no error)

X1 ,...,X N (single bit flip)

ZZ1,...,N (single phase flip; no classical analog)

YY1,...,N (single bit AND phase flip; no classical analog)

For N=5, there are 16 errors and 32 states

32= 16 x 2

Just enough room to encode which error occurred and still have one qubit left to hold the quantum

information. 46 Full – Arbitrary Errors

Single round of error correction

6 ancillae

7 qubits Quantum Error Correction

‘Logical’ qubit Cold bath

Entropy ‘Physical’ qubits ‘Physical’ Maxwell N Demon

N qubits have errors N times faster. Maxwell demon must overcome this factor of N – and not introduce errors of its own! (or at least not uncorrectable errors) 48 All previous attempts to overcome the factor of N and reach the ‘break even’ point of QEC have failed.

Lecture 2 will describe first QEC to reach break even.

49 Are We There Yet?

“Age of Qu. Error Correction.”

“Age of Quantum Feedback”

“Age of Measurement”

“Age of Entanglement”

“Age of Coherence”

Goal of next stage: reaching “break-even” point for error correction “We” are ~ here (also ions, Rydbergs, q-dots, …)

M. Devoret and RS, Science (2013)