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

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

Lecture 3: Hilbert spaces, tensor products

Quantum Gates, Circuits & Teleportation

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

C/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).

Quantum information and quantum computing

2. Introduction to quantum mechanics

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

Lecture 4: Postulates of quantum mechanics

Single qubit + CNOT gates

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Lecture 11 September 30, 2015

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

Quantum Teleportation Pt. 1

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

CS/Ph120 Homework 1 Solutions

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

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Chapter 10. Quantum algorithms

Lecture 2: From Classical to Quantum Model of Computation

Lecture: Quantum Information

Baby's First Diagrammatic Calculus for Quantum Information Processing

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

Lecture 20: Bell inequalities and nonlocality

Principles of Quantum Mechanics Pt. 2

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum Computing Lecture 2. Review of Linear Algebra

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

Ph 219/CS 219. Exercises Due: Friday 20 October 2006

Short introduction to Quantum Computing

Quantum computing! quantum gates! Fisica dell Energia!

CS257 Discrete Quantum Computation

Introduction to Quantum Computing

b) (5 points) Give a simple quantum circuit that transforms the state

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Quantum Information & Quantum Computation

Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

Lecture 1: Overview of quantum information

6.896 Quantum Complexity Theory September 9, Lecture 2

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

C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9

The controlled-not (CNOT) gate exors the first qubit into the second qubit ( a,b. a,a + b mod 2 ). Thus it permutes the four basis states as follows:

Introduction to Quantum Mechanics

Entanglement and Quantum Teleportation

Physics ; CS 4812 Problem Set 4

Ph 219b/CS 219b. Exercises Due: Wednesday 20 November 2013

Introduction to Quantum Computing for Folks

Lecture 21: Quantum Communication

Short Course in Quantum Information Lecture 2

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation

Seminar 1. Introduction to Quantum Computing

QLang: Qubit Language

Lecture 4: Elementary Quantum Algorithms

1 Measurements, Tensor Products, and Entanglement

Quantum Information & Quantum Computation

Lecture 6: Quantum error correction and quantum capacity

A Course in Quantum Information Theory

Compute the Fourier transform on the first register to get x {0,1} n x 0.

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation

Quantum Information & Quantum Computing

CS120, Quantum Cryptography, Fall 2016

1. Basic rules of quantum mechanics

Linear Algebra and Dirac Notation, Pt. 1

Entanglement and information

Unitary Dynamics and Quantum Circuits

An Introduction to Quantum Information and Applications

Lecture 2: Introduction to Quantum Mechanics

Instantaneous Nonlocal Measurements

IBM quantum experience: Experimental implementations, scope, and limitations

Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2

Introduction to Quantum Information Processing

Lecture 3: Constructing a Quantum Model

Quantum Entanglement and the Bell Matrix

Quantum Teleportation Last Update: 22 nd June 2008

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Some Introductory Notes on Quantum Computing

1 Mathematical preliminaries

Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,

Problem Set: TT Quantum Information

Private quantum subsystems and error correction

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

Introduction to Quantum Computation

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

Lecture 21: Quantum communication complexity

Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks

5. Communication resources

Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

An Introduction to Quantum Computation and Quantum Information

Lecture 6: QUANTUM CIRCUITS

Introduction to Quantum Information Hermann Kampermann

Chapter 2. Basic Principles of Quantum mechanics

arxiv: v2 [quant-ph] 26 Mar 2012

Advanced Cryptography Quantum Algorithms Christophe Petit

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

Chapter 5. Density matrix formalism

CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

arxiv:quant-ph/ v1 1 Jul 1998

Transcription:

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 a superposition over its two distinguishable states 0 and 1: ψ = α 0 + β 1 Measuring this qubit in the standard basis yields outcome 0 with probability α and resets the state to ψ = 0 and 1 with probability β resetting the state to ψ = 1 More generally we can measure the qubit in any orthonormal basis ( v v ) This results in outcome v with probability cos θ where θ is the angle between φ and v etc This description corresponds to the Heisenberg picture of quantum mechanics Here we think of the state of the system as fixed; what changes is the basis in which we measure A different viewpoint is provided by the Schrodinger picture Instead of measuring ψ in a rotated basis ( v v ) we achieve the same effect by rotating the entire space so that v is mapped to 0 and v is mapped to 1 and then measuring in the standard basis ( 0 1 ) 1 1 ψ 1 ψ 0 ψ 0 0 ψ ψ 1 ψ φ Heisenberg 0 1 ψ φ Schrödinger 0 Such rigid body transformations of the vector space are called unitary transformations For example rotations and reflections are unitary A postulate of quantum physics is that quantum evolution is unitary That is if we have some arbitrary quantum system U that takes as input a state φ and outputs a different state U φ then we can describe U as a unitary linear transformation defined as follows If U is any linear transformation the adjoint of U denoted U is defined by (U v w) = ( vu w) In a basis U is the conjugate transpose of U; for example for an operator on C U = ( ) a b c d U = ( ā c b d) We say that U is unitary if U = U 1 For example rotations and reflections are unitary Also the composition of two unitary transformations is also unitary (Proof: UV unitary then (UV) = V U = V 1 U 1 = (UV) 1 ) Some properies of a unitary transformation U: The rows of U form an orthonormal basis The colums of U form an orthonormal basis CS 94- Fall 004 Lecture 1

U preserves inner products ie ( v w)=(u vu w) Indeed (U vu w)=(u v ) U w = v U U w = v w Therefore U preserves norms and angles (up to sign) The eigenvalues of U are all of the form e iθ (since U is length-preserving ie ( v v) = (U vu v)) U can be diagonalized into the form e iθ 1 0 0 0 0 0 0 e iθ d Two qubits: Now let us return to the case of two qubits Consider the two electrons in two hydrogen atoms: + 0 1 + 0 1 Recall that the quantum state of these two electrons is a superposition of the four classical states 00 01 10 and 11: ψ = α 00 00 + α01 01 + α10 10 + α11 11 where i j α i j = 1 Again this is just Dirac notation for the unit vector in C 4 : α 00 α 01 α 10 α 11 where α i j C α i j = 1 Tensor products (informal): Recall that the state of each qubit is an element of the Hilbert space C The state of a two qubit system is an element of the Hilbert space C 4 How do we glue together the two copies of C to get the composite Hilbert space C 4? This is via an operation called tensor product It works as follows: suppose the state of the first qubit is φ 1 = α1 0 + β1 1 C and the state of the second qubit is φ = α 0 + β 1 C Then their joint state is described by the tensor product which can be described informally as follows: φ = φ 1 φ = α 1 α 00 + α1 β 01 + β1 α 10 + β1 β 11 This operation will be described more formally in the next lecture For now we just note that states of the two qubits where we can specify the state of each qubit individually are very special - they are called tensor product states The typical state of a two qubit system is not a tensor product state and is said to be entangled The Bell state introduced in the last lecture is an example of a highly entangled state CS 94- Fall 004 Lecture

3 Examples of Unitary transformations Hadamard gate: The Hadamard gate may be viewed as a reflection about the line θ = π/8 or as a rotation through π/4 followed by a reflection about the line θ = π/4 This transformation maps the state 0 to + and the state 1 to : 0 H 1 0 + 1 1 + (1) H 1 1 0 1 1 () In matrix form we write H = 1 ( ) 1 1 1 1 Note that H = H since H is real and symmetric and H = I Our notation + = H 0 and = H 1 emphasizes the fact that the information is encoded in the phase measuring the state + or in the standard basis yields 0 and 1 with equal probability The Hadamard transform thus transforms bit information into phase information and vice versa This is a fundamental property that will be extensively used In a quantum circuit diagram we imagine the qubit traveling from left to right along the wire The following diagram shows the application of a Hadamard gate H NOT gate: The not gate (denoted by X) swaps the bases vectors of the basis 0 and 1 It maps 0 to 1 and vice-versa Thus by linearity it maps α 0 + β 1 to α 1 + β 0 ( 0 1 X = 1 0 ) PHASE-FLIP gate: The phase flip gate (denoted by Z) applies a phase of 1 to 1 and leaves 0 unchanged ( ) 1 0 Z = 0 1 Z 0 = 0 Z 1 = 1 Z + = Z = + The last two equations suggest that in the Hadamard basis the phase flip gate acts as a Not gate ie Z=HXH CS 94- Fall 004 Lecture 3

CNOT gate: The controlled-not (CNOT) gate exors the first qubit into the second qubit ( ab aa b = aa+b mod ) Thus it permutes the four basis states as follows: 00 00 01 01 10 11 11 10 As a unitary 4 4 matrix the CNOT gate is 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 In a quantum circuit diagram the CNOT gate has the following representation The upper wire is called the control bit and the lower wire the target bit Bell states: The four Bell states are: Φ ± ( = 1 00 ± 11 ) Ψ ± ( = 1 ) 01 ± 10 These are maximally entangled states on two qubits We can generate the Bell states with a Hadamard gate and a CNOT gate Consider the following diagram: H The first qubit is passed through a Hadamard gate and then both qubits are entangled by a CNOT gate If the input to the system is 0 0 then the Hadamard gate changes the state to 1 ( 0+ 1) 0 = 1 00+ 1 10 and after the CNOT gate the state becomes 1 ( 00+ 11) the Bell state Φ + In fact one can verify that for each of the four standard basis states as inputs the output is the the corresponding Bell basis state: 00 1 ( 00+ 11) = Φ + (3) 10 1 ( 00 11) = Φ (4) 01 1 ( 01+ 10) = Ψ + (5) 11 1 ( 01 10) = Ψ (6) (7) CS 94- Fall 004 Lecture 4

The fact that the quantum circuit carries out a unitary transform implies that the Bell basis states form an orthonormal basis for C 4 Indeed the reverse of this circuit (feeding the input at the output wires and reading out the output at the input) transforms the Bell basis states into the standard basis measuring the output in the standard basis thus implements a Bell basis measurement 4 Super dense Coding Consider a situation where Alice receives classical bits and wishes to communicate them to Bob Clearly she must send him at least classical bits to convey her information to him If Alice and Bob share a Bell state then Alice can convey her two classical bits by sending him a single quantum bit In the next lecture we shall show that this is optimal - it is impossible to transmit more than two classical bits by sending 1 qubit Alice and Bob share a Bell state Φ + Suppose Alice receives the classical bits x 1 and x Alice applies one of four gates to her qubit of the Bell state depending upon x 1 x to convert the Bell state to one of the four Bell basis states Now if Alice sends her qubit to Bob he can read off which of the four Bell basis states he has by performing a Bell basis measurement: x = 00 then she sends her qubit unchanged x = 10 then she applies the phase-flip gate Z to her qubit x = 01 then she applies the Not gate X to her qubit x = 1 then she applies both the phase-flip and the NOT gate ZX to her qubit Upon receiving Alice s part of the Bell state Bob runs the circuit described in the previous section in reverse to obtain two qubits y 1 y He then measures this state in the basis { 00 01 10 11} In other words he applies the CNOT gate to b and to his quantum bit He then applies the Hadamard to b ( the quantum bit he received from Alice) and thus retrieves x 1 x CS 94- Fall 004 Lecture 5