demonstration of two-qubit algorithms with a ... · demonstration of two-qubit algorithms with a...

29
Demonstration of two-qubit algorithms with a superconducting quantum processor Elisa Wall and Sajanth Subramaniam ETH Zürich Spring Semester 2018

Upload: others

Post on 21-Aug-2020

11 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Demonstration of two-qubit algorithms with a superconducting quantum processor

Elisa Wall and Sajanth SubramaniamETH Zürich

Spring Semester 2018

Page 2: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Introduction

Requirements and tasks of a Quantum Processor:

Page 3: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Introduction

Requirements and tasks of a Quantum Processor:• State Preparation

Page 4: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Introduction

Requirements and tasks of a Quantum Processor:• State Preparation

• Long coherence time

Page 5: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Introduction

Requirements and tasks of a Quantum Processor:• State Preparation

• Long coherence time• Universal Gate operations

Page 6: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Introduction

Requirements and tasks of a Quantum Processor:• State Preparation

• Long coherence time• Universal Gate operations• Read out of qubits

Page 7: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

First solid-state quantum processor

L.DiCarlo et al.

Page 8: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Overview

Two – qubit interaction via

cavity

Avoided crossing Conditional phase gate

Quantum algorithms

Page 9: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Chip design• Two transmon qubits QL and QR

• Voltages VL and VR used to tune qubittransition frequencies fL and fR via generatedflux Φ𝐿𝐿,𝑅𝑅:

where Φ0 is the flux quantum

• Qubits coupled to a microwave cavity, letting qubits couple via virtual photon exchange

• Read-out via homodyne detection

L.Dicarlo et al.

Page 10: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Avoided Crossing in the Cavity

For single atom in cavity we have according to Cavity QED:

Jaynes – Cummings Hamiltonian

For we get the (unnormalized) Eigenstates:

wikimedia

Dressed states

Page 11: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Avoided Crossing in the Cavity

Jaynes – Cummings Hamiltonian

with

In general:

Rabi splitting

Qubit Frequency

Ener

gy

For single atom in cavity we have according to Cavity QED:

For we get :

Page 12: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Avoided Crossing between Qubits

For two transmon qubits in a cavity we have in the dispersive limit

an additional effective interaction term (in second order pertubation) 1,2:

1. A. Blais et al.,»Quantum-information processing with circuit quantum electrodynamics » Phys. Rev. A 75, 032329 (2007)2. J.Majer et al. , » Coupling Superconducting Qubits via a Cavity Bus », arXiv:0709.2135v1 (2007)

Coupling between the cubits via virtual photons in the cavity1

Avoided crossing between frequencies near

Page 13: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Single Qubit Spectroscopy

L.DiCarlo et al.

Point I:sweet spot of strong dispersiveness:a) state preparationb) single qubit rotations andc) measurements

Point II:working point to get to two-bit gates as conditional phase gate

Point IV:𝑄𝑄𝑅𝑅 tuned in resonance with cavity get qubit-cavity interaction strength g

Point III:𝑄𝑄𝑅𝑅 tuned in resonance with 𝑄𝑄𝐿𝐿 get qubit-qubit transverse interaction strength J

Page 14: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Single and Two-Excitation Spectrum

L.DiCarlo et al.

L.DiCarlo et al.

Page 15: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Dynamic Phase

Qubit wavefunction accumulates phase when undergoing frequency change over time

with being deviation from the qubit frequency at point I

Page 16: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Realization of a C-Phase Gate• Cavity mediated interaction results in lowering of

frequency w.r.t. sum of and :

• This phase shift is due to the avoided crossing• We can use adiabatic flux pulses produce phase gates via

by varying with deviationfrom its frequency value at starting point I

• For 𝜙𝜙01: varying the rise and fall of the 𝑉𝑉𝑅𝑅 pulse• For 𝜙𝜙10: varying the amplitude of a simultaneous

weak 𝑉𝑉𝐿𝐿 pulse• For 𝜙𝜙11 :

L.DiCarlo et al.

Page 17: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

• Aim: generating phase gates by creating all even and only one odd multiple of 𝜋𝜋 in the phases

• Example: Can implement a conditional phase gate (C-Phase gate 𝑐𝑐𝑐𝑐11) by adjusting 𝜙𝜙01 and 𝜙𝜙10 to zero and

L.DiCarlo et al.

Realization of a C-Phase Gate

Page 18: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Creating Bell states

.

Single qubit gates• via microwave pulses resonant with 𝜔𝜔𝐿𝐿,𝑅𝑅

Conditional phase gates cU:

Example: Creating the first Bell state

Page 19: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Creating Bell states

.

Single qubit gates• via microwave pulses resonant with 𝜔𝜔𝐿𝐿,𝑅𝑅

Conditional phase gates cU:

Analogously create other three Bell states with 𝑐𝑐𝑐𝑐𝑖𝑖𝑖𝑖:

Page 20: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Read-Out process: Joint Dispersive Readout

• State tomography:• Constructing the 16 entries of maximum likelihood density matrix 𝜌𝜌𝑚𝑚𝑚𝑚

• Turning into measurement basis

• Pulsed measurement of VH yields following measurement operator1

where the |𝛽𝛽𝑖𝑖| are of comparable magnitude when operating in dispersive regime

• Complete set of 15 linear independent operators

• Generating ensemble average by executing sequence 450’000 times

1. Filipp, S. et al. “Two-qubit state tomography using a joint dispersive read-out”. arXiv:cond-mat/0812.2485(2008(

Page 21: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Read-Out: Evaluation of 𝜌𝜌

• Concurrence C• (≡ degree of entanglement) • Maximally entangled for C = 1.0, highest eigenvalue 𝜆𝜆1 of

density matrix

• Purity P• (≡ degree of mixture)

• Fidelity F• (≡ degree of agreement with expected result )

Page 22: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Read-Out of Bell states

• Averaging real part of maximum-likelihood of density matrix 𝜌𝜌𝑚𝑚𝑚𝑚

• Concurrence ≈ 0.81 - 0.94

• Purity ≈ 0.79 - 0.92

• Fidelity to ideal Bell state ≈ 0.87 - 0.94

Page 23: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Algo: Grover’s search

• Aim: finding 𝑥𝑥0 element of computational basis• Classically: 𝑂𝑂(𝑁𝑁), QM: O( 𝑁𝑁)

• Oracle:

• b) – e) Creating Bell state• f) Undoing entanglement with 𝑐𝑐𝑐𝑐00• g) Output state

One iteration over Grovers algorithm:

Page 24: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Algos: Deutsch- Josza Algo

• Aim: find out whether unknown function isconstant [𝑓𝑓0 𝑥𝑥 = 0 (𝑏𝑏) 𝑜𝑜𝑜𝑜 𝑓𝑓1 = 1 (c)]or balanced [𝑓𝑓2 𝑥𝑥 = 𝑥𝑥 (𝑑𝑑) 𝑜𝑜𝑜𝑜 𝑓𝑓3 = 1 − 𝑥𝑥 (e) ]

• Classically: 𝑁𝑁2

+ 1 calls of 𝑓𝑓(𝑥𝑥), QM: one call of 𝑓𝑓(𝑥𝑥)

• Oracle:

• Encoding result in final state of 𝑄𝑄𝐿𝐿 , while leaving 𝑄𝑄𝑅𝑅 untouched• Only and no should be output, and corresponds

to constant and to balanced input function 𝑓𝑓(𝑥𝑥)

Page 25: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Fidelities of Algorithms

Fidelities of Grovers output ≈ 0.80 - 0.82Fidelities of Deutsch-Josza output ≈ 0.84 – 0.93

Page 26: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Performance and Outlook

DiVincenzo's criteria:

• The ability to initialize the state of the qubits to a simple fiducial state.

• Long relevant decoherence times.

• A “universal” set of quantum gates.

• A qubit-specific measurement capability.

• A scalable physical system with well characterized qubits

David P. DiVincenzo, «The Physical Implementation of Quantum Computation», arXiv:quant-ph/0002077 (2000)

Conditional phase gate ( together with one qubit gates) is universal

~ 1 micro second coherence time; allowing for ~10 sucessive gates

Presented two-qubit device:

Dispersive read-out

Via timed pulses with frequncies fL or fR

Problems with scalabitily

Page 27: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Performance and Outlook

Tunable qubits Fixed qubits

• Fast multi-qubit interactions

• Minimal residual coupling

• Flux noise decoherence

• Computational basis leakage

• High coherence time

• Frequency crowding

Negative effects worsen when scaling up the system!

Possible solution: Periodic modulation of qubit frequencies

Page 28: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Performance and Outlook

Page 29: Demonstration of two-qubit algorithms with a ... · Demonstration of two-qubit algorithms with a superconducting quantum processor. Elisa Wall and Sajanth Subramaniam. ETH Zürich

Performance and Outlook

Tunable two-qubit processor (entangler):

Parametric approach: IBM QX4*(5 Qubits):

Two-qubit gate fidelity

*https://quantumcomputingreport.com/scorecards/qubit-quality/