mod04lec25 - Fixing quantum errors with quantum tricks: A brief introduction to QEC - Part 3

NPTEL-NOC IITM
11 Oct 202225:02

Summary

TLDRThis script delves into quantum error correction, focusing on the three-qubit code's ability to detect and correct single qubit bit flip errors without collapsing the quantum state. It explains the use of ancillary qubits and the concept of syndrome bits for error diagnosis. The script outlines the complete circuit for encoding, error detection, and correction, emphasizing the importance of fidelity in quantum computation. It also touches on the physical resource requirements for fault-tolerant quantum processors, highlighting the progression from noisy intermediate-scale quantum devices to scalable, error-corrected quantum computing.

Takeaways

  • 🧠 The discussion focuses on quantum error detection and correction, specifically for single qubit errors on a three-qubit state.
  • 🔍 Error detection is crucial for quantum computing as it allows for the identification of errors without collapsing the quantum state.
  • 📊 A majority voting or parity check mechanism is used to detect errors, which involves measuring in the 0-1 basis on ancillary qubits.
  • 🛠️ The error detection circuit includes three encoded qubits and two ancillary qubits, with the latter initially set to zero.
  • 🔄 The CNOT gate is used in the circuit to maintain the superposition of the state, aiding in the error detection process.
  • 📉 Syndrome bits, derived from measurements on the ancillary qubits, indicate the presence and location of errors.
  • 🔧 Error correction involves applying an X gate to the affected qubit based on the syndrome bits, effectively reversing the error.
  • 🔑 The three-qubit code can detect and correct for single qubit bit flip noise, improving the fidelity of quantum states.
  • 💾 Quantum error correction requires physical resources, with at least 49 physical qubits needed for one error-corrected logical qubit using a seven-qubit code.
  • 📈 The current era of quantum computing involves noisy intermediate-scale quantum devices, with the goal of scaling up to fault-tolerant, error-corrected quantum computation.

Q & A

  • What is the primary goal of quantum error detection?

    -The primary goal of quantum error detection is to identify the presence of errors without collapsing the quantum state, allowing for the extraction of information about the error's presence and location to reverse its action.

  • Why is it important to know the location of an error in quantum error detection?

    -Knowing the location of an error is crucial to reverse the error's action effectively. Without this information, it would be impossible to correct the error accurately.

  • What role do ancilla qubits play in quantum error detection?

    -Ancilla qubits are used in the error detection process to help identify errors without directly measuring the data qubits. They are initially set to zero and are used in conjunction with CNOT gates to detect errors through parity checks.

  • How are syndrome bits generated in the error detection process?

    -Syndrome bits are generated through measurements of the ancilla qubits in the Z basis. These classical bits act as parity check bits, indicating which qubit was affected by a bit flip error.

  • What is the significance of the syndrome table in quantum error detection?

    -The syndrome table is significant as it maps the outcomes of the syndrome bits to specific error patterns, allowing for the identification of the type of error and the qubit it occurred on, which is essential for error correction.

  • How does the three-qubit code correct for single qubit errors?

    -The three-qubit code corrects for single qubit errors by using a syndrome table that corresponds to different error operators. Depending on the syndrome, an X gate is applied to the appropriate qubit to correct the error.

  • What is the relationship between fidelity and quantum error correction?

    -Quantum error correction can improve fidelity, which is a measure of how close the final state is to the initial state. Higher fidelity implies better preservation of the quantum state against noise.

  • What is the minimum number of physical qubits required for one error-corrected logical qubit?

    -At least 49 physical qubits are required for one error-corrected logical qubit when using a seven-qubit error-correcting code, which is more amenable to fault tolerance techniques.

  • What is the current state of quantum devices in terms of qubit count and error rates?

    -As of the script's knowledge, we are in an era of noisy intermediate-scale quantum devices with around a hundred qubits, but with error rates still above the threshold required for error-resilient computation.

  • What is the significance of the quantum volume metric in the context of quantum computing?

    -Quantum volume is a metric that combines the size of the circuit, the connectivity of the qubits, and other factors to indicate the power of a quantum computer. It is used to gauge progress beyond simple qubit count, aiming to reflect the ability to perform complex quantum computations.

Outlines

00:00

🛠️ Quantum Error Detection and Three Qubit States

The paragraph discusses the process of detecting quantum errors without collapsing the quantum state. It emphasizes the importance of identifying the location of an error to reverse its effects. The speaker introduces six three-qubit states and explains that error detection involves measuring in the 0-1 basis, or the Z basis, using ancillary qubits. The error detection circuit is described, involving pairs of CNOT gates from data qubits to ancillary qubits, which are initially set to zero. The speaker explains that the CNOT gates do not alter the superposition of the state, and that the measurement outcomes, referred to as syndrome bits, indicate the presence and location of errors.

05:02

🔍 Analyzing the Error Detection Circuit

This section delves into the analysis of the error detection circuit. The speaker hypothesizes a bit flip error on the first qubit and explains how this error would affect the parity of the qubits. The role of CNOT gates in detecting such errors is highlighted, showing how they trigger bit flips in ancillary qubits based on the parity of the data qubits. A syndrome chart or table is introduced as a method to map the classical outcomes of measurements to specific errors. The speaker outlines how different syndrome bit values correspond to errors in different qubits and explains the correction process, which involves applying an X gate to the affected qubit.

10:02

🔗 Completing the Quantum Error Correction Circuit

The speaker outlines the complete process of quantum error correction, starting from encoding the qubits to detecting and correcting errors. The process involves starting with an arbitrary single qubit state, applying CNOT gates for encoding, and then introducing noise through a bit flip channel. The noisy qubits are then subjected to the error detection and correction process using additional ancillary qubits and CNOT gates. The outcomes of measurements on these ancillary qubits guide the application of X gates for error correction. The paragraph concludes by emphasizing that this process corrects for single qubit errors, improving the fidelity of quantum computations.

15:03

📈 Quantum Error Correction and Fidelity

This paragraph discusses the broader implications of quantum error correction, particularly its role in enhancing the fidelity of quantum computations. The speaker notes that the three qubit code can correct for single qubit bit flip noise, improving coherence time provided the noise parameter is small. The discussion extends to different types of errors, such as phase flip and amplitude damping, and how they can be corrected using extended codes like the nine qubit code. The speaker also introduces the concept of fault tolerance and concatenation, which are techniques used to further reduce error rates and achieve a fault-tolerant quantum processor.

20:04

🚀 Roadmap to Fault-Tolerant Quantum Computation

The final paragraph provides an overview of the current state and future prospects of quantum computing. The speaker references the Google roadmap from 2018, highlighting the transition from noisy intermediate scale quantum (NISQ) devices to fault-tolerant quantum computation. The speaker discusses the progress in terms of quantum volume, a metric that captures the size and error resilience of quantum devices. The goal is to scale up to thousands of qubits to achieve fault tolerance and robust, scalable quantum devices. The speaker concludes by emphasizing the ongoing efforts to improve quantum volume and the anticipation of achieving higher quantum volumes in the coming years.

Mindmap

Keywords

💡Error Detection

Error detection in the context of the video refers to the process of identifying the presence of errors in quantum computing without collapsing the quantum state. This is crucial for quantum error correction, as it allows for the diagnosis of errors that have occurred during computation. The video discusses how error detection is achieved through the use of ancillary qubits and parity checks, which help to identify the location of errors without disturbing the encoded state. For example, the script mentions, 'the point is, we need to know where the error occurred, in order to be able to reverse the action of the error.'

💡Qubit

A qubit, short for quantum bit, is the fundamental unit of quantum information. Unlike classical bits that can be either 0 or 1, qubits can exist in superpositions of states, allowing quantum computers to perform complex calculations. The video script discusses how errors in qubits can occur and how these errors are detected and corrected, such as 'the action of the single qubit errors on the encoded state or the three qubit state'.

💡Encoded State

In quantum computing, an encoded state refers to a quantum state that has been prepared using quantum error correction techniques to protect it from errors. The script describes how qubits are put into an encoded state using the three-qubit code, which is designed to detect and correct for bit flip errors. The concept is illustrated when the script says, 'so the next step is to look at error detection, we have looked at the action of the single qubit errors on the encoded state or the three qubit state'.

💡Ancillary Qubits

Ancillary qubits are additional qubits used in quantum error correction to assist in the detection and correction of errors. They are not part of the original data but are used to perform operations that help identify errors without disturbing the main qubits. The video explains how ancillary qubits are used in the error detection circuit, as stated, 'we must measure each qubit in the 0 1 basis, and like I said the key point is that the measurement is not done on the data qubits itself but rather on two additional qubits called the ancillary qubits'.

💡Bit Flip Error

A bit flip error is a type of quantum error where the state of a qubit is flipped from 0 to 1 or vice versa. This is a common type of error in quantum computing that can lead to incorrect computation results. The video script discusses how bit flip errors are detected and corrected using the three-qubit code, with the script stating, 'if there was an error on the first qubit you notice that the 0 0 0 has become 1 0 0 and the 1 1 one has become a zero one one'.

💡Parity Check

In the context of the video, a parity check is a method used to detect errors by examining the even or odd number of 1s in a set of qubits. This is a key part of the error detection process in quantum computing, as it helps to identify whether an error has occurred without collapsing the quantum state. The script describes this process, noting 'there is a majority voting or a parity check element that comes in'.

💡Syndrome Bits

Syndrome bits are classical bits that result from measurements made during the error detection process in quantum computing. They provide information about the presence and type of errors in the quantum system. The video script explains how syndrome bits are used to determine which qubit was affected by a bit flip error, as indicated by 'these classical outcomes are called syndrome bits, because these classical syndrome bits are essentially the parity check bits, which tell us exactly which error occurred'.

💡Error Correction

Error correction in quantum computing is the process of identifying and fixing errors that occur during quantum computation. The video script describes how error correction is achieved through the use of a syndrome table and the application of X gates to correct bit flip errors. The script mentions, 'this syndrome table essentially captures the fact that the different single qubit errors can be distinctly identified and they can be fixed by the simple application of an X gate on one of the three encoded qubits'.

💡Fidelity

In quantum computing, fidelity is a measure of how closely the final state of a quantum system matches the intended state. High fidelity indicates that errors have been successfully corrected. The video discusses how quantum error correction can improve fidelity, which in turn implies an improvement in the coherence time of the physical qubits. The script states, 'quantum error correction can improve fidelity, and this in turn implies that it can improve the coherence time of the physical qubits'.

💡Fault Tolerance

Fault tolerance in quantum computing refers to the ability of a quantum system to continue operating correctly even when some of its components fail. The video script mentions the theory of quantum fault tolerance, which is necessary to deal with faulty gates and circuits in a real quantum processor. The script points out that 'the next step is to talk about fault tolerance, so in order to deal with faulty gates and circuits we have the theory of quantum fault tolerance'.

Highlights

Introduction to error detection in quantum computing without collapsing the state

Explanation of the need for error detection to know the location of errors for reversal

Discussion on the use of majority voting or parity check in three qubit states for error detection

Emphasis on measuring in the 0 1 basis for detecting X errors in quantum states

Description of the role of ancillar qubits in error detection circuits

Circuit diagram explanation for error detection using ancillar qubits

Analysis of how the circuit handles different types of bit flip errors

Introduction to syndrome bits as classical outcomes of measurements for error detection

Construction of a syndrome table to map error detection to specific qubit errors

Explanation of how to correct errors by applying an X gate based on syndrome results

Overview of the complete circuit for encoding, detecting, and correcting errors in a three qubit code

Discussion on the limitations of error correction to single qubit errors

Importance of the noise parameter being small for effective error correction

Introduction to the concept of fault tolerance in quantum computing

Exploration of the physical resource requirements for implementing quantum error correction

Discussion on the transition from noisy intermediate scale quantum devices to fault-tolerant quantum computation

Presentation of the Google and IBM roadmaps for scaling up quantum devices

Conclusion on the current state and future prospects of quantum error correction

Transcripts

play00:01

[Music]

play00:14

so the next step is to look at error

play00:17

detection

play00:18

we have looked at

play00:21

the action of the

play00:23

single qubit errors

play00:25

on the encoded state or the three qubit

play00:28

state

play00:29

so the next step is to ask how do we

play00:32

detect these errors in a way that the

play00:34

state doesn't collapse but still we are

play00:36

able to extract information about

play00:39

the presence of the error the point is

play00:41

we need to know where the error occurred

play00:44

in order to be able to

play00:45

reverse the action of the error right so

play00:48

how do we know where the error occurred

play00:50

now look at these six

play00:52

three qubit states

play00:54

you notice that once again there is a

play00:57

majority voting or a parity check

play00:59

element that comes in right so

play01:03

but now notice that the measurement that

play01:05

i need to do as far as the quantum

play01:07

states are concerned is actually a

play01:08

measurement in the 0 1 basis so this is

play01:11

the first thing to note that if i want

play01:12

to detect x errors

play01:15

note

play01:16

that

play01:17

we must measure

play01:25

in the so called z basis

play01:28

or

play01:30

the 0 1 basis so we must measure measure

play01:33

each qubit

play01:35

in the

play01:36

0 1 basis

play01:40

and like i said the key point is that

play01:42

the measurement is not done on the

play01:44

data qubits itself uh on the encoded on

play01:47

the three encoded qubits but rather on

play01:49

two additional qubits called the

play01:51

ancillar qubits so here is what the

play01:54

error detection circuit looks like

play01:56

so we have the three

play01:58

encoded qubits and then we have two

play02:01

additional lines

play02:02

to denote the ancillar qubits

play02:05

and these ancillar qubits are initially

play02:09

set to

play02:11

zero

play02:13

okay

play02:14

so here what we have is some arbitrary

play02:17

superposition of the form

play02:19

alpha zero zero

play02:21

plus beta 1 1

play02:23

1

play02:24

right so this is what the circuit looks

play02:26

like it basically entails

play02:28

pairs of c naughts i'll describe the

play02:30

circuit first and then we'll see how

play02:33

it achieves our goal of error detection

play02:37

so i have a pair of c naughts from the

play02:39

first two qubits

play02:41

to the first ancillar qubit and then

play02:45

i have another pair of c naughts to the

play02:48

second ancillar qubit coming from the

play02:50

second and the third

play02:53

data qubit so essentially the first two

play02:55

data qubits act as control for the first

play02:57

two c naughts and the second two data

play03:00

qubits sorry

play03:02

act as control

play03:03

for the

play03:05

second two c naughts

play03:11

two c naughts on the first ansel are

play03:13

qubit

play03:15

with the first two data qubits as

play03:17

controlled and two c naughts on the

play03:19

second ancillar qubit with the second

play03:21

and third data qubits as control now

play03:23

notice that the c naught being a two

play03:26

qubit unitary gate does nothing to the

play03:29

superposition so this state continues to

play03:32

remain

play03:33

as

play03:35

um actually i should not say 0 0 plus

play03:37

beta 1 1 1 this could be some noisy

play03:39

version of 0 0 0 plus beta 1 1 so this

play03:42

could be a state with say a bit flip

play03:44

that has occurred in the second qubit or

play03:46

a big flip that has occurred in the

play03:48

third qubit and so on right so this

play03:50

state remains whatever it is

play03:53

right so let me not write this as an

play03:56

as an

play03:57

error free state but some

play04:00

encoded state so i will say encoded

play04:04

noisy state

play04:05

right

play04:06

and this state continues to remain what

play04:08

it is so if i call this

play04:10

maybe psi

play04:12

logical to denote that this is an

play04:14

encoded state this continues to remain

play04:16

psi logic

play04:18

now what we do with the two ancillar

play04:19

qubits well we perform a measurement

play04:28

we perform two measurements both of them

play04:31

in the z basis

play04:34

okay

play04:36

and this leads to

play04:38

some classical bits right so let me call

play04:41

this as

play04:43

s1 and s2

play04:46

classical outcomes of these two

play04:48

measurements and these classical

play04:50

outcomes

play04:53

are called syndrome bits

play05:01

because these classical syndrome bits

play05:03

are essentially the parity check bits

play05:05

which tell us exactly which error

play05:07

occurred or rather which qubit was

play05:10

affected by the bit flip error

play05:13

so let's analyze the circuit now suppose

play05:15

there was a bit flip error on the first

play05:17

qubit right so let me mark this

play05:19

let me say that there was an error on

play05:21

the

play05:22

first qubit right

play05:24

so then what happens

play05:26

uh

play05:27

well let's go back here right

play05:29

and see

play05:30

so if there was an error on the first

play05:32

qubit you notice that the 0 0 0 has

play05:34

become 1 0 0 and the 1 1 one has become

play05:37

a zero one one right so this is the

play05:39

possibility that we are talking about

play05:42

this one right

play05:48

so in this case you notice that the

play05:50

parity of the first two qubits is odd

play05:54

right but the parity of the second two

play05:56

qubits is even

play05:58

so

play06:00

that's what these c naughts are doing

play06:02

for us so if either of the first or the

play06:06

second qubit

play06:08

has undergone a bit flip

play06:10

then one of these c naughts gets

play06:12

triggered one of these two c naughts of

play06:14

the on the first two qubits gets

play06:16

triggered and correspondingly the first

play06:18

ancillar qubit undergoes a bit flip so

play06:22

this

play06:22

then undergoes a bit flip

play06:26

similarly if one of the second two

play06:29

qubits underwent a bit flip then the

play06:31

second ancillar qubit will undergo a bit

play06:34

flip

play06:35

so either the first ancillar qubit or

play06:38

the second ancillar qubit undergoes a

play06:40

bit flip depending on whether the first

play06:43

two qubits underwent a bit flip or the

play06:45

second two qubits underwent a bit flame

play06:48

and so we can actually make a table

play06:50

right so we can do this where we can

play06:52

make what is called a syndrome chart or

play06:54

a syndrome table

play07:00

right

play07:01

where

play07:02

we write down the values of the

play07:04

classical outcomes s1 and s2 so s1 and

play07:07

s2 are both

play07:09

bits right so they cannot be 0 or 1. so

play07:10

what happens if s1 and s2 are both 0

play07:13

well this implies that neither of the

play07:15

two ancillar qubits got flipped right

play07:17

because both continue to be zero

play07:19

and this can only happen if

play07:21

both pairs of qubits the first two

play07:23

qubits and the second two data qubits

play07:26

continue to have even parity which means

play07:29

even number of zeros and ones

play07:31

right and this can only happen in the

play07:33

case that there was no noise so if both

play07:36

syndrome bits

play07:37

are zero then the diagnosis

play07:45

is that there are there was no

play07:47

error right

play07:49

this is the case where all three of them

play07:51

simply got acted by the identity

play07:52

operator

play07:53

now if the first syndrome bit

play07:56

has flipped but the second one has not

play07:59

what it means is that there was an error

play08:01

only somewhere in the first two qubits

play08:04

but none in the second pair of qubits

play08:06

and so the error must be on the first

play08:07

qubit so this means

play08:09

that there was a bit flip

play08:14

on

play08:14

the first qubit

play08:24

so this is basically the error operator

play08:27

x i i

play08:28

right and once you detect this what do

play08:30

you do you simply reverse for it by now

play08:33

acting an x gate on the first

play08:37

data qubit of the first encoded qubit

play08:39

similarly if the syndrome was 0 1 then

play08:43

that implies a bit flip

play08:46

on the

play08:48

third qubit

play08:52

which is corresponding to the error

play08:54

operator iix

play08:57

why is this because this means that

play08:58

there was no error on the first two

play09:00

qubits there was an error on the second

play09:02

pair of qubits and that's why the second

play09:04

ancillar qubit has gotten flipped so

play09:06

this again means that the second qubit

play09:07

is unaffected but is the third qubit

play09:09

that is affected and finally you could

play09:11

have the possibility that both syndrome

play09:13

bits

play09:14

are one which means the outcomes of both

play09:16

the z measurements at the end on the

play09:18

ancillars are one in which case there

play09:20

must have been a bit flip

play09:22

on

play09:24

the first pair and the second pair which

play09:26

then means a bit flip on the second

play09:28

qubit alone right

play09:33

and this corresponds to the error

play09:35

operator i x i

play09:38

so while i am writing correspondingly

play09:40

the error operator here note that this

play09:42

is also the recovery operator in the

play09:44

sense that if there is no error

play09:46

then

play09:48

what is the correction procedure involve

play09:51

nothing you just do identities do

play09:52

nothing right so this last column what

play09:55

i'm writing here is actually in some

play09:58

sense the

play09:59

recovery or the correction operation

play10:02

right

play10:03

so

play10:04

if there's a bit flip on the first qubit

play10:06

you simply apply an x on the first qubit

play10:07

if there's a big flip on the third qubit

play10:09

you apply a x on the third qubit and

play10:11

there's a bit flip on the second qubit

play10:12

you simply apply an x on the second

play10:14

cubit right so this syndrome table

play10:18

essentially captures

play10:20

the fact that the different single qubit

play10:23

errors

play10:24

can be

play10:25

distinctly identified and they can be

play10:27

fixed by the simple application of an x

play10:30

gate on one of the three encoded qubits

play10:33

or one of the three data qubits

play10:35

depending on

play10:37

what the syndrome table tells us right

play10:40

so

play10:41

this

play10:42

summarizes the error detection and the

play10:45

error correction procedure

play10:47

or the decoding procedure for the three

play10:50

qubit code

play10:52

so finally we can sort of

play10:55

complete the circuit right we can we can

play10:57

put together the encoding the detection

play11:00

and the correction right so we can draw

play11:03

a complete circuit so let me just

play11:04

quickly draw that finally so

play11:07

the three qubit

play11:11

code

play11:12

this is the complete

play11:17

circuit so i first have these three

play11:20

qubits which are going to become my

play11:22

encoded qubits

play11:24

i start with an arbitrary single qubit

play11:26

state which is alpha 0 plus beta 1.

play11:29

i do two c naughts

play11:32

two control not gates

play11:34

these are two ancillars remember which

play11:36

were set to zero

play11:38

right

play11:39

so i do two c naughts right and i assume

play11:42

so far

play11:43

that this process where i have prepared

play11:46

where where the initial qubit state is

play11:48

in alpha zero plus beta one i have

play11:50

prepared the two ancillar qubits in get

play11:52

zero and i have applied two c naught

play11:54

gates i assume that this process has

play11:56

happened somehow in a perfect way we'll

play11:58

address this

play12:00

in the very last

play12:02

few minutes of this lecture

play12:04

but it's as if no error has happened

play12:06

until now and at this point we say that

play12:09

the qubits are now affected by

play12:12

error

play12:13

okay

play12:14

so now we say

play12:18

you have the

play12:20

bit flip channel or the bit flip noise

play12:24

that is affecting the qubits remember we

play12:26

only

play12:27

aim to correct detect and correct for

play12:30

the single qubit bit flip errors so now

play12:33

we have the noisy qubits right so so far

play12:35

we have perfect qubits is the assumption

play12:37

somehow

play12:39

okay

play12:42

and now we have the noisy qubit so this

play12:44

part

play12:46

you have the noisy encoded qubits

play12:52

what do we do with them well we now have

play12:54

to detect and correct for the errors so

play12:56

we add these two additional ancillar

play12:58

qubits which are going to help us in

play13:01

error detection and correction

play13:04

and now we have all these c naughts c

play13:06

naughts from the first

play13:08

and the second

play13:15

which act on the first ancillar qubit c

play13:18

naught from the second

play13:20

and the third

play13:25

with the second ancillar qubit as target

play13:30

so c naught on the first ancillar qubit

play13:33

have

play13:34

the first two data qubits is controlled

play13:36

c naught's on the second

play13:39

answer like cubit have second and third

play13:40

data qubits is control and then we do

play13:42

measurement

play13:50

and depending on the outcome of this

play13:53

measurement

play13:55

and i draw two lines here to denote that

play13:57

this is now classical bits

play14:00

so depending on the classical outcome

play14:02

of

play14:03

these two measurements

play14:05

we now have to apply simply nx gate

play14:09

and this

play14:17

so the double line denotes

play14:19

classical bits

play14:21

right and this is the classical bit s1

play14:24

this is the classical bit s2 and

play14:26

depending on the values of these two

play14:28

classical bits we apply an x gate on

play14:31

these

play14:32

a single x gate on one of these three

play14:34

encoded or data qubits and then what

play14:38

comes out

play14:39

is

play14:40

something which is

play14:42

error corrected

play14:46

but remember its error corrected only

play14:48

for the single qubit error so in essence

play14:51

this is error corrected up to order p

play15:00

right so this is the complete circuit

play15:03

and

play15:04

we simply conclude this discussion by

play15:05

noting that the three qubit code can

play15:09

detect and correct for

play15:11

single qubit bit flip noise so under the

play15:14

action of a bit quantum bit flip channel

play15:17

the three qubit code corrects up to

play15:19

order p errors right and so essentially

play15:25

this demonstrates that quantum error

play15:28

correction

play15:29

can improve

play15:33

what we call fidelity fidelity is simply

play15:36

a metric that compares how close the

play15:39

final state is to the initial state

play15:42

right so quantum error correction can

play15:44

improve fidelity

play15:46

and

play15:48

this in turn implies that it can improve

play15:51

the coherence

play15:52

time of

play15:55

the physical cubits

play15:58

provided

play16:00

this noise parameter is small

play16:03

because the entire procedure crucially

play16:05

hinges on the fact that single qubit

play16:07

errors are the most likely errors and

play16:09

that is true only if

play16:11

the noise parameter is small in

play16:13

particular in this case we require

play16:16

that the error probability is less than

play16:18

a half

play16:19

right because the errors are corrected

play16:21

only up to order p remember and so we

play16:23

require that

play16:25

in order for this entire procedure to

play16:28

improve the fidelity and correspondingly

play16:31

effectively improve the coherence time

play16:33

of the qubits the

play16:35

error probability or the noise parameter

play16:37

must be small and in this case in

play16:39

particular it must be less than a half

play16:41

so having explained the technique

play16:44

and the mathematical ideas behind

play16:47

quantum error correction

play16:49

we would like to conclude with a brief

play16:51

comment on what what is the kind of

play16:54

physical resource requirement in order

play16:56

to be able to implement quantum error

play16:58

correction

play16:59

so as we mentioned earlier

play17:01

we don't just have big flip errors we

play17:03

can have a continuum of different errors

play17:06

which can occur on a single qubit

play17:08

and

play17:09

this includes erasure which is an

play17:11

important error in the classical setting

play17:13

as well this includes phase flip this

play17:15

includes amplitude damping it includes

play17:18

depolarizing noise etc

play17:21

right

play17:22

now of course as we said the resolution

play17:24

is to now

play17:25

break down your errors in terms of

play17:28

a

play17:29

finite set of errors the x error is the

play17:33

bit flip error that we already discussed

play17:35

the z error is what we would call a

play17:37

phase flip error which can again be

play17:39

corrected in a sort of fashion that is

play17:41

identical to the bit flip error

play17:44

and the y error can actually be viewed

play17:47

as a combination of the x and the z

play17:50

errors

play17:51

and together

play17:53

this set of errors

play17:54

can be corrected

play17:56

and if this set of errors if we have an

play17:59

error correcting code that can correct

play18:00

for this set of errors then such a code

play18:03

can indeed correct for an any single

play18:05

qubit error because any single qubit

play18:07

error e can be written as

play18:11

some linear combination

play18:13

of

play18:17

x y z and identity this is any

play18:21

2 by 2 matrix

play18:23

which is what any single qubit error

play18:25

would look like so any 2 cross 2 matrix

play18:28

can be written as a linear combination

play18:30

of identity x y and z

play18:32

and therefore if we are able to correct

play18:34

for x and z errors

play18:37

and since y is simply a product of x and

play18:40

z we can also correct for y

play18:42

then we end up correcting for any single

play18:44

qubit error

play18:46

i should note that just as we had a

play18:49

three qubit code for

play18:53

just the x errors

play18:55

if i now

play18:57

extend the same idea to also correct for

play19:01

the phase flips then i get

play19:04

a 9 qubit code

play19:08

for

play19:09

x

play19:10

and z errors

play19:12

that is a nine qubit code that corrects

play19:15

for

play19:15

single qubit x and z errors and this

play19:18

code

play19:19

often goes by the name of the short code

play19:28

okay

play19:29

so

play19:30

but the nine qubit code is not the most

play19:32

optimal code

play19:33

in fact the shortest code

play19:36

that is

play19:37

that can correct for an arbitrary single

play19:39

qubit error is a so called five qubit

play19:41

code and this saturates what's called a

play19:43

quantum hamming bound one can make

play19:46

certain arguments to say that the

play19:48

shortest

play19:50

code that can potentially correct for

play19:52

any arbitrary single qubit error must be

play19:54

at least five qubits long and

play19:56

we indeed have such a code that

play19:59

a five qubit code that corrects for

play20:01

arbitrary single qubit errors

play20:03

but note that so far we have assumed

play20:06

that

play20:07

while the qubit itself is susceptible to

play20:09

noise the gates up have been assumed to

play20:12

be perfect and so the encoding process

play20:14

has been assumed to be perfect

play20:17

the error detection has been assumed to

play20:18

be perfect the readouts the measurements

play20:21

have been assumed to be perfect

play20:23

but in a real circuit in a real quantum

play20:25

processor all of these are going to be

play20:27

faulty

play20:28

and so the next

play20:30

level is to talk about fault tolerance

play20:32

the next step is to talk about fault

play20:34

tolerance

play20:36

so in order to deal with faulty gates

play20:39

and circuits we have the theory of

play20:40

quantum fault tolerance

play20:43

and finally

play20:45

we also need additional qubits in order

play20:48

to bring down the error rate further and

play20:51

this uses a technique called

play20:52

concatenation so finally

play20:55

we have

play20:57

i'm just trying to now talk about the

play20:58

kind of physical requirements we need in

play21:01

order to have a fault tolerant quantum

play21:04

processor

play21:06

it turns out

play21:07

that we need at least 49 physical qubits

play21:11

in order to have one error corrected

play21:14

logical qubit and this is due to the

play21:17

fact that

play21:18

rather than the five qubit code it is a

play21:20

seven qubit code which is more amenable

play21:22

to or more easily amenable to fault

play21:25

tolerance techniques and so most of the

play21:27

physical architectures today focus on

play21:31

implementing the seven qubit error

play21:33

correcting code

play21:34

not just at one level but at two levels

play21:36

of concatenation so that we have a 49

play21:39

qubits effectively in order to

play21:42

protect against single qubit errors in a

play21:45

fault tolerant way right so this is the

play21:47

kind of resource requirement that one is

play21:49

talking about if one has to have error

play21:51

corrected

play21:53

quantum processors or quantum devices

play21:57

so just a couple of more slides to talk

play21:59

about what is the road ahead where are

play22:01

we today as i mentioned at the very

play22:03

beginning we are today in an era of

play22:04

noisy intermediate scale quantum devices

play22:08

um and this is the google roadmap which

play22:11

was put out in 2018 as you can see

play22:14

where we are today um is somewhere here

play22:17

where we have

play22:18

we have

play22:19

we are off the order of let's say a

play22:21

hundred qubits

play22:23

but with hundred qubits one can realize

play22:25

near term applications but these are 100

play22:28

noisy qubits

play22:29

right with an error rate which is still

play22:36

which is still not really below this

play22:38

threshold right so this is the so-called

play22:41

error correction threshold which says

play22:43

that so long as your error rates are

play22:44

below this

play22:46

one can do error resilient computation

play22:49

but today this is where we are at

play22:51

and

play22:53

the goal is to then scale up to

play22:56

say a thousand or ten thousand qubits

play22:58

which could then actually be error

play23:00

corrected qubits and this is the regime

play23:04

where we finally have useful error

play23:07

corrected quantum computation which is

play23:08

require something beyond

play23:11

um 1000 qubits or close to a 10 000

play23:14

qubits right

play23:16

there's a similar roadmap that we have

play23:18

from ibm and this is a very encouraging

play23:21

map what i have on the left here is the

play23:23

good old moore's law that many of us are

play23:26

familiar with which tells us how

play23:28

it's a log log plot of how the number of

play23:31

computations per integrated function is

play23:34

actually

play23:35

showing a linear rise in a log log plot

play23:38

with time

play23:40

what is plotted on the second figure is

play23:42

an interesting metric which is often

play23:44

used today called the quantum volume

play23:46

it's a combined metric which includes

play23:48

information about

play23:50

what is the size of the circuit

play23:53

the connectivity of the qubits and so on

play23:55

right and the higher the quantum volume

play23:59

the more

play24:01

number of qubits the more number of

play24:03

error resilient qubits that we have

play24:05

right so

play24:07

in terms of quantum volume you find that

play24:09

we in a log log plot we actually doing

play24:12

better than linear and today ibm is at a

play24:15

quantum volume of about 128

play24:18

and the hope is that in the next in the

play24:20

coming few years we are actually going

play24:23

to achieve higher and higher quantum

play24:24

volumes and be able to implement fault

play24:27

tolerant error resilient quantum

play24:29

algorithms

play24:31

and this roadmap talks about the current

play24:34

state of affairs so we are here where we

play24:36

have about 60 qubits today on the ibm

play24:38

processors

play24:40

and

play24:40

the hope is to be able to scale to a

play24:43

thousand qubits in over the next couple

play24:45

of years and then

play24:47

we will be in a regime where we can do

play24:49

quantum error correction hopefully

play24:51

achieve fault tolerance and

play24:54

get closer to robust scalable quantum

play24:57

devices

play24:58

thank you

Rate This

5.0 / 5 (0 votes)

Etiquetas Relacionadas
Quantum ComputingError Correction3-Qubit CodeQubit FidelityCoherence TimeQuantum AlgorithmsFault ToleranceBit Flip ErrorPhase Flip ErrorQuantum Hamming Bound
¿Necesitas un resumen en inglés?