Quantum Computing Lecture 22 Michele Mosca. Correcting Phase Errors l Suppose the environment effects error on our quantum computer, where This is a description.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Quantum Software Copy-Protection Scott Aaronson (MIT) |
Computing with adversarial noise Aram Harrow (UW -> MIT) Matt Hastings (Duke/MSR) Anup Rao (UW)
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
Quantum Computing MAS 725 Hartmut Klauck NTU
II. Linear Block Codes. © Tallal Elshabrawy 2 Last Lecture H Matrix and Calculation of d min Error Detection Capability Error Correction Capability Error.
11111 arXiv: Codeword stabilized quantum codes (CWS codes for short) Graeme Smith IBM TJ Watson Research Center Joint with: Andrew Cross John.
Quantum Error Correction Joshua Kretchmer Gautam Wilkins Eric Zhou.
Quantum Error Correction SOURCES: Michele Mosca Daniel Gottesman Richard Spillman Andrew Landahl.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Error Correction Daniel Gottesman Perimeter Institute.
Quantum Error Correction Michele Mosca. Quantum Error Correction: Bit Flip Errors l Suppose the environment will effect error (i.e. operation ) on our.
Reversible Computation Computational Group Theory and Circuit Synthesis.
DIGITAL COMMUNICATION Coding
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
Grover. Part 2. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z O is an Oracle H is Hadamards H.
Quantum Computation and Error Correction Ali Soleimani.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Review from last lecture: A Simple Quantum (3,1) Repetition Code
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
Dirac Notation and Spectral decomposition Michele Mosca.
CSEP 590tv: Quantum Computing
Quantum Error Correction: Andrew Landahl David Gottesman Dr. Wu And others.
BB84 Quantum Key Distribution 1.Alice chooses (4+  )n random bitstrings a and b, 2.Alice encodes each bit a i as {|0>,|1>} if b i =0 and as {|+>,|->}
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
Advanced Computer Architecture Lab University of Michigan Quantum Noise and Distance Patrick Cassleman More Quantum Noise and Distance Measures for Quantum.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
Lo-Chau Quantum Key Distribution 1.Alice creates 2n EPR pairs in state each in state |  00 >, and picks a random 2n bitstring b, 2.Alice randomly selects.
Dirac Notation and Spectral decomposition
Ger man Aerospace Center Gothenburg, April, 2007 Coding Schemes for Crisscross Error Patterns Simon Plass, Gerd Richter, and A.J. Han Vinck.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Overview Part 1 – Design Procedure 3-1 Design Procedure
Hamming Code Rachel Ah Chuen. Basic concepts Networks must be able to transfer data from one device to another with complete accuracy. Data can be corrupted.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Alice and Bob’s Excellent Adventure
DIGITAL COMMUNICATION Error - Correction A.J. Han Vinck.
Quantum Error Correction Daniel Gottesman Perimeter Institute.
ERROR CONTROL CODING Basic concepts Classes of codes: Block Codes
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
CS717 Algorithm-Based Fault Tolerance Matrix Multiplication Greg Bronevetsky.
DIGITAL COMMUNICATIONS Linear Block Codes
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 20 (2009)
Quantum Cryptography Slides based in part on “A talk on quantum cryptography or how Alice outwits Eve,” by Samuel Lomonaco Jr. and “Quantum Computing”
ADVANTAGE of GENERATOR MATRIX:
Information Theory Linear Block Codes Jalal Al Roumy.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
CSEP 590tv: Quantum Computing Dave Bacon July 20, 2005 Today’s Menu n Qubit registers Begin Quantum Algorithms Administrivia Superdense Coding Finish Teleportation.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
The parity bits of linear block codes are linear combination of the message. Therefore, we can represent the encoder by a linear system described by matrices.
Perfect and Related Codes
Some Computation Problems in Coding Theory
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Data Communications and Networking
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
Fidelities of Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Qubits, von Neumann Measurement, Quantum.
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture (2011)
MEGGIT DECODER. PROBLEM STATEMENT To correct all single errors in n-bit codeword, n error patterns of single errors and their corresponding syndromes.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
A low cost quantum factoring algorithm
Quantum Error Correction
Information Redundancy Fault Tolerant Computing
Linear Algebra Lecture 6.
EGR 2131 Unit 12 Synchronous Sequential Circuits
Presentation transcript:

Quantum Computing Lecture 22 Michele Mosca

Correcting Phase Errors l Suppose the environment effects error on our quantum computer, where This is a description of errors in phase because we use powers of operator Z

Quantum Error Correction l We can encode l Consider error termacting on the logical 0 gives Z error in upper bit Such error arriving in decoder is shown next slide

Quantum Error Correction error Please observe repetitions of these patterns

Equivalently, cancelling pairs of H inside the diagram we get Final circuit for correcting phase errors

Quantum Error Correction l If the error effected on the system in state is of the form

Quantum Error Correction l and if the state only consists of mixtures of superpositions of codewords and then the correction procedure (call it ) will map

Correcting both phase errors and bit flip errors l Consider the codewords of Shor’s code l We can easily correct any single X- error in one of the 3 three-bit parts l We can then also correct a single Z- error on one of the 9 qubits. l This means we can also correct Y-errors on one of the 9 qubits

Quantum Error Correction l Theorem 10.2: Suppose C is a quantum code and is the error-correction operation constructed in the proof of Theorem 10.1 to recover from a noise process with operation elements. Suppose is a quantum operation with elements which are linear combinations of the. Then the error correction operation also corrects the effects of the noise process on the code C.

Correcting any error l Since any error operator E k can be written as a linear combination of I,X,Z and Y, then the same procedure will correct ANY error acting on just 1 of the 9 qubits. l If where is a quantum operator whose operator terms are correctable with correction operator, then

Correcting any error l Theorem 10.1 (Quantum Error Correction Conditions) Let C be a quantum code, and let P be the projector onto C. Suppose is a quantum operation with operation elements A necessary and sufficient condition for the existence of an error-correction operation correcting on C is that for some Hermitian matrix of complex numbers. l (no mention of efficiency)

Degenerate Codes l Consider the 9-qubit code. l A single Z-error on the first qubit of a codeword produces the same outcome as a single Z-error on either the 2 nd or 3 rd qubit. l The correction procedure will correct these errors regardless l A degenerate code is one where two correctable errors produce the same effect on the codewords (this is impossible with classical codes).

Quantum Hamming Bound l Any non-degenerate quantum error correcting code that encodes k logical qubits into n qubits and can correct errors on up to t qubits must have l If t=k=1, we get (there exists a 5- qubit code that accomplishes this)