![]()
The encoding is simply to repeat the bit to be transmitted three times, and decoding is just taking the most frequently appearing bit (which is the same as computing the majority function). Quantum error correction course u of a code#Possibly the simplest example of an error correcting code is the 3 bit repetition code. What can they do? The answer is that they can use an error correcting code to decrease the probability of error. ![]() Suppose that Alice needs to send a very important bit to Bob, and the two of them do not wish to accept that Bob will receive the wrong bit with probability p. Specifically, we suppose that the noise is parameterized some real number p that represents the probability of an error: if Alice sends the bit b, then Bob receives b with probability 1 p and with probability p: ! b with probability 1 p b with probability p. There is noise on the channel, so the bit sent Alice is not always received correctly Bob. Here, we have a channel from Alice to Bob that carries 1 bit at a time. Initially, just for the sake of having a concrete error model to think about, we will consider errors described the binary symmetric channel. Classical repetition codes We will start with a very simple classical error correcting code, the 3 bit repetition code. In this lecture and the next, we will discuss quantum error correction, which aims to protect quantum information against such errors. Preview text CPSC Quantum Computation John Watrous, University of Calgary Lecture 16: Quantum error correction MaAny physical realization of a quantum computer is likely to be susceptible to errors (such as noise and cannot build perfect physical systems and isolate them from their environments while still maintaining control over them.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |