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

Similar documents
Lecture 1: Overview of quantum information

Quantum information and quantum computing

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

Lecture 21: Quantum communication complexity

Entanglement and Quantum Teleportation

Lecture 20: Bell inequalities and nonlocality

Quantum Teleportation Pt. 1

Quantum Gates, Circuits & Teleportation

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Chapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution

Lecture 22: Quantum computational complexity

Single qubit + CNOT gates

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum Teleportation Pt. 3

Quantum sampling of mixed states

Lecture 4: Elementary Quantum Algorithms

Quantum Information & Quantum Computation

Lecture 1: Introduction to Quantum Computing

Lecture 4: Postulates of quantum mechanics

Lecture 14: Quantum information revisited

1 Quantum Circuits. CS Quantum Complexity theory 1/31/07 Spring 2007 Lecture Class P - Polynomial Time

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

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

Entanglement and information

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

Describing Quantum Circuits with Systolic Arrays

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

Lecture 1: Introduction to Quantum Computing

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

Entanglement Manipulation

Lecture 6: Quantum error correction and quantum capacity

Seminar 1. Introduction to Quantum Computing

6.896 Quantum Complexity Theory September 9, Lecture 2

Problem Set: TT Quantum Information

Quantum Communication Complexity

An Introduction to Quantum Information and Applications

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

CS120, Quantum Cryptography, Fall 2016

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

The CHSH game as a Bell test thought experiment

CS/Ph120 Homework 1 Solutions

CSE 599d - Quantum Computing The No-Cloning Theorem, Classical Teleportation and Quantum Teleportation, Superdense Coding

Short introduction to Quantum Computing

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

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

IBM quantum experience: Experimental implementations, scope, and limitations

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

Secrets of Quantum Information Science

Introduction to Quantum Computation

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

arxiv:quant-ph/ v1 13 Jan 2003

Zero-Knowledge Against Quantum Attacks

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

Lecture: Quantum Information

2 Quantum Mechanics. 2.1 The Strange Lives of Electrons

Quantum Computer Architecture

Introduction to Quantum Computing

2. Introduction to quantum mechanics

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

Baby's First Diagrammatic Calculus for Quantum Information Processing

Unitary Dynamics and Quantum Circuits

1 Measurements, Tensor Products, and Entanglement

Lecture 18: Quantum Information Theory and Holevo s Bound

Introduction to Quantum Mechanics

6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1

Compression and entanglement, entanglement transformations

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

Ping Pong Protocol & Auto-compensation

Security Implications of Quantum Technologies

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

Quantum Noise. Michael A. Nielsen. University of Queensland

6.896 Quantum Complexity Theory Oct. 28, Lecture 16

Lecture 1: Shannon s Theorem

Instantaneous Nonlocal Measurements

Quantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States

Physics ; CS 4812 Problem Set 4

Lecture 11 September 30, 2015

Ph 219b/CS 219b. Exercises Due: Wednesday 21 November 2018 H = 1 ( ) 1 1. in quantum circuit notation, we denote the Hadamard gate as

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).

Bits. Chapter 1. Information can be learned through observation, experiment, or measurement.

Introduction to Quantum Computing for Folks

Lecture 21: Quantum Communication

Lecture 26: QIP and QMIP

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

Quantum Simultaneous Contract Signing

AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013

Week 11: April 9, The Enigma of Measurement: Detecting the Quantum World

Advanced Cryptography Quantum Algorithms Christophe Petit

Lecture 14, Thurs March 2: Nonlocal Games

6.896 Quantum Complexity Theory 30 October Lecture 17

Talk by Johannes Vrana

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:

1 1D Schrödinger equation: Particle in an infinite box

Circuits for Shor Factorization

Lecture 6 Sept. 14, 2015

Quantum Communication

Quantum Cryptography

Other Topics in Quantum Information

15-251: Great Theoretical Ideas In Computer Science Recitation 9 : Randomized Algorithms and Communication Complexity Solutions

Fourier Sampling & Simon s Algorithm

Transcription:

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 people named Alice and Bob are in different parts of the world. Alice has two bits: a and b. She would like to communicate these two bits to Bob by sending him just a single qubit. It turns out that there is no way they can can accomplish this task without additional resources. This is not obvious, but it is true Alice cannot encode two classical bits into a single qubit in any way that would give Bob more than just one bit of information about the pair a, b. owever, let us imaging that a long time ago, before Alice even knew what a and b are, that the two of them prepared two qubits A and B in the superposition 00 +. Alice took the qubit A and Bob took the qubit B. We say that Alice and Bob share an e-bit or share an EPR pair in this situation. It is natural to view entanglement as a resource as we will see; and when Alice and Bob each have a qubit and the two of them are in the state above, it is natural to imagine that Alice and Bob share one unit i.e., one entangled bit, or e-bit for short of entanglement. Given the additional resource of a shared e-bit of entanglement, Alice will be able to transmit both a and b to Bob by sending just one qubit. ere is how: Superdense coding protocol. If a =, Alice applies the unitary transformation 0 σ z = 0 to the qubit A. If a = 0 she does not.. If b =, Alice applies the unitary transformation 0 σ x = 0 to the qubit A. If b = 0 she does not. 3. Alice sends the qubit A to Bob. This is the only qubit that is sent during the protocol.

4. Bob applies a controlled-not operation to the pair A, B, where A is the control and B is the target. The corresponding unitary matrix is 5. Bob applies a adamard transform to A. 0 0 0 0 0 0 0 0 0. 0 0 0 6. Bob measures both qubits A and B. The output will be a, b with certainty. To see that the protocol works correctly, we simply compute the state of A, B after the steps involving transformations: ab state after step state after step state after step 4 state after step 5 00 00 + 00 + 0 + 0 00 0 00 + 0 + 0 + 0 0 0 00 00 0 0 0 00 0 0 0 When Bob measures at the end of the protocol, it is clear that he sees ab as required. Quantum circuits The previous discussion of superdense coding used a fairly inefficient way to describe the protocol; basically just plain English along with a few equations. We will need a more efficient way to describe sequences of quantum operations and measurements than this, particularly for when the complexity of the algorithms and protocols has increased. The most common way of doing this is to use quantum circuit diagrams, which is the way we will use. The basic idea is as follows: Time goes from left to right. orizontal lines represent qubits. Operations and measurements are represented by various symbols. It is easiest to describe the model more specifically by using examples.

Example. The following diagram represents a adamard transform applied to a single qubit: If the input is ψ, the output is ψ. Sometimes when we want to explain what happens for a particular input, we label the inputs and outputs with superpositions, such as: 0 Example. Measurements are indicated by circles or ovals with the letter M inside. For example: 0 M The result of the measurement is a classical value, and sometimes as in the above diagram we draw double lines to indicate classical bits. In this case the outcome is a uniformly distributed bit. Example 3. Multiple-qubit gates are generally represented by rectangles, or have their own special representation. For instance, this is a controlled-not operation: a b ere the action is indicated for classical inputs meaning a, b {0, }. Along similar lines, here is a controlled-controlled-not operation, better known as a Toffoli gate: c c a b ere the action is described for each choice of a, b, c {0, }. 3

Example 4. Usually we have multiple operations, such as in this circuit: It is not immediately obvious what this circuit does, so let us consider the superposition that would be obtained at various times for a selection of inputs: ψ ψ ψ 3 ψ 4 Suppose first that ψ = 00. Then ψ = 0 + 0 + = 00 + 0 + 0 +, ψ 3 = 00 + 0 + + 0 = 0 + 0 + ψ 4 = 00. Next suppose that ψ = 0. Then ψ = 0 + 0 = 00 0 + 0, ψ 3 = 00 0 + 0 = 0 0 ψ 4 =. Next suppose that ψ = 0. Then ψ = 0 0 + = 00 + 0 0, ψ 3 = 00 + 0 0 = 0 0 + ψ 4 = 0. 4

Finally, suppose that ψ =. Then ψ = 0 0 = 00 0 0 +, ψ 3 = 00 0 + 0 = 0 + 0 ψ 4 = 0. It turns out that the circuit is equivalent to this gate: a b This may seem counter to your intuition because the roles of control and target effectively switched in the controlled-not gate because of the adamard transforms. Don t let that bother you instead take it as an example of how your intuition can be wrong. Example 5. A quantum circuit diagram for superdense coding. a b φ + Alice Bob In this picture the first gate represents a controlled-σ z gate, whose corresponding unitary matrix is 0 0 0 0 0 0 0 0 0. 0 0 0 5

It may seem strange that the first two gates are acting on one classical bit and one qubit. Generally we will only do this when the classical bit is a control bit for some operation. All that this means is that if the classical control bit is then perform the corresponding operation on the qubit σ z or σ x in the present case, otherwise do nothing. Partial measurements Suppose we have a system consisting of two or more qubits and we only measure one of them. For example, suppose the qubits are X and Y, and these qubits are in the state ψ = 00 i 0 +. We know what the distribution of measurement outcomes would be if we measured both qubits: Pr[outcome is 00] = 4 Pr[outcome is 0] = 0 Pr[outcome is 0] = 4 Pr[outcome is ] =. The probability that a measurement of the first qubit, for instance, results in outcome 0 should therefore be /4+0 = /4 and the probability of outcome should be /4+/ = 3/4. Intuitively, this should be the case regardless of whether or not the second qubit was actually measured. Indeed this is the case. owever, what is different between the case where the second qubit is measured and the case where it is not is the superposition of the system after the measurement or measurements. If both qubits are measured, the superposition will be one of 00, 0, 0, or, depending on the measurement outcome. If only the first qubit is measured, however, this may not be the case. I ll explain how you determine the state of the system after the measurement of the first qubit for the example above, and the method for a general case should be clear. We begin by considering the possible outcome 0 for the measurement. We consider the state ψ = 00 i 0 + and cross off all of the terms in the sum that are inconsistent with measuring a 0 for the first qubit: ψ = 00 i 0 + which leaves 00. The probability of measuring 0 is the norm-squared of this vector, Pr[measurement outcome is 0] = 00 6 = 4,

and the state of the two qubits after the measurement conditioned on the measurement outcome being 0 is the vector itself renormalized: 00 00 = 00. The possible measurement outcome is handled similarly. We cross off the terms inconsistent with measuring a : 00 i 0 + which leaves i 0 +. The probability of measuring a is then the norm-squared of this vector, Pr[measurement outcome is ] = i 0 + = i and conditioned on measuring a the state of the two qubits becomes i 0 + i 0 + = i 3 0 + 3. + = 3 4, A completely equivalent way of performing this calculation is to begin by writing ψ = 0 φ 0 + φ for some choice of φ 0 and φ. There will always be a unique choice for each that works. In this case we have ψ = 0 0 + i 0 +, so φ 0 = 0 and φ = i 0 +. The probabilities for the two measurement outcomes are as follows: Pr[outcome is 0] = φ 0 = = 4 Pr[outcome is ] = φ = i + = 3 4. Conditioned on the measurement outcome, the state of the two qubits is as follows: measurement outcome is 0 state becomes measurement outcome is state becomes The same method works for more than qubits as well. 7 φ 0 0 φ 0 = 00 φ φ = i 3 0 + 3.

Example 6. Suppose 3 qubits are in the superposition ψ = 000 + 00 + 0 and the third qubit is measured. What are the probabilities of the two possible measurement outcomes and what are the resulting superpositions of the three qubits for each case? To determine the answer, we write ψ = 00 + 0 0 + The probability that the measurement outcome is 0 is 00 + 0 0. = and in this case the resulting superposition is 00 + 0 0 = 000 + 00. The probability that the measurement outcome is is 0 = and in this case the resulting superposition is 0 = 0. 8