Summary: Types of Error

Similar documents
Single-Mode Displacement Sensor

Quantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction

Analog quantum error correction with encoding a qubit into an oscillator

Lectures on Fault-Tolerant Quantum Computation

More advanced codes 0 1 ( , 1 1 (

IBM Systems for Cognitive Solutions

Introduction to Quantum Information Technologies. B.M. Terhal, JARA-IQI, RWTH Aachen University & Forschungszentrum Jülich

Quantum Computing with Very Noisy Gates

Introduction to Quantum Error Correction

Logical error rate in the Pauli twirling approximation

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Driving Qubit Transitions in J-C Hamiltonian

Prospects for Superconducting Qubits David DiVincenzo QIP Beijing

Supplementary information for Quantum delayed-choice experiment with a beam splitter in a quantum superposition

Fault-Tolerant Universality from Fault-Tolerant Stabilizer Operations and Noisy Ancillas

6. Quantum error correcting codes

Quantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto

Non-Zero Syndromes and Syndrome Measurement Order for the [[7,1,3]] Quantum Error Correction Code

Experimental Quantum Computing: A technology overview

arxiv: v5 [quant-ph] 28 Jan 2015

high thresholds in two dimensions

How Often Must We Apply Syndrome Measurements?

From Majorana Fermions to Topological Order

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

Parity-Protected Josephson Qubits

arxiv: v2 [quant-ph] 18 Aug 2016

Requirements for scaleable QIP

CSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem

P 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0

Quantum non-demolition measurements:

Performance Requirements of a Quantum Computer Using Surface Code Error Correction

arxiv:quant-ph/ v3 3 Nov 2006

Remote entanglement of transmon qubits

Electrical quantum engineering with superconducting circuits

Dynamically protected cat-qubits: a new paradigm for universal quantum computation

Decodiy for surface. Quantum Error Correction. path integral. theory versus. Decoding for GKP code. experiment. Correcting

SUPPLEMENTARY INFORMATION

10.5 Circuit quantum electrodynamics

Quantum computers still work with 25% of their qubits missing

John Preskill, Caltech 14 January The cost of quantum fault tolerance

Fault-tolerant quantum computing with color codes Andrew J. Landahl with Jonas T. Anderson and Patrick R. Rice. arxiv:

X row 1 X row 2, X row 2 X row 3, Z col 1 Z col 2, Z col 2 Z col 3,

arxiv: v2 [quant-ph] 15 Oct 2018

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.

IBM quantum experience: Experimental implementations, scope, and limitations

Techniques for fault-tolerant quantum error correction

Introduction to Topological Error Correction and Computation. James R. Wootton Universität Basel

arxiv: Statistical mechanical models for quantum codes subject to correlated noise

QUANTUM COMPUTER ARCHITECTURE FOR FAST ENTROPY EXTRACTION

Quantum Computation with Neutral Atoms

Quantum Computer Architecture

Measurement-based quantum error correction

arxiv: v1 [quant-ph] 6 Dec 2013

arxiv:quant-ph/ v3 26 Aug 1997

Circuit Quantum Electrodynamics. Mark David Jenkins Martes cúantico, February 25th, 2014

Surface Code Threshold in the Presence of Correlated Errors

sparse codes from quantum circuits

arxiv:quant-ph/ v1 18 Apr 2000

Logical Quantum Computing. Sarah Sheldon, IBM T.J. Watson Research Center

Magic States. Presented by Nathan Babcock

Quantum computation and quantum information

What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.

Postselection threshold against biased noise (A probabilistic mixing lemma and quantum fault tolerance) Ben W. Reichardt Caltech

Instantaneous Nonlocal Measurements

Mesoscopic field state superpositions in Cavity QED: present status and perspectives

Quantum error correction for continuously detected errors

D.5 Quantum error correction

arxiv:quant-ph/ v1 14 Aug 2006

Exploring the quantum dynamics of atoms and photons in cavities. Serge Haroche, ENS and Collège de France, Paris

Synthesizing arbitrary photon states in a superconducting resonator

Energetics and Error Rates of Self-Correcting Quantum Memories

A Heterogeneous Quantum Computer Architecture

Optimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit

Quantum Optics with Electrical Circuits: Circuit QED

arxiv: v2 [quant-ph] 10 Oct 2017

THE ABC OF COLOR CODES

Quantum Reservoir Engineering

Q uantum computers1,2 are expected to outperform current classical computers. Many problems intractable

Of course, what is amazing about Kitaev's scheme is the claim that Z and controlled Z gates can be protected!

A Simple Model of Quantum Trajectories. Todd A. Brun University of Southern California

Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles

Quantum Simulation with Rydberg Atoms

Dissipation in Transmon

Lecture 6: Quantum error correction and quantum capacity

Towards Scalable Linear-Optical Quantum Computers

Threshold theorem for quantum supremacy arxiv:

THEORY SMG, L. Glazman, Liang Jiang. EXPERIMENT Rob Schoelkopf, Michel Devoret Luigi Frunzio. Simon Nigg M. Mirrahimi Z. Leghtas

arxiv: v1 [quant-ph] 15 Oct 2010

arxiv:quant-ph/ v3 19 May 1997

Topological quantum computation

b) (5 points) Give a simple quantum circuit that transforms the state

Prospects for Superconducting Qubits. David DiVincenzo Varenna Course CLXXXIII

arxiv: v3 [quant-ph] 21 Feb 2013

Experimental Realization of Shor s Quantum Factoring Algorithm

arxiv: v2 [quant-ph] 19 Sep 2016

M. Grassl, Grundlagen der Quantenfehlerkorrektur, Universität Innsbruck, WS 2007/ , Folie 127

Superconducting Qubits Coupling Superconducting Qubits Via a Cavity Bus

Quantum Control of Superconducting Circuits

Quantum computation and quantum optics with circuit QED

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

Transcription:

Summary: Types of Error Unitary errors (including leakage and cross-talk) due to gates, interactions. How does this scale up (meet resonance conditions for misc. higher-order photon exchange processes of multiple qubits higher-weight errors). Stochastic errors: amplitude-damping T 1 and dephasing T 2. Dimensionless figure of merit: T gate T 1 and T gate T 2 with T gate = 100 nanosec, T i = 10μsec. gives 1% error rate or less due to stochastic noise during gates. Measurement error (e.g. 92.5% fidelity) and measurement duration (O 100 nanosec) and resonator reset. One read-out resonator per qubit. Leakage not immediately dealt with by QEC. Unitary errors, merely systematic? What is their figure of merit error rate? Overrotation such that F = φ error φ = cos(θ) 1 θ2 2 and θ is error amplitude. Noise threshold value in principle pertains to error amplitudes (not amplitude 2 = probability), e.g. Terhal & Burkard, PRA 2005. Non-Pauli stochastic or non-stochastic errors approximated by Pauli errors (easy in simulation).

See e.g. Terhal, Quantum Error Correction for Quantum Memories, Rev. Mod. Phys. (2015) Quantum Error Correction Surface code for storing a logical qubit n = d 2, k = 1, d code d=3 Surface-17 Here d=6 Measure of success? Get a encoded qubit with a longer lifetime τ (F t e t/τ ). But how fast are the encoded gates, t gate (QEC slows things down)? Improve t gate! τ Show (for surface code) that encoded qubit has P error t = O d = c 1 e c 2d

Noise Threshold for Toric Assume we measure syndrome by noisefree circuits. Assume independent X and Z errors (probability p of Z error on each qubit and prob. p of X errors in one time-step) Decode after every step (instantly). Code Critical or threshold noise rate p c is 11% using minimum weight decoding. Very high!

Noisy Error Correction But errors can occur in CNOT gates, H gate, measurement and preparation. Assume error probability p per step Two effects: Error on ancilla can propagate to 4 data qubits. (Leaked ancilla qubit can spread damage to data qubits). Erroneous CNOTs, measurement etc. can lead to faulty error syndrome. (Leaked data qubit can mess up syndrome for error correction cycles until data qubit is put back in code space). Solution: repeat measurement L times and decode using L measurements.how does this work? (Leakage requires different treatment).

Measurement of plaquette operators. At red dots the syndrome value changes Decoding in 3D Errors that could have caused such syndrome. Vertical errors are syndrome measurement errors. So again we need to find a minimum-weighted (error) chain which connects the red defects.

Surface Code with Noisy EC Easy scaling behavior of logical error probability p L (probability of logical error per QEC cycle) Logical error p L N p t+1 when code can correct t errors (distance d=2t+1), N is some (combinatorial) factor Threshold p c set by p c = N p c t+1. p (d+1)/2 Thus p L p c for odd distance d p c Numerical fit for surface code (Fowler, Mariantoni et al., PRA 2012): p L 0.03 ( p ) (d+1)/2 for odd distance d=l p c with p c 0.57% Recent experiments on bit-flip code in circuit-qed (Kelly et al.) Logical error rate ε~1/λ n+1 for n-th order fault-tolerance (can correct n errors), compare with above: Λ = p c p. Logical error rate does not refer to encoded qubit life-time: A. Life-time break-even point or B. QEC unit break-even point (harder!). B. is correct

Surface Code with Noisy EC The memory noise threshold (no gates) has also been estimated as being between 7.5 x 10-3 and 1.1 x 10-2. (depending on decoding cleverness). Logical error rate P L exp κ p L, κ p = 0.8 at p = p c /3. Surface Code: At L=6, for a depolarizing probability p=2 x 10-4, one can have a logical X error rate of 10-7. There is no known code with a better threshold (except concatenated scheme by Knill): find one!?

Surface Code Memory Different break-even points Use amplitude damping model to model T 1 relaxation on qubit (transmon qubit coherence time is O(10)μsec) Additional dephasing: model T 1 and T 2. Using LIQUi for simulation Data for Surface-17 below Tomita, Svore, PRA 2014 Each qubit is involved in 4 parity check measurements: each qubit needs to interact with 4 ancilla qubits (via 4 resonators e.g.)

Fixed-Coupling Architectures Scalable frequency use (multiplexing) and minimal coupling schemes (avoidance of cross-talk). Time-multiplexing of read-out. Read-out pulses (and flux-lines?) from the top UCSB/Google: 1D repetition code with ZZ checks on a line Where to put the read-out resonators when going to a full 2D design? Non-scalable Helmer architecture (including ancillas, distance-3 code) Vertical and horizontal lines are resonators to which several transmon qubits at different frequencies (color) are coupled. No. of frequencies grows with lattice size.

DiVincenzo Architecture Qubits (green) coupled via high-q superconducting resonators (gray). Assume CNOT gates done via resonator. Each qubit coupled to 2 resonators. Every qubit has a number of controller and sensor lines to be connected to the outside world (gold pads) Where is the surface code in this?

Blue are data qubits Red are X-check ancilla qubits Blue are Z-check ancilla qubits Numbering is related to using four different frequencies IBM Patent, 2014 (inventors: Gambetta and Smolin)

Blue are data qubits Red are X-check ancilla qubits Green are Z-check ancilla qubits Numbering is related to using five different frequencies IBM Patent, 2014 (inventors: Gambetta and Smolin)

Fixed-Coupling Architectures Scalable frequency use (multiplexing) and minimal coupling schemes (avoidance of cross-talk). Read-out pulses (and flux-lines?) from the top UCSB/Google: 1D repetition code with ZZ checks on a line Where to put the read-out resonators when going to a full 2D design? Non-scalable Helmer architecture (including ancillas, distance 3 code) Vertical and horizontal lines are resonators to which several transmon qubits at different frequencies (color) are coupled.

Surface Code in Progress Fig. from S. Benjamin & J. Kelly, Superconducting Qubits: Solving a wonderful problem. News & Views, Nature Materials 14, 561 563 (2015)

Surface Code in Progress Chow et al, Proc. SPIE 9500 (2015) & Nat. Comm.

Surface Code in Progress Parity check measurement fidelity is 0.774 Much more than 3% for p=q (qubit error rate is parity check measurement error rate) model in surface code 2.4μsec integration time for measurement. Takita et al, arxiv.org:1605.01351

Statistics of 4000 shots

Surface Code in Progress Failure Probability ~1/Λ n+1 Is Λ larger than 1? Kelly et al. data

Surface Code in Progress

Surface Code in Progress Issues: Qubit leakage Are gate fidelities (two-qubit gate) high enough Time duration of measurement (reset resonator) while qubits decohere Scaling-up: cross-talk, stray EM modes Theorists work: Better models of noise using superoperators & Lindblad equations. Effect on noise threshold. Best fast decoders for surface code Different codes (concatenation of [[4,2,2]] with surface code, color code)

Alternative Routes and Means Higher fidelity parity measurement needed! Direct parity measurement: no ancilla transmon used, directly focus on getting the interference right on outgoing microwave field. α t = α(t)e iπp where P=0,1 is parity of set of qubits (pick up phase shift of e iπ at each qubit when it is in state 1, and no phase shift when it is in 0. ) Use of longitudinal coupling Z(a + a ) between resonator and qubit. The use of other qubits e.g. fluxonium, new flux or phase qubits coupled to resonators. Encoding qubits into resonators

Encoding a qubit into a resonator Resonator: mostly photon loss Encode a better qubit in resonator (then concatenate) Ofek et al., arxiv.org:1602.04768

Cat-State Code A cat state is an equal superposition of 2 quasi-orthogonal coherent states. The states 0/ 1 + are even photon number states while 0/ 1 have an odd # photons. QEC conditions are met for E 0 = τκ a (even odd, detect by measuring P = e iπa a ) and E 1 = I τκ 2 a a (α αe τκ /2 ) when α. For small n = α 2 there is a sweet spot n 2.4 where E 0 and E 1 = I meet the QEC conditions

Duivenvoorden, Terhal (unpublished) Best possible performance of cat state code Only photon loss (Lindblad equations), κ 1 = 300μsec interspersed with the best possible quantum error correction at intervals T (time-to-correction). Best possible QEC minimizes has fidelity loss η close to η op = min η R, i.e. η 3η op Sweet spot at n 2.4 (right where experiment is done) R Using transpose channel QEC see Ng, Mandayam, PRA (2010)

Experimental cat code Ofek et al., arxiv.org:1602.04768 Weakest link: qubit T 1 during photon parity measurement. Non-fault tolerant. Why? Taking n=3. Two rounds of photon parity measurements (via a qubit-ancilla dispersively coupled: Za a coupling)

QEC Conditions Useful when we consider more general codes (e.g. bosonic codes), specific, non-pauli errors and approximate error correction. Assume super operator description of noise: S ρ = k E k ρ E k i.e. depolarizing channel, independent X and Z errors. QEC Conditions. We encode bit strings i i. One can correct the set of errors {E k } (or any linear combination of these errors) if and only if, for all k, l, we have i, j, i E k E l j = c kl δ ij

QEC Conditions A. i, i E k E l i = c kl where c kl does not depend on i. If c kl = δ kl, errors send a codeword to orthogonal error-spaces (labeled by k), but errors may have identical effect on codewords. B. i E k E l j = 0, orthogonal codewords are mapped by different (or the same) errors onto orthogonal states so that we can reverse the error (by a unitary transformation on codespace + ancilla). One could obey these conditions approximately, so that only approximate reversal is possible, leading to a reduction in error rate.

e A e B = e B e A e [A,B], for A, B lin. comb of p and q Qubit into an oscillator Gottesman, Kitaev, Preskill 2001: Common +1 eigenstates of S p = exp( i p 2 π) and S q = exp i q 2 π with q, p = i. Thus p = 0 mod π, q = 0 mod π. We have Z = exp i q π, X = exp i p π, Z 0 = 0, Z 1 = 1 How to prepare a finite-photon number version of these states (using coupling of bosonic mode to a qubit)? Terhal, Weigand, PRA (2015)

Approximate States Common +1 eigenstates of S p = exp( i p 2 π) and S q = exp i q 2 π are 0 and 1 so that Z = exp i q π with Z 0 = 0, Z 1 = 1. 0 1 Squeezed peaks at even multiples of π Squeezed peaks at odd multiples of π Error correction means detecting small displacements and reversing these: this works for with u, v π/2.

Cats in cavities, e.g. Vlastakis et al., Science 2013, Ofek et al.: arxiv.org:1602.04768 GKP Code Implemention High-Q micro-cavity, say,1 msec or more. High quality qubit, say, T 1, T 2 O 10 μsec Strong dispersive qubit-cavity coupling χza a (e.g. χ = 2.5MHz, cavity/qubit detuning 1 GHz, nonlinearities O(1) khz) 2π Dispersive coupling allows for qubit-controlled cavity rotation (R θz = exp iθ a a Z ) which can be directly used for qubit-controlled displacement. Controlled-rotations take T = Use no more than 50 photons π χ = 200 nanosec.

Displacement notation D α = exp(αa α a) Preparation of 0> Approximate +1 eigenstate of S q = exp i q 2 π (and Z = exp i q π ) is squeezed vacuum q 0. How to make this into an +1 eigenstate of S p = exp( i p 2 π)? Measure the eigenvalue e iθ of S p = D( 2π)! Phase Estimation Repeat such circuit M times, with k=0 or higher k, with or without varying feedback phase φ, to estimate θ (or better said: to project onto state with a certain value for θ).

Phase Estimation Protocols Start with squeezed vacuum state Apply M rounds of this circuit: Type equation here. 1. Non-adaptive protocol: M/2 times with phase φ = 0, M/2 times with phase φ = π/2. 2. Adaptive protocol with feedback (Berry, Wiseman, Breslin, PRA 2001): phase φ changed/adapted in each round, depending on qubit measurement outcomes. U ψ θ = e iθ ψ θ P 0 = 1 (1 + cos θ + φ ) 2

Numerical Simulation Results Start with squeezed vacuum with 8.3 db of squeezing. M=8 protocol is executed in 4 μsec. (number of photons in state n 25 ± 25) Adaptive protocol with M=8 is best Gives a 94% (heralded) chance of preparing a state for which probability for p-shift errors beyond π/6 is less than 1%. Biggest source of concern are nonlinearities K (a a) 2, χ Z(a a) 2.

Surface Code of Oscillators Concatenate surface code with bosonic GKP code: surface code of oscillators (cavities coupled with transmon qubits) Plaquette ZZZZ measurement around plaquette u of the sum q u x q u+ x + q u y q u+ y Star XXXX measurement around star v of the sum p v x + p v+ x + p v y p v+ y (Using p 1 + p 2, q 1 q 2 = 0) Cliffford (CNOT, Hadamard etc.) gates on encoded qubits are done by linear optics (squeezing needed)

Discussion