7. Show that the expectation value function that appears in Lecture 1, namely



Similar documents
Lecture 1: Schur s Unitary Triangularization Theorem

Matrix Calculations: Applications of Eigenvalues and Eigenvectors; Inner Products

SOLUTIONS FOR PROBLEM SET 2

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

0.1 Phase Estimation Technique

Lectures notes on orthogonal matrices (with exercises) Linear Algebra II - Spring 2004 by D. Klain

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = i.

1 Introduction to Option Pricing

by the matrix A results in a vector which is a reflection of the given

Lecture 3: Finding integer solutions to systems of linear equations

Notes on Determinant

Discuss the size of the instance for the minimum spanning tree problem.

Numerical Analysis Lecture Notes

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).

Solving Quadratic Equations by Factoring

Lecture 5: Singular Value Decomposition SVD (1)

CS 103X: Discrete Structures Homework Assignment 3 Solutions

3. Linear Programming and Polyhedral Combinatorics

Similarity and Diagonalization. Similar Matrices

Randomized algorithms

UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE Fall 2009 Linear Systems Fundamentals

8 Square matrices continued: Determinants

Exam 1 Sample Question SOLUTIONS. y = 2x

3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.

Lecture 13 Linear quadratic Lyapunov theory

Module1. x y 800.

13 MATH FACTS a = The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant

FIN FINANCIAL INSTRUMENTS SPRING 2008

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

1 Solving LPs: The Simplex Algorithm of George Dantzig

Session IX: Lecturer: Dr. Jose Olmo. Module: Economics of Financial Markets. MSc. Financial Economics

Problem sets for BUEC 333 Part 1: Probability and Statistics

Mathematics Course 111: Algebra I Part IV: Vector Spaces

K 1 < K 2 = P (K 1 ) P (K 2 ) (6) This holds for both American and European Options.

Derive 5: The Easiest... Just Got Better!

Continuity of the Perron Root

Quantum Computing Lecture 7. Quantum Factoring. Anuj Dawar

1 VECTOR SPACES AND SUBSPACES

Linear Codes. Chapter Basics

Linear Programming Notes V Problem Transformations

Inner Product Spaces and Orthogonality

Lecture 7: Bounds on Options Prices Steven Skiena. skiena

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

DEFINITION A complex number is a matrix of the form. x y. , y x

The Fourth International DERIVE-TI92/89 Conference Liverpool, U.K., July Derive 5: The Easiest... Just Got Better!

9 MATRICES AND TRANSFORMATIONS

Chapter 2 An Introduction to Forwards and Options

Chapter 17. Orthogonal Matrices and Symmetries of Space

Vector and Matrix Norms

2.3. Finding polynomial functions. An Introduction:

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

Lecture 13 - Basic Number Theory.

Inner Product Spaces

LINEAR ALGEBRA. September 23, 2010

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

Econ 116 Mid-Term Exam

Chapter 4 Lecture Notes

Continued Fractions and the Euclidean Algorithm

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA

Approximation Algorithms

(Refer Slide Time: 01:11-01:27)

GREATEST COMMON DIVISOR

What Has Quantum Mechanics to Do With Factoring? Things I wish they had told me about Peter Shor s algorithm

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

Lecture 4: Properties of stock options

Review of Fundamental Mathematics

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

Chapter 7. Sealed-bid Auctions

ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

Lecture 18: The Time-Bandwidth Product

BX in ( u, v) basis in two ways. On the one hand, AN = u+

Applied Linear Algebra I Review page 1

AMS 5 CHANCE VARIABILITY

Eigenvalues and Eigenvectors

PYTHAGOREAN TRIPLES KEITH CONRAD

The Characteristic Polynomial

MOVIES, GAMBLING, SECRET CODES, JUST MATRIX MAGIC

Lecture 6 Online and streaming algorithms for clustering

Lecture 2: Discrete Distributions, Normal Distributions. Chapter 1

Introduction to computer science

7 Gaussian Elimination and LU Factorization

2.1 The Present Value of an Annuity

Direct Methods for Solving Linear Systems. Matrix Factorization

Polynomials and Factoring. Unit Lesson Plan

Notes on Complexity Theory Last updated: August, Lecture 1

Economics 1011a: Intermediate Microeconomics

Pigeonhole Principle Solutions

CS3220 Lecture Notes: QR factorization and orthogonal transformations

Course Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics

Load Balancing and Switch Scheduling

1 Review of Newton Polynomials

36 Odds, Expected Value, and Conditional Probability

Solving systems by elimination

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

Transcription:

Lectures on quantum computation by David Deutsch Lecture 1: The qubit Worked Examples 1. You toss a coin and observe whether it came up heads or tails. (a) Interpret this as a physics experiment that ends with a measurement. What is the measuring instrument? (b) Interpret this as a computation. What is the computer?. Give an example of a quantum observable in everyday life. Call your observable ˆX. (a) What is Sp ˆX? (b) How could ˆX be measured, in principle? (c) Pick a value in Sp ˆX. How could ˆX be prepared with that value, in principle? (d) Give at least two ways of measuring the observable e ˆX. (e) Given an instrument that easily measures e ˆX, how could e ˆX ˆ1 be easily measured? 3. Prove that if Sp ˆθ Boolean observable. ( ) is a ( ) is the set of all real numbers between 10 and 170, Floor ˆθ 90 4. Given that the Boolean observable ˆX has spectrum {a,b}, find a Boolean observable of the same system with spectrum {-1,1}. 5. Let ˆX be an observable. Prove that there is no such observable as e i ˆX unless ˆX satisfies a certain condition, and state that condition. 6. Show that the observable ˆX = 0 1 { 1,1}. referred to in Lecture 1 does indeed have spectrum 7. Show that the expectation value function that appears in Lecture 1, namely has all the properties required of such a function, namely (a) it is real-valued; (b) it is linear ( λ ˆX + µ ˆ Y = λ ˆX + µ ˆ Y ); and a b * b c = a,

(c) Min Sp ˆX ˆX Max Sp ˆX. 8. Prove that in a quantum system S with the above expectation-value function, there exists an observable ˆX such that every sharp observable of S has the form λ ˆX + µˆ1 for some real λ and µ. 9. Prove the uncertainty principle for qubits, in the form for any qubit, there exists no possible expectation value function such that every observable of that qubit is sharp. 10. What would it feel like to be made of matrix-valued variables instead of real-valued ones? ( Made of is short for made of something whose properties are accurately represented by.)

Hints 1. (Coin toss) (a) In the example given in the lecture, the measuring instrument included the protractor and the light. (b) A computer is a physical object that is prepared with an input and later measured to obtain the output.. (Everyday observable). (a) The spectrum consists of real numbers. (b) Don t be deterred by expense, legality, morality, difficulty (c) See (b) above. (d) Measure ˆX first. (e) Measure e ˆX first. 3. Calculate the spectrum of Floor( ˆθ 90). 4. What is the spectrum of λ ˆX + µˆ1? 5. What is the spectrum of e i ˆX? Remember that observables are Hermitian. 6. The eigenvalues x of ˆX are the solution of the characteristic equation det( ˆX xˆ1 ) = 0. 7. (Expectation value function that appears in Lecture 1.) (a) a must be real because? (b) Let ˆX and Y ˆ = d e (c) Work out the lower and higher eigenvalues x ± of ˆX. 8. From the argument given in the lecture, a Boolean observable is sharp iff its expectation value equals one of its two eigenvalues. 9. Consider the family of Boolean observables ˆX cosθ sinθ θ = sinθ cosθ 10. Would?

Answers 1. (Coin toss.) (a) The light. (You could also include your own eye, parts of your brain where you draw the line is up to you.) (b) The coin. (You could also include the hand that tosses the coin, the table it lands on where you draw the line is up to you.) You provide the input to the computation by delivering a force to it in a particular way. You read the output by looking at (the light that comes from) the face that is uppermost when the coin stops moving.. Say, the closing price of a given share on the stock market on a given day. (a) The set of all real numbers of the form k 100 where k is a nonnegative integer (perhaps with some upper bound too). (b) By looking up the price in the following day s newspaper. (c) By causing the company to do well or badly, and then buying or selling suitable amounts of that stock during a period before the close of business. (d) Look up the value and raise e to the power of it. Or alter the rules of the stock market so that it announces stock prices on an exponential scale. (e) Measure e ˆX. Then square the outcome and subtract 1. 3. When a real variable θ ranges between 10 and 170, Floor θ 90 values, 0 and 1. Hence Floor ˆθ 90 ( ) is a Boolean observable. ( ) ranges over only two { }. Setting this { } and solving for λ and µ we find that the required observable is 4. Let λ and µ be real numbers. The spectrum of λ ˆX + µˆ1 is λa + µ,λb + µ equal to 1,1 b a ˆX a + b ˆ1. (Minus that observable would do just as well.) b a 5. The eigenvalues of an observable must be real. e ix is real if and only if x is an integer multiple of π. So the condition is that Sp ˆX contains only integer multiples of π. 6. Let x be in the spectrum of ˆX = 0 1 Then det ˆX x = ±1. x 1 ( ) = det xˆ1 1 x = x 1. Hence 7. (Expectation value function that appears in Lecture 1.) (a) a is a diagonal element of a Hermitian matrix and is therefore real;

(b) Let ˆX and Y ˆ = d e Then λ a b + µ d e = λa + µd = λ a b * b c + µ d e * e f (c) The eigenvalues x ± of ˆX satisfy the characteristic equation ( a x ± )( c x ± ) b = 0. I.e. x ± = a + c ± 4 b + ( a c). Hence x + a + c + a c and x a + c a c. In other words, the higher of the two eigenvalues is greater than or equal to the higher of a and c, and the lower of the eigenvalues is less than or equal to the lower of a and c. But ˆX = a, so in particular, x ˆX x +. 8. From the argument given in the lecture, a Boolean observable is sharp iff its expectation value equals one of its two eigenvalues. Let ˆX, with the expectation value function ˆX = a. This is sharp iff a is one of the eigenvalues x± of ˆX. But from the ( )( c x ± ) b = 0, a is one of those eigenvalues iff b = 0. characteristic equation a x ± Hence the sharp observables in this situation are precisely those whose matrix representations are diagonal. In other words those that are of form λ ˆX + µˆ1 where ˆX is 1 0 (say) 0 1 9. Suppose that for some expectation value function, every observable of a particular qubit is sharp. Then in particular, all its observables of the form ˆX cosθ sinθ θ = sinθ cosθ are sharp. From the characteristic equation ( cosθ + x) ( cosθ x) + sin θ = 0, it follows that the eigenvalues of each ˆX θ are ±1. But by the linearity of the expectation value function, ˆX θ = cosθ 1 0 0 1 + sinθ 0 1. If we square both sides and substitute ±1 for all the expectation values, we obtain cosθ sinθ = 0, which for generic θ is a contradiction. Hence the premise that all the observables were sharp was false. 10. We are made of matrix-valued and not real-valued variables. It would feel exactly as we are feeling now.