QuantumErrorCorrection.pptVIP

Quantum Errors PROBLEM: When computing with a quantum computer, you can’t look at what the computer is doing You are only allowed to look at the end RESULT: What happens if an error is introduced during calculation? SOLUTION: We need some sort of quantum error detection/correction procedure Classical Error Codes In standard digital systems bits are added to a data word in order to detect/correct errors A code is e-error detecting if any fault which causes at most e bits to be erroneous can be detected A code is e-error correcting if for any fault which causes at most e erroneous bits, the set of all correct bits can be automatically determined The Hamming Distance, d, of a code is the minimum number of bits in which any two code words differ the error detecting/correcting capability of a code depends on the value of d Parity Checking PROCESS: Add an extra bit to a word before transmitting to make the total number of bits even or odd (even or odd parity) at the receiving end, check the number of bits for even or odd parity It will detect a single bit error Cost: extra bit Example: Transmit the 8-bit data word 1 0 1 1 0 0 0 1 Even parity version: 1 0 1 1 0 0 0 1 0 Odd parity version: 1 0 1 1 0 0 0 1 1 Classical Error Correcting Codes Suppose errors in our physical system for storing 0 and 1 cause each physical bit to be toggled independently with probability p We can reduce the probability of error to be in by using a “repetition code” e.g. : encode a logical 0 with the state 000 and a logical 1 with the state 111 Reversible networks for encoding and decoding a single bit “b” Classical Error Correcting Codes After the errors occur, decode the logical bits by taking the majority answer of the three bits and correct the encoded bits So Classical Error Correcting Codes As long as less than 2 errors occurred, we will keep the correct value of the logical bit The probability of 2 or more errors is (which is less than p if