mod04lec24 - Fixing quantum errors with quantum tricks: A brief introduction to QEC - Part 2

NPTEL-NOC IITM
11 Oct 202224:20

Summary

TLDRThis educational segment delves into the framework of quantum error correction, focusing on the three-bit quantum code that mitigates quantum bit flip errors. It explains the concept of redundancy in quantum systems, transitioning from classical bit flip channels to quantum scenarios. The script introduces the tensor product and the no-cloning theorem, emphasizing the encoding of arbitrary superpositions. It outlines the encoding process using a quantum circuit with CNOT gates, creating logical qubits or code words. The discussion then shifts to error detection, highlighting how single qubit errors transform logical states into distinguishable states, crucial for error correction in quantum computing.

Takeaways

  • 📚 The script discusses the framework of quantum error correction, focusing on the three-bit quantum code which corrects for the quantum bit flip channel.
  • 🧬 Quantum bit flip noise is described, affecting the basis states |0⟩ and |1⟩ with different probabilities for flipping and remaining unchanged.
  • 🔗 Redundancy is introduced in quantum systems by encoding a single qubit state into a three-qubit state, expanding from a 2-dimensional space to an 8-dimensional space.
  • 🚫 The no-cloning theorem is highlighted, stating that arbitrary superpositions cannot be copied directly, which complicates simple redundancy techniques used in classical systems.
  • 🔄 The concept of logical qubits or code words is introduced, representing the encoded states in a higher-dimensional space, distinct from the physical qubits.
  • 🛠️ The encoding process is achieved through a quantum circuit using CNOT gates, which transform the input state into an entangled state without violating the no-cloning theorem.
  • 🔎 The script explains how the three-qubit code can detect single qubit errors by transforming logical states into distinct, orthogonal states that can be identified.
  • 🔄 The effect of noise on the three-qubit system is considered, with the assumption that noise acts independently and identically distributed (i.i.d) on each qubit.
  • 📉 The probabilities of different error scenarios are outlined, with single qubit errors being the most likely, followed by two-qubit errors, and three-qubit errors being the least likely.
  • 🛡️ The three-qubit code is effective in error detection and correction by identifying the distinct states resulting from single qubit errors, which are mutually orthogonal.

Q & A

  • What is the main focus of the final segment of the discussion?

    -The main focus is on the framework of quantum error correction, using the example of a three-bit quantum code designed to correct errors caused by the quantum bit flip channel.

  • What is the quantum bit flip channel and how does it affect quantum states?

    -The quantum bit flip channel flips the quantum state with a certain probability. For example, the state ket 0 remains ket 0 with probability 1 - p and flips to ket 1 with probability p, and similarly, ket 1 flips to ket 0 with probability p and remains ket 1 with probability 1 - p.

  • How is redundancy introduced in quantum error correction compared to classical error correction?

    -In classical error correction, redundancy is introduced by replicating bits, such as replacing a single bit 0 with three 0s. In quantum error correction, the process involves replacing a single qubit, like ket 0, with a three-qubit state (ket 0 0 0), thus moving from a two-dimensional vector space to an eight-dimensional complex vector space.

  • Why can’t arbitrary superpositions of quantum states be directly copied using the redundancy method?

    -Arbitrary superpositions of quantum states cannot be directly copied due to the no-cloning theorem, which forbids copying an arbitrary superposition of quantum states. This is a key difference from classical information encoding.

  • What is the correct way to encode quantum information to avoid violating the no-cloning theorem?

    -The correct encoding maps an arbitrary superposition, such as alpha ket 0 + beta ket 1, to a coherent superposition in the three-qubit space, resulting in a state like alpha ket 0 0 0 + beta ket 1 1 1.

  • What is the role of unitary transformations in quantum encoding?

    -Unitary transformations allow quantum encoding by ensuring that the transformation from a single qubit to a three-qubit state is done in a reversible and consistent manner, preserving the superposition and quantum information.

  • What are logical qubits and how are they represented in the three-qubit code?

    -Logical qubits represent the encoded qubits in the three-qubit code. They are denoted as ket 0 with a subscript l (for logical), representing the state ket 0 0 0, and ket 1 with a subscript l, representing the state ket 1 1 1.

  • How does the quantum encoding circuit work to create the three-qubit state?

    -The quantum encoding circuit uses CNOT gates to transform the input qubit (which contains the information) and two ancillary qubits (initialized to 0) into a three-qubit state that represents a superposition, such as alpha ket 0 0 0 + beta ket 1 1 1.

  • What type of errors does the three-qubit quantum code focus on correcting?

    -The three-qubit quantum code primarily focuses on correcting single qubit bit flip errors, which are more likely than two-qubit or three-qubit errors.

  • How does the three-qubit code help in detecting single qubit errors?

    -The three-qubit code helps detect single qubit errors because the logical qubits (such as ket 0 0 0 and ket 1 1 1) transform into distinct, mutually orthogonal states when errors occur, making them distinguishable and detectable.

Outlines

00:00

🧠 Introduction to Quantum Error Correction

The segment begins with an introduction to quantum error correction, focusing on the three-bit quantum code that addresses quantum bit flip errors. It explains the quantum bit flip channel and its effect on basis states, contrasting it with classical redundancy methods. The concept of encoding a single qubit into a three-qubit state is introduced, emphasizing the need to handle arbitrary superpositions due to the no-cloning theorem. The discussion sets the stage for understanding how redundancy is introduced in quantum systems to protect against errors.

05:02

🔄 Correct Encoding of Quantum Information

This paragraph delves into the correct procedure for encoding quantum information. It explains that arbitrary superpositions cannot be simply copied due to the no-cloning theorem, and instead, a coherent superposition must be created in the three-qubit space. The concept of logical qubits or code words is introduced, replacing physical qubits with a three-qubit state. The paragraph also discusses the encoding process using unitary transformations and the significance of entanglement in this context. A quantum circuit for encoding is briefly mentioned as a way to achieve this transformation.

10:03

🔗 Quantum Circuit for Encoding

The focus shifts to the practical implementation of the encoding process using a quantum circuit. The circuit involves a data qubit carrying the information and two ancillary qubits initialized to zero. The use of the CNOT gate is highlighted as a crucial element in the circuit, which, when applied, transforms the three-qubit state into the desired superposition. The output state is an entangled state of three qubits, which is essential for error detection and correction. This paragraph provides a detailed step-by-step analysis of the circuit's operation.

15:06

🌐 Effects of Noise on Three-Qubit Code

This paragraph discusses the impact of noise on the three-qubit code, considering the independent and identically distributed (iid) assumption. It outlines the set of possible errors that can occur in a three-qubit system, ranging from no error to single, double, and triple bit flip errors. The probabilities of these errors are explained, with a focus on the likelihood of single qubit errors. The paragraph concludes by emphasizing the need to detect and correct single qubit errors, setting the stage for further discussion on error detection.

20:07

🔍 Detecting Single Qubit Errors

The final paragraph examines how single qubit errors affect the logical states of the three-qubit code. It describes the transformation of the logical zero and one states under the influence of bit flip errors, resulting in distinct and mutually orthogonal three-qubit states. The importance of these states being distinguishable is highlighted, as it allows for error detection. The paragraph concludes by emphasizing the three-qubit code's ability to detect errors, which is a critical aspect of quantum error correction.

Mindmap

Keywords

💡Quantum Error Correction

Quantum Error Correction is a method used to protect quantum information from errors due to decoherence and other quantum noise. In the video, this concept is central as it discusses how to correct quantum bit flip errors using a three-bit quantum code. The technique is essential for the development of reliable quantum computing systems.

💡Quantum Bit Flip Channel

The Quantum Bit Flip Channel is a quantum noise model where the quantum state of a qubit can be flipped from |0> to |1> or vice versa with a certain probability. In the script, this channel is used to illustrate the type of errors that can occur in quantum systems and how they can be addressed by quantum error correction techniques.

💡Redundancy

Redundancy in the context of the video refers to the technique of repeating information in a system to provide backup copies that can be used to correct errors. This concept is applied in both classical and quantum error correction, where the script explains how redundancy is introduced by encoding a single qubit into a three-qubit state.

💡Tensor Product

The Tensor Product is a mathematical operation that combines vectors from multiple vector spaces into a single vector space. In the script, it is used to describe how qubits are combined in a quantum system, particularly when encoding a single qubit into a three-qubit state for error correction.

💡No Cloning Theorem

The No Cloning Theorem states that it is impossible to create an identical copy of an arbitrary unknown quantum state. This theorem is mentioned in the script to explain why simple redundancy by copying quantum states is not possible and why more sophisticated encoding methods are required for quantum error correction.

💡Unitary Transformations

Unitary Transformations are a type of linear transformation that preserves the inner product in quantum mechanics. They are used to describe quantum operations, including the encoding process in quantum error correction. The script explains how the encoding of quantum information is achieved via unitary transformations.

💡Logical Qubits

Logical Qubits are a concept introduced in the script to represent the encoded quantum states within a quantum error correction code. They are distinct from physical qubits and are used to show how information is preserved across multiple physical qubits, allowing for error detection and correction.

💡Code Words

Code Words in the context of quantum error correction refer to the specific states that represent logical qubits within an error correction code. The script uses the terms '0l' and '1l' to denote the logical zero and one states, which are encoded as specific three-qubit states.

💡Entanglement

Entanglement is a quantum phenomenon where the state of one particle is dependent on the state of another, even when separated by large distances. The script mentions entanglement as a key resource for quantum error correction, particularly in the context of the three-qubit code.

💡IID (Independent and Identically Distributed)

IID refers to the assumption that errors in quantum systems occur independently and with the same statistical distribution. This assumption is crucial for the analysis of error correction in the script, as it simplifies the modeling of noise in quantum systems.

💡Error Detection

Error Detection is the process of identifying that an error has occurred in a quantum system. The script explains how the three-qubit code allows for the detection of single-qubit errors by transforming logical states into distinct, orthogonal states that can be measured and distinguished.

Highlights

Introduction of quantum error correction using a three-bit quantum code to correct for quantum bit flip channel.

Explanation of the quantum bit flip noise: ket 0 remains ket 0 with probability 1-p and flips to ket 1 with probability p, and vice versa for ket 1.

Redundancy is introduced by replacing ket 0 with three ket 0s and ket 1 with three ket 1s in a three-qubit system, creating an 8-dimensional vector space.

No cloning theorem prohibits naive replication of arbitrary superpositions, preventing direct copying of quantum states.

Correct encoding procedure involves mapping alpha |0⟩ + beta |1⟩ to a coherent superposition: alpha |000⟩ + beta |111⟩.

Logical qubits are introduced, represented as logical 0 (|000⟩) and logical 1 (|111⟩), forming the basis for encoding.

Unitary transformations, particularly the use of CNOT gates, are applied to transform and encode qubits.

Encoding circuit uses CNOT gates to entangle the qubits, creating a coherent superposition state.

Single qubit bit-flip noise model explained: noise acts independently on each qubit, with identity or X errors occurring on one or more qubits.

Eight possible error states are identified, including identity, single qubit, two qubit, and three qubit bit flip errors, with varying probabilities.

Focus on detecting and correcting single qubit errors, as they are the most probable type of error.

Single qubit errors transform logical states (|000⟩ and |111⟩) into distinct and mutually orthogonal three-qubit states.

Orthogonality of error-transformed states enables distinguishability, making error detection possible.

Entangled states play a key role in quantum error correction, highlighting the importance of entanglement in error resilience.

The three-qubit code allows for error detection by transforming quantum states into distinct, orthogonal forms that can be measured and corrected.

Transcripts

play00:01

[Music]

play00:13

okay in this final segment we will now

play00:15

discuss

play00:16

the framework of quantum error

play00:18

correction the technique of quantum

play00:20

error correction using the simple

play00:21

example of

play00:23

the so called

play00:25

three bit

play00:30

quantum code

play00:37

which

play00:39

corrects for

play00:41

the

play00:41

quantum bit flip channel

play00:53

so recall

play00:55

in the last segment we had introduced

play00:57

the idea of the quantum uh the quantum

play01:00

bit flip channel right and

play01:03

this was the effect of the channel

play01:05

uh on the basis states that is sched0

play01:07

and ket one remember that under the

play01:10

action of the quantum bit flip noise cat

play01:12

0 would remain kept 0 with probability 1

play01:16

minus p and k 0 would flip to get 1 with

play01:20

probability p

play01:21

similarly get 1 would flip to get 0 with

play01:24

probability p and it would remain

play01:29

get 1

play01:30

with probability 1 minus p

play01:33

right

play01:34

so this is the

play01:36

single

play01:38

quantum bit flip channel so

play01:41

recall what we did for the classical

play01:43

case where we said that we need to that

play01:46

one way of dealing with big flip errors

play01:48

would be to introduce redundancy so how

play01:50

do we introduce redundancy

play01:52

well this is the simplest thing to do

play01:55

right which is to take cat 0

play01:57

right

play01:58

and

play01:59

replace it with

play02:01

let's say three

play02:03

cad zeros

play02:05

in the quantum case what does this

play02:06

entail remember catch 0 is a state which

play02:09

lives in a 2 dimensional

play02:12

so this belongs to

play02:13

c 2 which is a 2 dimensional complex

play02:16

linear vector space

play02:17

but now this becomes

play02:20

a 3 qubit state

play02:23

right and this is something which

play02:25

belongs to

play02:28

three

play02:29

two dimensional complex linear vector

play02:32

spaces so the whole thing is actually an

play02:35

eight dimensional space

play02:40

it's an eight dimensional complex linear

play02:42

vector space or two to the three

play02:45

dimensional complex linear vector space

play02:48

right

play02:49

similarly we can now think of

play02:53

replacing the cat one

play02:56

by

play02:57

three cat ones

play02:59

so when i write these three cat zeros

play03:02

there is an implied tensor product here

play03:05

so this

play03:06

symbol denotes what is called a tensor

play03:08

product

play03:10

again we will not get too much into the

play03:11

details of this but the idea is that

play03:14

when you're putting together

play03:16

multiple quantum systems and remember

play03:18

we've spoken about

play03:19

um multi-party multi-qubit systems in

play03:22

week two right so this is essentially a

play03:25

three qubit system

play03:28

right and we are replacing a single

play03:30

qubit system with a three qubit system

play03:33

right and this

play03:35

is how we would introduce redundancy or

play03:37

how we would do the

play03:39

encoding

play03:40

right so we

play03:42

replace the single cat 0 with three cad

play03:45

zeros we replace the single cat one with

play03:48

three kit once but now the question is

play03:50

what happens to an arbitrary

play03:52

superposition in the classical case this

play03:54

was sufficient right a single zero

play03:55

replaced by three zeros a single one

play03:57

replaced by three ones but now arbitrary

play04:00

superpositions of zero and one are

play04:01

allowed in the quantum case so what do

play04:03

we do with alpha zero plus beta one

play04:06

can we do this operation where alpha

play04:09

zero plus beta one

play04:11

now becomes

play04:14

we replace this by

play04:16

alpha zero plus beta one

play04:29

we replace this by alpha 0 plus beta 1

play04:31

on 3 qubits

play04:34

well this is the kind of operation that

play04:36

is forbidden

play04:37

by

play04:38

the no cloning theorem

play04:41

the point is that this can be an

play04:43

arbitrary superposition any possible

play04:45

superposition of 0 and 1 could occur in

play04:48

our computation so when we encode

play04:50

quantum information you're not just

play04:52

encoding the ket 0 and the ket one

play04:54

rather you have the you need to have the

play04:56

ability to encode an arbitrary

play04:59

superposition of get 0 and get 1 not a

play05:01

fixed superposition if i am always going

play05:04

to have only a fixed

play05:05

state of the form 1 over root 2 0 plus 1

play05:08

over root 2 1 which is the plus state

play05:10

then of course i can find ways of making

play05:12

three plus states on three different

play05:15

qubits

play05:16

but now we're talking about encoding

play05:18

arbitrary superpositions

play05:21

and this cannot happen in this naive way

play05:25

of making three copies of an arbitrary

play05:27

superposition arbitrary superpositions

play05:30

cannot be copied this is forbidden by

play05:33

the no cloning theorem which was

play05:35

discussed in week two

play05:37

so how do we work around this

play05:40

so here's the way to work around it so

play05:43

the correct way to encode

play05:46

so

play05:49

so let me call this the correct

play05:52

encoding

play05:53

procedure

play05:59

is actually

play06:00

that alpha 0 plus beta 1

play06:04

gets mapped to alpha

play06:06

0 0 0

play06:09

plus

play06:10

beta

play06:11

1 1

play06:12

1.

play06:15

so we make a coherent superposition so

play06:18

this is what i would call a coherent

play06:19

superposition

play06:20

right so we make

play06:24

the same coherent superposition

play06:29

in the three qubit space

play06:37

and the claim is that this can somehow

play06:39

happen

play06:40

via unitary transformations because

play06:42

remember what we are allowed to do

play06:44

the gates that we are allowed to do are

play06:45

all unitary transformations right so how

play06:48

do we do this how can we

play06:51

do this encoding procedure in a unitary

play06:53

way i'll just show you the circuit but

play06:55

before that i want to note that what we

play06:57

are doing is actually replace

play07:02

our

play07:04

physical qubits

play07:08

which are the single qubits

play07:11

0 and 1

play07:13

right

play07:14

and in their place

play07:16

we are introducing

play07:18

the idea

play07:19

of logical qubits

play07:23

right

play07:24

which i will now denote as 0 with a

play07:26

subscript l and a ket 1 with a subscript

play07:30

l

play07:30

where

play07:31

the 0 with the subscript l is simply

play07:35

the 3 qubit state 0 0 0

play07:37

and the one with the subscript l is the

play07:40

three qubit state 1 1 1

play07:43

right

play07:44

if you want to quickly recall

play07:46

what these three qubit states look like

play07:49

remember

play07:50

that get 0 suppose was denoted by the

play07:53

column vector 1 0

play07:55

so

play07:56

if get 0 is this

play07:58

then

play07:59

this 3 qubit state

play08:01

is simply

play08:03

this outer product or tensor product

play08:07

right

play08:08

and

play08:10

this

play08:10

becomes an 8

play08:12

dimensional vector

play08:14

of the form

play08:16

right because this

play08:19

this outer product gives me a 4

play08:21

dimensional vector column vector 1 0 0 0

play08:24

and

play08:25

taking the outer product again with

play08:26

another one zero gives me

play08:28

this eight dimensional column vector

play08:30

with just one one and all zeros

play08:32

similarly you can write down the state

play08:34

corresponding to the three ones as an

play08:37

eight dimensional column vector with all

play08:38

zeros and just one one sitting at the

play08:40

last entry right so this is what our

play08:45

encoded

play08:47

state looks like

play08:51

okay and the other terminology that i

play08:53

would like to introduce here is these

play08:56

logical qubits are also called

play09:00

code words

play09:03

okay and just like how the single qubit

play09:06

state lives in a two dimensional vector

play09:08

space that is spanned by zero and one

play09:11

our encoded states or logical states or

play09:15

logical qubits live inside a two

play09:18

dimensional space that is spanned by

play09:20

zero logical and one logical and hence

play09:23

an arbitrary superposition of the form

play09:25

alpha zero plus beta one is to be

play09:27

replaced by the encoded superposition

play09:30

which is alpha zero zero zero plus beta

play09:32

one one one

play09:34

and now we address the question of how

play09:36

do we actually realize

play09:38

this encoding so i'm going to show you

play09:40

the encoding circuit

play09:42

while we show the encoding simply as

play09:46

a map from

play09:50

a single qubit state to

play09:52

this

play09:53

three qubit state

play09:56

the fact that this is unitarily realized

play09:58

means that this is actually a map or a

play10:01

transformation from three qubits to

play10:02

three qubits so it's actually a circuit

play10:05

with three input qubits and three output

play10:07

qubits right so the idea is

play10:10

the first qubit is the qubit that is

play10:12

carrying the information in the form of

play10:14

the superposition

play10:16

the second qubit

play10:17

and the third qubit are

play10:20

what are called

play10:21

ancillary qubits or

play10:24

ancillar qubits

play10:34

these are additional qubits which are

play10:36

initialized to zero

play10:38

and then unitarily this three qubit

play10:40

state is transformed to this

play10:42

superposition

play10:44

and the way this is done is basically

play10:46

using a very important gate

play10:49

namely the c naught gate okay so this is

play10:52

what the circuit looks like

play10:55

i have

play10:56

three registers

play11:00

the first qubit is

play11:05

in the state alpha zero

play11:14

the other two

play11:16

are the

play11:17

ancillar qubits

play11:24

the first qubit is what we often call

play11:26

the data qubit

play11:28

because that is the one that contains

play11:30

the information which is to be encoded

play11:33

and now how do we proceed with the

play11:35

circuit

play11:36

well we simply apply a pair of c naught

play11:39

gates

play11:40

and the claim is that this output state

play11:44

is now of the form

play11:46

alpha 0 0 0

play11:48

plus

play11:50

beta 1 1 1.

play11:52

so let's quickly check that so what

play11:54

happens after the action of the first c

play11:56

naught

play11:57

so let's do this circuit analysis step

play12:00

by step so after the first c naught

play12:10

we have the three qubit state

play12:13

alpha zero plus beta one

play12:16

tensor

play12:17

remember that the c naught gate flips

play12:20

the target so this is the control and

play12:21

this is the target and the c naught gate

play12:24

flips the target whenever the control is

play12:25

1. so

play12:26

this becomes

play12:28

alpha 0 0

play12:30

plus

play12:30

beta 1 1.

play12:38

tensor get zero

play12:40

right and this is the third ancillar

play12:42

qubit the second nonselective rather the

play12:44

third qubit in the circuit

play12:46

and

play12:47

after the second c naught

play12:53

we end up with the state

play12:55

now this zero gets flipped whenever the

play12:58

second qubit is set to one the second

play13:00

qubit has become the control qubit and

play13:02

whenever the second qubit is one this

play13:04

qubit has to get flipped so this becomes

play13:07

alpha

play13:08

0 0 0

play13:10

plus

play13:11

beta

play13:13

1 1 1

play13:15

as

play13:15

desired right so this from just the

play13:19

state some arbitrary state psi this has

play13:22

become the logical state side

play13:24

right so

play13:26

this is the final state that we want and

play13:28

this is how we've achieved the encoding

play13:29

and we've achieved the encoding in a via

play13:32

a quantum circuit right so this

play13:35

is the encoding circuit for the three

play13:38

qubit uh code

play13:40

right

play13:41

okay so now how does this help us

play13:43

of course one final point to note is

play13:45

that this final state that we have

play13:47

written out here

play13:48

this

play13:49

alpha 0 0 0 plus beta 1 1 1 is actually

play13:53

an entangled state

play13:55

since we have introduced the idea of

play13:57

entanglement briefly in week 2 this is

play13:59

an entangled state

play14:01

of

play14:02

three qubits

play14:03

right

play14:04

and this is where entanglement comes to

play14:06

our rescue

play14:07

we will now look at what happens to the

play14:09

state under the action of noise

play14:12

okay so now that we've gone from a

play14:14

single qubit to a three qubit scenario

play14:17

what can we say about the noise so we

play14:20

now have to look at

play14:23

the properties of the

play14:25

three qubit code

play14:30

first of course we recall the assumption

play14:32

that we make this was the assumption

play14:33

that was made even in the classical case

play14:35

that the noise is iid

play14:38

right what does this mean this means

play14:40

that the noise acts independently

play14:47

so the noise acts independently on each

play14:51

qubit

play14:55

and second it is

play14:58

identically distributed

play15:06

which means that the error probabilities

play15:08

are the same for every qubit

play15:11

so in the single qubit case remember

play15:14

that

play15:15

for the single qubit bit flip noise

play15:24

we could describe it in terms of

play15:27

two operators right there was either the

play15:30

x operator which happened with

play15:32

probability p

play15:35

and this is what we said you have the x

play15:37

error with probability p or you have

play15:39

identity

play15:41

with probability 1 minus p

play15:47

okay

play15:48

but now

play15:50

you have 3 cubit bit flip noise

play15:57

so

play15:58

what are the set of possible errors

play16:06

now on each qubit you could have either

play16:08

identity or x

play16:09

right which means that you have a set of

play16:12

eight possible errors now so what are

play16:14

these eight possible errors we can write

play16:16

them all down

play16:17

right so you could have identity on all

play16:20

three qubits and again i'm going to

play16:22

denote this

play16:23

by tensor product sometimes we can just

play16:25

drop the tensor product and write this

play16:26

as three identities because remember the

play16:28

noise is acting independently on every

play16:30

qubit

play16:32

you could have

play16:34

a single x error on the third qubit

play16:37

you could have

play16:39

a single x error on the second qubit

play16:42

and you could have a single x error on

play16:45

the first qubit

play16:47

now these errors all occur with

play16:50

probability p

play16:52

right so these three errors which are

play16:54

all the

play16:56

so called so this set is what we would

play16:58

call the set of

play17:00

single qubit errors right because this

play17:03

basically says there was an x error on

play17:05

the third qubit or the second qubit or

play17:06

the first qubit but only on one qubit

play17:09

right so these are the set of single

play17:10

qubit errors all of which occur

play17:14

with probability

play17:20

p

play17:23

right

play17:25

but the set of errors doesn't stop here

play17:28

it is not simply identity or single

play17:30

qubit errors you can of course have two

play17:32

bit flip errors so let's complete the

play17:34

set of errors now

play17:42

so the set of errors continues we can

play17:45

now have two bit flip errors so let's

play17:46

say you could have error

play17:48

on the second and the third qubit

play17:51

you could have error on the first

play17:54

and the second qubit

play17:58

and you could have errors on the first

play18:01

and the last two qubits right and this

play18:05

set of errors is what we would call

play18:08

the set of

play18:09

two qubit

play18:11

errors because now you have big flips

play18:13

occurring on

play18:15

two qubits and these occur

play18:17

with probability order p squared right

play18:21

and finally we also have the

play18:27

three qubit error which is the x error

play18:29

occurring on all three qubits so this is

play18:33

what we would call the

play18:36

three qubit error

play18:39

and this occurs with probability order p

play18:42

q

play18:43

and this completes

play18:45

our set of errors for the three qubit

play18:48

bit flip channel right this was of

play18:50

course also the case in the case of the

play18:52

classical

play18:54

bit flip error right and like in the

play18:56

classical case we are now going to argue

play18:58

that

play18:59

the single qubit errors are more likely

play19:01

than the two qubit which is more likely

play19:03

than the three qubit and so we are only

play19:05

going to focus our attention on

play19:06

correcting first of all detecting and

play19:08

correcting the single qubit with flip

play19:11

errors right so we're going to focus our

play19:13

attention only on the single qubit

play19:15

errors

play19:17

and like we said there's three of them

play19:18

right and then of course there's a

play19:20

possibility that the qubit remains

play19:22

unaffected

play19:25

by the error and this occurs with

play19:27

probability 1 minus p so just to

play19:29

complete i must say that this occurs

play19:31

with probability

play19:37

1 minus p the whole q

play19:39

right and you can of course check that

play19:41

the sum of all these probabilities must

play19:43

um sum to 1

play19:45

right so i have 3 p squared here i have

play19:48

1 p cube here and then i have 3 here

play19:51

right okay

play19:53

fine

play19:55

so now how do we detect or how does this

play19:58

three qubit encoded state help us detect

play20:01

the single qubit errors so the next

play20:03

thing to look at is what how do the

play20:07

single qubit errors affect the so the

play20:10

what is the effect of

play20:14

the single qubit

play20:22

errors

play20:31

well so let's look at the

play20:35

let's actually look at just the basis

play20:37

states right the logical states or the

play20:39

code words so let me only look at

play20:43

the logical states

play20:46

sorry the logical

play20:48

cubit

play20:51

states

play20:54

0l

play20:56

which is

play20:57

0 0 0

play20:59

and

play21:00

1l

play21:02

which is 1 1 1.

play21:06

so what happens to 0 0 0 under the

play21:09

action of the single bit flip errors

play21:12

well the third qubit could get flipped

play21:15

so

play21:16

this

play21:17

could become this

play21:19

i could have the second qubit

play21:22

getting flipped

play21:23

so

play21:24

this would become this

play21:27

and i could have

play21:28

the first qubit getting flipped

play21:35

so these are the possible output states

play21:38

after the action of the single qubit

play21:40

error

play21:40

on

play21:41

the zero zero zero state or the logical

play21:43

zero state similarly we can work out

play21:46

what happens to the logical one state

play21:48

and again

play21:50

i could have the third

play21:52

qubit getting flipped to a zero i could

play21:54

have the middle qubit getting flipped to

play21:56

a zero or the first qubit getting

play21:59

flipped to a 0. note that i am not

play22:01

explicitly writing the tensor product

play22:03

here but it is implied everywhere ok

play22:06

so these are the set of possible states

play22:09

now what do we notice about these states

play22:11

like in the case of the classical

play22:14

three bit

play22:15

the classical three bit code

play22:18

the 0 0 0 and the 1 1 1 are getting

play22:20

mapped to distinct states right so this

play22:23

state corresponds to a classical bit

play22:25

string 0 0 1 this corresponds to 0 1 0

play22:27

and this corresponds to 1 0 0

play22:30

1 1 0 1 0 1 0 1 1 so all of them are

play22:33

basically distinct

play22:36

states

play22:39

in the

play22:40

three qubit space

play22:46

they're all distinct three qubit states

play22:48

and therefore exactly like in the case

play22:51

of the classical bit flip code or the

play22:52

classical repetition code

play22:54

this set of six states can be

play22:56

distinguished and detected so

play22:59

let me just note this point that

play23:02

the

play23:05

single qubit errors

play23:12

transform

play23:14

the

play23:17

logical states

play23:19

that's the logical zero and the logical

play23:22

one

play23:24

to

play23:26

distinct

play23:28

this very important

play23:31

three qubit states in fact

play23:35

this set of three qubit states that i

play23:36

have marked here are actually all

play23:39

mutually orthogonal

play23:46

right because they correspond to

play23:48

distinct states their distinct bit

play23:49

strings right so they are mutually

play23:51

orthogonal which means if i take the

play23:52

inner product between this three

play23:55

qubit state with any of the other three

play23:56

qubit states i get zero

play23:58

and because they are mutually orthogonal

play24:00

they are distinguishable

play24:03

okay

play24:08

so this is the key property of the three

play24:12

qubit

play24:13

code which helps us in error detection

Rate This

5.0 / 5 (0 votes)

関連タグ
Quantum ComputingError CorrectionQubit CodeQuantum BitsUnitary GatesBit FlipQuantum CircuitNo Cloning TheoremQuantum NoiseQuantum Entanglement
英語で要約が必要ですか?