Solution 4 for USTC class Physics of Quantum Information

Size: px
Start display at page:

Download "Solution 4 for USTC class Physics of Quantum Information"

Transcription

1 Solution 4 for USTC class Physics of Quantum Information Shuai Zhao, Xin-Yu Xu, Kai Chen National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, , P.R. China 1. Please write down the difference between quantum error correction and classical error correction. Read page 3-6 in the lecture QIP2018chapt 5 1 Kai Chen.pdf for reference. 2. (1) Please write down the qunatum error-correction condition. (2) Consider the three qubit bit filp code, with corresponding projector P = The noise process that this code protects against has operation elements { (1 p) 3 I, p(1 p) 2 X 1, p(1 p) 2 X 2, p(1 p) 2 X 3 }, where p is the probability that one bit filps. Note that this quantum operation is not trace-preserving, since we have omitted operation elements corresponding to bit flips on two and three qubits. Verify the quantum error-correction conditions for this code and noise process. (1) Read page in the lecture QIP2018chapt 5 1 Kai Chen.pdf for reference. (2) The operation elements of the noise process is {E 0, E 1, E 2, E 3 }, where E 0 = (1 p) 3 I and E i = p(1 p) 2 X i for i = 1, 2, 3. If i j, P X i X jp = 0, if i = j, P X i X jp = P 2 = P. So P E i E jp = α ij P, in which α 00 = (1 p) 3, α ii = p(1 p) 5 for i = 1, 2, 3 and α ij = 0(i j). α is an Hermitian matrix, so the three qubit bit filp code and noise process satisfies the quantum error-correction conditions.

2 2 3. (1) For 4-qubit GHZ state ψ = ( ) / 2, please write down its linearly independent stabilizers. (2) For 4-qubit cluster state ψ = ( )/2, please write down its linearly independent stabilizers. (1) An example is as following: g 1 = ZZII, g 2 = IZZI, g 3 = IIZZ, g 4 = XXXX. (Other answers are welcome.) (2) g 1 = XZII, g 2 = ZXZI, g 3 = IZXZ, g 4 = IIZX. 4. Please draw the quantum circuit of the 3-qubit bit flip code, and certify that it can encode the qubit a 0 + b 1 to a b 111. The quantum circuit is as following: The encoding progress is as following: ψ 0 0 = (a 0 + b 1 ) 0 0 C-NOT GGGGGGGGGGA(a 00 + b 11 ) 0 C-NOT GGGGGGGGGGA(a b 111 ) (1) 5. For 9-qubit Shor code, its logical bit code is 0 L = ( )( )( )/2 2,

3 3 1 L = ( )( )( )/2 2. (1) Please give all the generators of the stabilizers; (2) Please draw the encoding quantum circuit; (3) For a bit/phase flip error of a certain bit, how to detect and correct it? Please take the bit flip error and phase flip error for example, write down the program of error detection and correction. (1) The generators of the stabilizers are as following: (2) The encoding quantum circuit is as following:

4 4 (3) Please read page 433 of Nielsen s Quantum Computation and Quantum Information, or page 80 of the Chinese version translated by Qian-Chuan Zhao. 6. Please write down a group of universial quantum logical gate set. A group of universial quantum logical gate set is as following: T(45-degree rotation of Z), H(Hadamard gate), C-NOT. 7. Please write down the DiVincenzo criterion that quantum computer implementation must satisfy. (1) Scalability: A scalable physical system with well characterized parts, usually qubits. (2) Initialization: The ability to initialize the system in a simple fiducial state. (3) Control: The ability to control the state of the computer using sequences of elementary universal gates. (4) Stability: Decoherence times much longer than gate times, together with the

5 ability to suppress decoherence through error correction and fault-tolerant computation. (5) Measurement:The ability to read out the state of the computer in a convenient product basis. 8. Please write down the matrix form of the C-NOT gate, and the state resulting from the application of this gate to four Bell states. The matrix form of the C-NOT gate is as following: Denote the four Bell states as β xy = 0, y + ( 1)x 1, ȳ 2 5, then C-NOT( β 00 ) = ( ) 0 / 2 C-NOT( β 01 ) = ( ) 1 / 2 C-NOT( β 10 ) = ( 0 1 ) 0 / 2 C-NOT( β 11 ) = ( 0 1 ) 1 / 2 9. Please construct the quantum SWAP gate to swap two qubits using the C-NOT gate. The circuit swapping two qubits is as following: To see that this circuit accomplishes the swap operation, note that the sequence of gates has the following sequence of effects on a computational basis state a, b,

6 6 where all additions are done modulo Please design a quantum circuit which converts the state 00, 01, 10, 11 into four Bell states. The quantum circuit to create Bell state is as following: The proof is omitted. 11. Please design a quantum circuit to perform full Bell state measurement, i.e. to distinguish four Bell states by projective measurement at 0, 1 basis. The quantum circuit to perform full Bell state measurement is as following: The proof is omitted. 12. Please draw the quantum circuit of Deutsch algorithm, and analysis how it works. Please read page of lecture QIP2018chapt 6 1 Kai Chen.pdf for reference.

Lectures on Fault-Tolerant Quantum Computation

Lectures on Fault-Tolerant Quantum Computation Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface

More information

Teleportation-based approaches to universal quantum computation with single-qubit measurements

Teleportation-based approaches to universal quantum computation with single-qubit measurements Teleportation-based approaches to universal quantum computation with single-qubit measurements Andrew Childs MIT Center for Theoretical Physics joint work with Debbie Leung and Michael Nielsen Resource

More information

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p. Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell

More information

D.5 Quantum error correction

D.5 Quantum error correction D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the

More information

What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.

What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd. What is a quantum computer? Quantum Architecture by Murat Birben A quantum computer is a device designed to take advantage of distincly quantum phenomena in carrying out a computational task. A quantum

More information

Introduction to Quantum Error Correction

Introduction to Quantum Error Correction Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors

More information

phys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference

phys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)

More information

Talk by Johannes Vrana

Talk by Johannes Vrana Decoherence and Quantum Error Correction Talk by Johannes Vrana Seminar on Quantum Computing - WS 2002/2003 Page 1 Content I Introduction...3 II Decoherence and Errors...4 1. Decoherence...4 2. Errors...6

More information

IBM quantum experience: Experimental implementations, scope, and limitations

IBM quantum experience: Experimental implementations, scope, and limitations IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various

More information

Quantum computing and mathematical research. Chi-Kwong Li The College of William and Mary

Quantum computing and mathematical research. Chi-Kwong Li The College of William and Mary and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to

More information

X row 1 X row 2, X row 2 X row 3, Z col 1 Z col 2, Z col 2 Z col 3,

X row 1 X row 2, X row 2 X row 3, Z col 1 Z col 2, Z col 2 Z col 3, 1 Ph 219c/CS 219c Exercises Due: Thursday 9 March 2017.1 A cleaning lemma for CSS codes In class we proved the cleaning lemma for stabilizer codes, which says the following: For an [[n, k]] stabilizer

More information

arxiv:quant-ph/ v3 19 May 1997

arxiv:quant-ph/ v3 19 May 1997 Correcting the effects of spontaneous emission on cold-trapped ions C. D Helon and G.J. Milburn Department of Physics University of Queensland St Lucia 407 Australia arxiv:quant-ph/9610031 v3 19 May 1997

More information

Quantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction

Quantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute The Classical and Quantum Worlds Quantum Errors A general quantum error is a superoperator: ρ ΣA k ρ A k (Σ A k A k = I)

More information

Some Introductory Notes on Quantum Computing

Some Introductory Notes on Quantum Computing Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best

More information

6. Quantum error correcting codes

6. Quantum error correcting codes 6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome

More information

Quantum Technology 101: Overview of Quantum Computing and Quantum Cybersecurity

Quantum Technology 101: Overview of Quantum Computing and Quantum Cybersecurity Quantum Technology 0: Overview of Quantum Computing and Quantum Cybersecurity Warner A. Miller* Department of Physics & Center for Cryptography and Information Security Florida Atlantic University NSF

More information

Surface Code Threshold in the Presence of Correlated Errors

Surface Code Threshold in the Presence of Correlated Errors Surface Code Threshold in the Presence of Correlated Errors USP-São Carlos - 2013 E. Novais, P. Jouzdani, and E. Mucciolo CCNH Universidade Federal do ABC Department of Physics University of Central Florida

More information

More advanced codes 0 1 ( , 1 1 (

More advanced codes 0 1 ( , 1 1 ( p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of

More information

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails

More information

Logical error rate in the Pauli twirling approximation

Logical error rate in the Pauli twirling approximation Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)

More information

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical

More information

Suppression of the low-frequency decoherence by motion of the Bell-type states Andrey Vasenko

Suppression of the low-frequency decoherence by motion of the Bell-type states Andrey Vasenko Suppression of the low-frequency decoherence by motion of the Bell-type states Andrey Vasenko School of Electronic Engineering, Moscow Institute of Electronics and Mathematics, Higher School of Economics

More information

QUANTUM COMPUTATION. Exercise sheet 1. Ashley Montanaro, University of Bristol H Z U = 1 2

QUANTUM COMPUTATION. Exercise sheet 1. Ashley Montanaro, University of Bristol H Z U = 1 2 School of Mathematics Spring 017 QUANTUM COMPUTATION Exercise sheet 1 Ashley Montanaro, University of Bristol ashley.montanaro@bristol.ac.uk 1. The quantum circuit model. (a) Consider the following quantum

More information

Lecture 2, March 2, 2017

Lecture 2, March 2, 2017 Lecture 2, March 2, 2017 Last week: Introduction to topics of lecture Algorithms Physical Systems The development of Quantum Information Science Quantum physics perspective Computer science perspective

More information

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).

More information

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding. CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as

More information

P 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0

P 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0 (two-qubit gate): tools: optical dipole force P 3/2 P 1/2 F = -1.5 F n=3 n=3 n=0 S 1/2 n=0 optical dipole force is state dependent tools: optical dipole force (e.g two qubits) ω 2 k1 d ω 1 optical dipole

More information

Quantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto

Quantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto Quantum error correction on a hybrid spin system Christoph Fischer, Andrea Rocchetto Christoph Fischer, Andrea Rocchetto 17/05/14 1 Outline Error correction: why we need it, how it works Experimental realization

More information

Universality of single quantum gates

Universality of single quantum gates Universality of single quantum gates Bela Bauer 1, Claire Levaillant 2, Michael Freedman 1 arxiv:1404.7822v3 [math.gr] 20 May 2014 1 Station Q, Microsoft Research, Santa Barbara, CA 93106-6105, USA 2 Department

More information

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005 Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron

More information

Introduction to Quantum Information Processing

Introduction to Quantum Information Processing Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the

More information

arxiv:quant-ph/ v2 23 Aug 2003

arxiv:quant-ph/ v2 23 Aug 2003 An Architecture of Deterministic Quantum Central Processing Unit arxiv:quant-ph/0207032v2 23 Aug 2003 Fei Xue a, Zeng-Bing Chen a Mingjun Shi a Xianyi Zhou a Jiangfeng Du a Rongdian Han a a Department

More information

One-Way Quantum Computing Andrew Lopez. A commonly used model in the field of quantum computing is the Quantum

One-Way Quantum Computing Andrew Lopez. A commonly used model in the field of quantum computing is the Quantum One-Way Quantum Computing Andrew Lopez A commonly used model in the field of quantum computing is the Quantum Circuit Model. The Circuit Model can be thought of as a quantum version of classical computing,

More information

Energetics and Error Rates of Self-Correcting Quantum Memories

Energetics and Error Rates of Self-Correcting Quantum Memories Energetics and Error Rates of Self-Correcting Quantum Memories John Schulman Quantum codes allow for the robust storage of quantum information despite interaction with the environment. In a quantum code,

More information

Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator

Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator Projects about Quantum adder circuits Final examination June 2018 Quirk Simulator http://algassert.com/2016/05/22/quirk.html PROBLEM TO SOLVE 1. The HNG gate is described in reference: Haghparast M. and

More information

Limitations on transversal gates

Limitations on transversal gates Limitations on transversal gates Michael Newman 1 and Yaoyun Shi 1,2 University of Michigan 1, Alibaba Group 2 February 6, 2018 Quantum fault-tolerance Quantum fault-tolerance Quantum fault-tolerance Quantum

More information

Bounds on Quantum codes

Bounds on Quantum codes Bounds on Quantum codes No go we cannot encode too many logical qubits in too few physical qubits and hope to correct for many errors. Some simple consequences are given by the quantum Hamming bound and

More information

Lecture 1: Introduction to Quantum Computing

Lecture 1: Introduction to Quantum Computing Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These

More information

Witnessing Genuine Many-qubit Entanglement with only Two Local Measurement Settings

Witnessing Genuine Many-qubit Entanglement with only Two Local Measurement Settings Witnessing Genuine Many-qubit Entanglement with only Two Local Measurement Settings Géza Tóth (MPQ) Collaborator: Otfried Gühne (Innsbruck) uant-ph/0405165 uant-ph/0310039 Innbruck, 23 June 2004 Outline

More information

arxiv:quant-ph/ v3 11 Mar 2004

arxiv:quant-ph/ v3 11 Mar 2004 ariv:quant-ph/040148v3 11 ar 004 Generalized G States and Distributed Quantum Computing Anocha Yimsiriwattana and Samuel J. Lomonaco Jr. Abstract. A key problem in quantum computing is finding a viable

More information

Decodiy for surface. Quantum Error Correction. path integral. theory versus. Decoding for GKP code. experiment. Correcting

Decodiy for surface. Quantum Error Correction. path integral. theory versus. Decoding for GKP code. experiment. Correcting Quantum Error Correction 1 3X 1100 ( 230 ntro : theory versus experiment Quantum Error i Bosonic Codes # } \ Correcting Conditions stalilizer Codes ( including conthuoqsoyueagjask \ # Decoding Decoding

More information

Quantum gate. Contents. Commonly used gates

Quantum gate. Contents. Commonly used gates Quantum gate From Wikipedia, the free encyclopedia In quantum computing and specifically the quantum circuit model of computation, a quantum gate (or quantum logic gate) is a basic quantum circuit operating

More information

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes Dave Bacon Department of Computer Science & Engineering, University of Washington In the last lecture we learned of the quantum error

More information

6.896 Quantum Complexity Theory September 18, Lecture 5

6.896 Quantum Complexity Theory September 18, Lecture 5 6.896 Quantum Complexity Theory September 18, 008 Lecturer: Scott Aaronson Lecture 5 Last time we looked at what s known about quantum computation as it relates to classical complexity classes. Today we

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 1: Introduction 18th September 2017 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information by Michael

More information

Quantum Computing with Very Noisy Gates

Quantum Computing with Very Noisy Gates Quantum Computing with Very Noisy Gates Produced with pdflatex and xfig Fault-tolerance thresholds in theory and practice. Available techniques for fault tolerance. A scheme based on the [[4, 2, 2]] code.

More information

Quantum computing! quantum gates! Fisica dell Energia!

Quantum computing! quantum gates! Fisica dell Energia! Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!

More information

ADIABATIC PREPARATION OF ENCODED QUANTUM STATES

ADIABATIC PREPARATION OF ENCODED QUANTUM STATES ADIABATIC PREPARATION OF ENCODED QUANTUM STATES Fernando Pastawski & Beni Yoshida USC Los Angeles, June 11, 2014 QUANTUM NOISE Storing single observable not enough. Decoherence deteriorates quantum observables.

More information

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1

More information

Short Course in Quantum Information Lecture 8 Physical Implementations

Short Course in Quantum Information Lecture 8 Physical Implementations Short Course in Quantum Information Lecture 8 Physical Implementations Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture : Intro

More information

A scheme for protecting one-qubit information against erasure. error. Abstract

A scheme for protecting one-qubit information against erasure. error. Abstract A scheme for protecting one-qubit information against erasure error Chui-Ping Yang 1, Shih-I Chu 1, and Siyuan Han 1 Department of Chemistry, University of Kansas, and Kansas Center for Advanced Scientific

More information

Experimental violation of multipartite Bell inequalities with trapped ions

Experimental violation of multipartite Bell inequalities with trapped ions Experimental violation of multipartite Bell inequalities with trapped ions B. P. Lanyon 1,2, M. Zwerger 3, P. Jurcevic 1,2, C. Hempel 1,2, W. Dür 3, H. J. Briegel 1,3, R. Blatt 1,2, and C. F. Roos 1,2

More information

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction

More information

Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles

Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles

More information

Lecture 3: Hilbert spaces, tensor products

Lecture 3: Hilbert spaces, tensor products CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second

More information

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing based on quantum error-correcting codes Quantum secret sharing based on quantum error-correcting codes Zhang Zu-Rong( ), Liu Wei-Tao( ), and Li Cheng-Zu( ) Department of Physics, School of Science, National University of Defense Technology,

More information

QUANTUM COMPUTING 10.

QUANTUM COMPUTING 10. QUANTUM COMPUTING 10. Jozef Gruska Faculty of Informatics Brno Czech Republic December 20, 2011 10. QUANTUM ERROR CORRECTION CODES Quantum computing based on pure states and unitary evolutions is an idealization

More information

MP 472 Quantum Information and Computation

MP 472 Quantum Information and Computation MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density

More information

Quantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.

Quantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft. Quantum Algorithms Andreas Klappenecker Texas A&M University Lecture notes of a course given in Spring 003. Preliminary draft. c 003 by Andreas Klappenecker. All rights reserved. Preface Quantum computing

More information

Principles of Quantum Mechanics Pt. 2

Principles of Quantum Mechanics Pt. 2 Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The

More information

Chapter 10. Quantum algorithms

Chapter 10. Quantum algorithms Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,

More information

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis

More information

Physics ; CS 4812 Problem Set 4

Physics ; CS 4812 Problem Set 4 Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +

More information

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and

More information

Quantum Computation. Michael A. Nielsen. University of Queensland

Quantum Computation. Michael A. Nielsen. University of Queensland Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum

More information

CS120, Quantum Cryptography, Fall 2016

CS120, Quantum Cryptography, Fall 2016 CS10, Quantum Cryptography, Fall 016 Homework # due: 10:9AM, October 18th, 016 Ground rules: Your homework should be submitted to the marked bins that will be by Annenberg 41. Please format your solutions

More information

QLang: Qubit Language

QLang: Qubit Language QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated

More information

Quantum Error Correction Codes - From Qubit to Qudit

Quantum Error Correction Codes - From Qubit to Qudit Quantum Error Correction Codes - From Qubit to Qudit Xiaoyi Tang Paul McGuirk December 7, 005 1 Introduction Quantum computation (QC), with inherent parallelism from the superposition principle of quantum

More information

Lecture 2: From Classical to Quantum Model of Computation

Lecture 2: From Classical to Quantum Model of Computation CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic

More information

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i. CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy

More information

92 CHAPTER III. QUANTUM COMPUTATION. Figure III.11: Diagram for swap (from NC).

92 CHAPTER III. QUANTUM COMPUTATION. Figure III.11: Diagram for swap (from NC). 92 CHAPTER III. QUANTUM COMPUTATION Figure III.11: Diagram for swap (from NC). C.3 Quantum circuits 1. Quantum circuit: A quantum circuit isa sequential seriesofquantum transformations on a quantum register.

More information

arxiv:quant-ph/ Oct 2002

arxiv:quant-ph/ Oct 2002 Measurement of the overlap between quantum states with the use of coherently addressed teleportation Andrzej Grudka* and Antoni Wójcik** arxiv:quant-ph/00085 Oct 00 Faculty of Physics, Adam Mickiewicz

More information

A relational quantum computer using only twoqubit total spin measurement and an initial supply of highly mixed single-qubit states

A relational quantum computer using only twoqubit total spin measurement and an initial supply of highly mixed single-qubit states A relational quantum computer using only twoqubit total spin measurement and an initial supply of highly mixed single-qubit states To cite this article: Terry Rudolph and Shashank Soyuz Virmani 2005 New

More information

The Classification of Clifford Gates over Qubits

The Classification of Clifford Gates over Qubits The Classification of Clifford Gates over Qubits Daniel Grier, Luke Schaeffer MIT Introduction Section 1 Introduction Classification Introduction Idea Study universality by finding non-universal gate sets.

More information

Single qubit + CNOT gates

Single qubit + CNOT gates Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose

More information

Ph 219b/CS 219b. Exercises Due: Wednesday 22 February 2006

Ph 219b/CS 219b. Exercises Due: Wednesday 22 February 2006 1 Ph 219b/CS 219b Exercises Due: Wednesday 22 February 2006 6.1 Estimating the trace of a unitary matrix Recall that using an oracle that applies the conditional unitary Λ(U), Λ(U): 0 ψ 0 ψ, 1 ψ 1 U ψ

More information

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca

More information

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation

More information

Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants

Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants David Rosenbaum, Marek Perkowski Portland State University, Department of Computer Science Portland State University, Department

More information

Lecture 2, March 1, 2018

Lecture 2, March 1, 2018 Lecture 2, March 1, 2018 Last week: Introduction to topics of lecture Algorithms Physical Systems The development of Quantum Information Science Quantum physics perspective Computer science perspective

More information

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July-2015 1350 Measure of entanglement by Singular Value decomposition Nikolay Raychev Abstract his report describes an approach

More information

Channel-Adapted Quantum Error Correction. Andrew Stephen Fletcher

Channel-Adapted Quantum Error Correction. Andrew Stephen Fletcher Channel-Adapted Quantum Error Correction by Andrew Stephen Fletcher Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree

More information

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students

More information

Quantum Computer Architecture

Quantum Computer Architecture Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can

More information

Multipath and polarization entanglement of photons

Multipath and polarization entanglement of photons Multipath and polarization entanglement of photons. Chiuri, G. Vallone*, P. Mataloni Quantum Optics Group, Dipartimento di Fisica Sapienza Università di Roma, 0085, Italy INO CNR, 5025 Firenze, Italy *

More information

IBM Systems for Cognitive Solutions

IBM Systems for Cognitive Solutions IBM Q Quantum Computing IBM Systems for Cognitive Solutions Ehningen 12 th of July 2017 Albert Frisch, PhD - albert.frisch@de.ibm.com 2017 IBM 1 st wave of Quantum Revolution lasers atomic clocks GPS sensors

More information

Lecture 4: Elementary Quantum Algorithms

Lecture 4: Elementary Quantum Algorithms CS 880: Quantum Information Processing 9/13/010 Lecture 4: Elementary Quantum Algorithms Instructor: Dieter van Melkebeek Scribe: Kenneth Rudinger This lecture introduces several simple quantum algorithms.

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences

More information

arxiv:quant-ph/ v4 4 Jul 2005

arxiv:quant-ph/ v4 4 Jul 2005 Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories Dave Bacon Department of Computer Science & Engineering, University of Washington, Seattle, WA 98195 (Dated: June 6, 2005)

More information

First, let's review classical factoring algorithm (again, we will factor N=15 but pick different number)

First, let's review classical factoring algorithm (again, we will factor N=15 but pick different number) Lecture 8 Shor's algorithm (quantum factoring algorithm) First, let's review classical factoring algorithm (again, we will factor N=15 but pick different number) (1) Pick any number y less than 15: y=13.

More information

Lecture 3: Superdense coding, quantum circuits, and partial measurements

Lecture 3: Superdense coding, quantum circuits, and partial measurements CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two

More information

Quantum non-demolition measurements:

Quantum non-demolition measurements: Quantum non-demolition measurements: One path to truly scalable quantum computation Kae Nemoto Tim Spiller Sean Barrett Ray Beausoleil Pieter Kok Bill Munro HP Labs (Bristol) Why should optical quantum

More information

1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8

1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8 C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,

More information

Lecture 1: Introduction to Quantum Computing

Lecture 1: Introduction to Quantum Computing Lecture 1: Introduction to Quantum Computing Rajat Mittal IIT Kanpur Whenever the word Quantum Computing is uttered in public, there are many reactions. The first one is of surprise, mostly pleasant, and

More information

Quantum Computation with Neutral Atoms Lectures 14-15

Quantum Computation with Neutral Atoms Lectures 14-15 Quantum Computation with Neutral Atoms Lectures 14-15 15 Marianna Safronova Department of Physics and Astronomy Back to the real world: What do we need to build a quantum computer? Qubits which retain

More information

Logical Quantum Computing. Sarah Sheldon, IBM T.J. Watson Research Center

Logical Quantum Computing. Sarah Sheldon, IBM T.J. Watson Research Center Logical Quantum Computing Sarah Sheldon, IBM T.J. Watson Research Center Quantum computing has the potential to revolutionize a wide array of industries, from pharmaceuticals and materials research to

More information

Knotted Pictures of Hadamard Gate and CNOT Gate

Knotted Pictures of Hadamard Gate and CNOT Gate Commun. Theor. Phys. (Beijing, China) 51 (009) pp. 967 97 c Chinese Physical Society and IOP Publishing Ltd Vol. 51, No. 6, June 15, 009 Knotted Pictures of Hadamard Gate and CNOT Gate GU Zhi-Yu 1 and

More information

2.2 Classical circuit model of computation

2.2 Classical circuit model of computation Chapter 2 Classical Circuit Models for Computation 2. Introduction A computation is ultimately performed by a physical device. Thus it is a natural question to ask what are the fundamental limitations

More information

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016 Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to

More information