Quantum Mechanics I: Basic Principles

Size: px
Start display at page:

Download "Quantum Mechanics I: Basic Principles"

Transcription

1 Quantum Mechanics I: Basic Principles Michael A. Nielsen University of Queensland I ain t no physicist but I know what matters - Popeye the Sailor Goal of this and the next lecture: to introduce all the basic elements of quantum mechanics, using examples drawn from quantum information science.

2 What is quantum mechanics? It is a framework for the development of physical theories. It is not a complete physical theory in its own right. Applications software Operating system Specific rules Quantum mechanics Quantum electrodynamics (QED) QM consists of four mathematical postulates which lay the ground rules for our description of the world. Newtonian gravitation Newton s laws of motion

3 Attempts to describe gravitation in the framework of quantum mechanics have (so far) failed. How successful is quantum mechanics? It is unbelievably successful. Not just for the small stuff! QM crucial to explain why stars shine, how the Universe formed, and the stability of matter. No deviations from quantum mechanics are known Most physicists believe that any theory of everything will be a quantum mechanical theory A conceptual issue, the so-called measurement problem, remains to be clarified.

4 The structure of quantum mechanics linear algebra Dirac notation 4 postulates of quantum mechanics ψ, φ, A 1. How to describe quantum states of a closed system. state vectors and state space. How to describe quantum dynamics. unitary evolution 3. How to describe measurements of a quantum system. projective measurements 4. How to describe quantum state of a composite system. tensor products

5 Example: qubits (two-level quantum systems) 1 Normalization α 0 + β 1 0 photons electron spin nuclear spin etcetera α + β = 1 0 and 1 are the computational basis states All we do is draw little arrows on a piece of paper - that's all. - Richard Feynman

6 Postulate 1: Rough Form Associated to any quantum system is a complex vector space known as state space. The state of a closed quantum system is a unit vector in state space. Example: we ll work mainly with qubits, which have state space C. α α 0 + β 1 β Quantum mechanics does not prescribe the state spaces of specific systems, such as electrons. That s the job of a physical theory like quantum electrodynamics.

7 A few conventions We write vectors in state space as: ψ (= ψ ) This is the ket notation. nearly v We always assume that our physical systems have finite-dimensional state spaces. ψ = α 0 + α 1 + α α d d 1 α α α 0 1 = : α d 1 Qudit d C

8 Dynamics: quantum logic gates Quantum not gate: Input qubit X Output qubit X 0 = 1 ; X 1 = 0. α 0 + β 1? α 0 + β 1 α 1 + β Matrix representation: X = General dynamics of a closed quantum system (including logic gates) can be represented as a unitary matrix.

9 Unitary matrices a b A = c d Hermitian conjugation; taking the adjoint A = ( A ) * T * * a c = * * b d A is said to be unitary if AA = A A = I We usually write unitary matrices as U. Example: XX = I 1 0 = =

10 Nomenclature tips matrix = (linear) operator = (linear) transformation = (linear) map = quantum gate (modulo unitarity)

11 Postulate The evolution of a closed quantum system is described unitary transformation. by a ψ ' = U ψ

12 Why unitaries? Unitary maps are the only linear maps that preserve normalization. ψ ' = U ψ implies ψ' = U ψ = ψ = 1 Exercise: prove that unitary evolution preserves normalization.

13 Pauli gates X gate (AKA σ or σ ) x 1 X X = 1 ; X 1 = 0 ; X = 1 0 Y gate (AKA σ or σ ) y Y 0 i Y 0 = i 1 ; Y 1 = i 0 ; Y = i 0 Z gate (AKA σ or σ ) z 3 Z Z = 0 ; Z 1 = 1 ; Z = 0 1 Notation: σ I 0

14 Exercise: prove that XY=iZ Exercise: prove that X =Y =Z =I

15 Measuring a qubit: a rough and ready prescription ψ = α 0 + β 1 Quantum mechanics DOES NOT allow us to determine α and β. We can, however, read out limited information about α and β. Measuring in the computational basis P(0) = α ; P(1) = β Measurement unavoidably disturbs the system, leaving it in a state 0 or 1 determined by the outcome.

16 Measuring a qubit P(0) = P(1) = 1

17 More general measurements d Let e,..., e be an orthonormal basis for C. 1 d A "measurement of ψ in the basis e,..., e " gives result with probability P( j) = e ψ. j 1 d j + β δ * * Reminder: α χ α χ β δ Measurement unavoidably disturbs the system, leaving it in a state determined by the outcome. e j

18 ψ = α 0 + β 1 Introduce orthonormal basis ( ) Pr + = 1 1 α 1 β Qubit example α + β = = = α + β = Pr( ) = α β

19 Inner products and duals Young man, in mathematics you don t understand things, you just get used to them. - John von Neumann The inner product is used to define the dual of a vector ψ. d If ψ lives in C then the dual of ψ is a function d ψ : C C defined by ψ φ ψ φ ( ) Simplified notation: ψ φ 1 α Example: 0 ( α 0 + β 1 ) = = α 0 β * ( ) ( ) Properties: ab = ba, since a, b = b, a ( ) ( ) Ab ba, since Ab, c = b, A c = ba c *

20 Duals as row vectors j j * (, ) j j j Suppose a = a j and b = b j. Then ab = a b = ab b1 * * = a1 a b This suggests the very useful identification of a with * * the row vector a1 a. j j

21 Postulate 3: rough form If we measure ψ in an orthonormal basis e,..., e, then we obtain the result j with probability P j) = e ψ. 1 ( j d The measurement disturbs the system, leaving it in a state determined by the outcome. ej

22 The measurement problem Quantum system Measuring apparatus Rest of the Universe Postulates 1 and Postulate 3 Research problem: solve the measurement problem.

23 Irrelevance of global phase Suppose we measure ψ in the orthonormal basis e,..., e. Then Pr( j) = e ψ. j 1 d iθ Suppose we measure e ψ in the orthonormal basis e,..., e. iθ Then Pr ( j) = e j e ψ = e j ψ. 1 d iθ The global phase factor e is thus unobservable, and we may iθ identify the states ψ and e ψ.

24 Revised postulate 1 Associated to any quantum system is a complex inner product space known as state space. The state of a closed quantum system is a unit vector in state space. Note: These inner product spaces are often called Hilbert spaces.

25 Multiple-qubit systems α 00 + α 01 + α 10 + α Measurement in the computational basis: P( x, y) = α xy General state of n qubits: n x 0,1 { } α x x n ( ) Classically, requires O bits to describe the state. Hilbert space is a big place - Carlton Caves Perhaps [ ] we need a mathematical theory of quantum automata. [ ] the quantum state space has far greater capacity than the classical one: [ ] in the quantum case we get the exponential growth [ ] the quantum behavior of the system might be much more complex than its classical simulation. Yu Manin (1980)

26 Postulate 4 The state space of a composite physical system is the tensor product of the state spaces of the component systems. Example: 4 Two-qubit state space is C C = C Computational basis states: 0 0 ; 0 1 ; 1 0 ; 1 1 Alternative notations: 0 0 ; 0, 0 ; 00. Properties z ( v w ) = ( z v ) w = v ( z w ) ( v + v ) w = v w + v w 1 1 v ( w + w ) = v w + v w 1 1

27 Some conventions implicit in Postulate 4 Alice Bob If Alice prepares her system in state a, and Bob prepares his in state b, then the joint state is a b. Conversely, if the joint state is a b then we say that Alice's system is in the state a, and Bob's system is in the state b. iθ iθ a b e a e b =( ) ( ) "Alice applies the gate U to her system" is applied to the joint system. means that ( A B) v w = Av B w ( U I )

28 Examples Suppose a NOT gate is applied to the second qubit of the state The resulting state is ( I X )( ) = Worked exercise: Suppose a two-qubit system is in the state A NOT gate is applied to the second qubit, and a measurement performed in the computational basis. What are the probabilities for the possible measurement outcomes?

29 Schroedinger (1935): I would not call [entanglement] one but rather the characteristic trait of quantum mechanics, the one that enforces its entire departure from classical lines of thought. Quantum entanglement Alice Bob ψ = ψ a b ψ = ( α 0 + β 1 )( γ 0 + δ 1 ) = αγ 00 + βγ 10 + αδ 01 + βδ 11 β = 0 or γ = 0.

30 Summary Postulate 1: A closed quantum system is described by a unit vector in a complex inner product space known as state space. Postulate : The evolution of a closed quantum system is described by a unitary transformation. 1 ψ ' = U Postulate 3 : If we measure ψ in an orthonormal basis e,..., e, then we obtain the result j with probability d P( j) = e ψ. j The measurement disturbs the system, leaving it in a state determined by the outcome. e j ψ Postulate 4: The state space of a composite physical system is the tensor product of the state spaces of the component systems.

Quantum Computing. Robert Sizemore

Quantum Computing. Robert Sizemore Quantum Computing Robert Sizemore Outline Introduction: What is quantum computing? What use is quantum computing? Overview of Quantum Systems Dirac notation & wave functions Two level systems Classical

More information

Bits Superposition Quantum Parallelism

Bits Superposition Quantum Parallelism 7-Qubit Quantum Computer Typical Ion Oscillations in a Trap Bits Qubits vs Each qubit can represent both a or at the same time! This phenomenon is known as Superposition. It leads to Quantum Parallelism

More information

Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer

Keywords Quantum logic gates, Quantum computing, Logic gate, Quantum computer Volume 3 Issue 10 October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Introduction

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Javier Enciso encisomo@in.tum.de Joint Advanced Student School 009 Technische Universität München April, 009 Abstract In this paper, a gentle introduction to Quantum Computing

More information

Three Pictures of Quantum Mechanics. Thomas R. Shafer April 17, 2009

Three Pictures of Quantum Mechanics. Thomas R. Shafer April 17, 2009 Three Pictures of Quantum Mechanics Thomas R. Shafer April 17, 2009 Outline of the Talk Brief review of (or introduction to) quantum mechanics. 3 different viewpoints on calculation. Schrödinger, Heisenberg,

More information

BOX. The density operator or density matrix for the ensemble or mixture of states with probabilities is given by

BOX. The density operator or density matrix for the ensemble or mixture of states with probabilities is given by 2.4 Density operator/matrix Ensemble of pure states gives a mixed state BOX The density operator or density matrix for the ensemble or mixture of states with probabilities is given by Note: Once mixed,

More information

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers Quantum Computers And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015 1 Includes joint work with Amlan Chakrabarti, U. Calcutta If you were designing Nature, how would

More information

Quantum Mechanics and Representation Theory

Quantum Mechanics and Representation Theory Quantum Mechanics and Representation Theory Peter Woit Columbia University Texas Tech, November 21 2013 Peter Woit (Columbia University) Quantum Mechanics and Representation Theory November 2013 1 / 30

More information

0.1 Phase Estimation Technique

0.1 Phase Estimation Technique Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design

More information

Theory of electrons and positrons

Theory of electrons and positrons P AUL A. M. DIRAC Theory of electrons and positrons Nobel Lecture, December 12, 1933 Matter has been found by experimental physicists to be made up of small particles of various kinds, the particles of

More information

QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION

QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION Arun K. Pati Theoretical Physics Division QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION Introduction Quantum information theory is a marriage between two scientific pillars of the twentieth

More information

How To Find The Optimal Control Function On A Unitary Operation

How To Find The Optimal Control Function On A Unitary Operation Quantum Computation as Geometry arxiv:quant-ph/0603161v2 21 Mar 2006 Michael A. Nielsen, Mark R. Dowling, Mile Gu, and Andrew C. Doherty School of Physical Sciences, The University of Queensland, Queensland

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

Programming Telepathy: Implementing Quantum Non-locality Games

Programming Telepathy: Implementing Quantum Non-locality Games Programming Telepathy: Implementing Quantum Non-locality Games Anya Tafliovich, Eric C.R. Hehner 1 University of Toronto, Toronto ON M5S 3G4, Canada {anya,hehner}@cs.toronto.edu Abstract. Quantum pseudo-telepathy

More information

Quantum Computing: Lecture Notes. Ronald de Wolf

Quantum Computing: Lecture Notes. Ronald de Wolf Quantum Computing: Lecture Notes Ronald de Wolf Preface These lecture notes were formed in small chunks during my Quantum computing course at the University of Amsterdam, Feb-May 2011, and compiled into

More information

Quantum Computation: a Tutorial

Quantum Computation: a Tutorial Quantum Computation: a Tutorial 1 Quantum Computation: a Tutorial Benoît Valiron University of Pennsylvania, Department of Computer and Information Science, 3330 Walnut Street, Philadelphia, Pennsylvania,

More information

α = u v. In other words, Orthogonal Projection

α = u v. In other words, Orthogonal Projection Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

More information

arxiv:quant-ph/9809016 v2 19 Jan 2000

arxiv:quant-ph/9809016 v2 19 Jan 2000 An Introduction to Quantum Computing for Non-Physicists arxiv:quant-ph/9809016 v 19 Jan 000 Eleanor Rieffel FX Palo Alto Labratory and Wolfgang Polak Consultant FX Palo Alto Laboratory, 3400 Hillview Avenue,

More information

Lecture 2 Matrix Operations

Lecture 2 Matrix Operations Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

More information

Techniques algébriques en calcul quantique

Techniques algébriques en calcul quantique Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul

More information

Lecture L3 - Vectors, Matrices and Coordinate Transformations

Lecture L3 - Vectors, Matrices and Coordinate Transformations S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between

More information

MASTER OF SCIENCE IN PHYSICS MASTER OF SCIENCES IN PHYSICS (MS PHYS) (LIST OF COURSES BY SEMESTER, THESIS OPTION)

MASTER OF SCIENCE IN PHYSICS MASTER OF SCIENCES IN PHYSICS (MS PHYS) (LIST OF COURSES BY SEMESTER, THESIS OPTION) MASTER OF SCIENCE IN PHYSICS Admission Requirements 1. Possession of a BS degree from a reputable institution or, for non-physics majors, a GPA of 2.5 or better in at least 15 units in the following advanced

More information

Quantum Computing Lecture 7. Quantum Factoring. Anuj Dawar

Quantum Computing Lecture 7. Quantum Factoring. Anuj Dawar Quantum Computing Lecture 7 Quantum Factoring Anuj Dawar Quantum Factoring A polynomial time quantum algorithm for factoring numbers was published by Peter Shor in 1994. polynomial time here means that

More information

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

Is Quantum Mechanics Exact?

Is Quantum Mechanics Exact? Is Quantum Mechanics Exact? Anton Kapustin Simons Center for Geometry and Physics Stony Brook University This year Quantum Theory will celebrate its 90th birthday. Werner Heisenberg s paper Quantum theoretic

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

More information

Using quantum computing to realize the Fourier Transform in computer vision applications

Using quantum computing to realize the Fourier Transform in computer vision applications Using quantum computing to realize the Fourier Transorm in computer vision applications Renato O. Violin and José H. Saito Computing Department Federal University o São Carlos {renato_violin, saito }@dc.uscar.br

More information

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013 Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

Chapter 9 Unitary Groups and SU(N)

Chapter 9 Unitary Groups and SU(N) Chapter 9 Unitary Groups and SU(N) The irreducible representations of SO(3) are appropriate for describing the degeneracies of states of quantum mechanical systems which have rotational symmetry in three

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

Simulation of quantum dynamics via classical collective behavior

Simulation of quantum dynamics via classical collective behavior arxiv:quant-ph/0602155v1 17 Feb 2006 Simulation of quantum dynamics via classical collective behavior Yu.I.Ozhigov Moscow State University, Institute of physics and technology of RAS March 25, 2008 Abstract

More information

Chapter 6. Orthogonality

Chapter 6. Orthogonality 6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

More information

Enhancing privacy with quantum networks

Enhancing privacy with quantum networks Enhancing privacy with quantum networks P. Mateus N. Paunković J. Rodrigues A. Souto SQIG- Instituto de Telecomunicações and DM - Instituto Superior Técnico - Universidade de Lisboa Abstract Using quantum

More information

16.3 Fredholm Operators

16.3 Fredholm Operators Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this

More information

arxiv:1206.3686v1 [quant-ph] 16 Jun 2012

arxiv:1206.3686v1 [quant-ph] 16 Jun 2012 Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov and Umesh Vazirani June 19, 2012 arxiv:1206.3686v1 [quant-ph] 16 Jun 2012 Abstract

More information

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1 (d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Linear Algebra: Vectors

Linear Algebra: Vectors A Linear Algebra: Vectors A Appendix A: LINEAR ALGEBRA: VECTORS TABLE OF CONTENTS Page A Motivation A 3 A2 Vectors A 3 A2 Notational Conventions A 4 A22 Visualization A 5 A23 Special Vectors A 5 A3 Vector

More information

Downloaded 09/24/14 to 128.104.46.196. Redistribution subject to SIAM license or copyright; see

Downloaded 09/24/14 to 128.104.46.196. Redistribution subject to SIAM license or copyright; see SIAMJ.COMPUT. c 1997 Society for Industrial and Applied Mathematics Vol. 26, No. 5, pp. 1411 1473, October 1997 007 QUANTUM COMPLEXITY THEORY ETHAN BERNSTEIN AND UMESH VAZIRANI Abstract. In this paper

More information

Quantum Physics II (8.05) Fall 2013 Assignment 4

Quantum Physics II (8.05) Fall 2013 Assignment 4 Quantum Physics II (8.05) Fall 2013 Assignment 4 Massachusetts Institute of Technology Physics Department Due October 4, 2013 September 27, 2013 3:00 pm Problem Set 4 1. Identitites for commutators (Based

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

Quantum Computing and Grover s Algorithm

Quantum Computing and Grover s Algorithm Quantum Computing and Grover s Algorithm Matthew Hayward January 14, 2015 1 Contents 1 Motivation for Study of Quantum Computing 3 1.1 A Killer App for Quantum Computing.............. 3 2 The Quantum Computer

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone

More information

Finite dimensional C -algebras

Finite dimensional C -algebras Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n

More information

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

Where is Fundamental Physics Heading? Nathan Seiberg IAS Apr. 30, 2014

Where is Fundamental Physics Heading? Nathan Seiberg IAS Apr. 30, 2014 Where is Fundamental Physics Heading? Nathan Seiberg IAS Apr. 30, 2014 Disclaimer We do not know what will be discovered. This is the reason we perform experiments. This is the reason scientific research

More information

Quantum Computers vs. Computers Security. @veorq http://aumasson.jp

Quantum Computers vs. Computers Security. @veorq http://aumasson.jp Quantum Computers vs. Computers Security @veorq http://aumasson.jp Schrodinger equation Entanglement Bell states EPR pairs Wave functions Uncertainty principle Tensor products Unitary matrices Hilbert

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 7 : Symmetries and the Quark Model. Introduction/Aims

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 7 : Symmetries and the Quark Model. Introduction/Aims Particle Physics Michaelmas Term 2011 Prof Mark Thomson Handout 7 : Symmetries and the Quark Model Prof. M.A. Thomson Michaelmas 2011 206 Introduction/Aims Symmetries play a central role in particle physics;

More information

University of Warwick institutional repository: http://go.warwick.ac.uk/wrap. A Thesis Submitted for the Degree of PhD at the University of Warwick

University of Warwick institutional repository: http://go.warwick.ac.uk/wrap. A Thesis Submitted for the Degree of PhD at the University of Warwick University of Warwick institutional repository: http://go.warwick.ac.uk/wrap A Thesis Submitted for the Degree of PhD at the University of Warwick http://go.warwick.ac.uk/wrap/63940 This thesis is made

More information

2.1 Complexity Classes

2.1 Complexity Classes 15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

PHYS 1624 University Physics I. PHYS 2644 University Physics II

PHYS 1624 University Physics I. PHYS 2644 University Physics II PHYS 1624 Physics I An introduction to mechanics, heat, and wave motion. This is a calculus- based course for Scientists and Engineers. 4 hours (3 lecture/3 lab) Prerequisites: Credit for MATH 2413 (Calculus

More information

CAs and Turing Machines. The Basis for Universal Computation

CAs and Turing Machines. The Basis for Universal Computation CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.

More information

Row Echelon Form and Reduced Row Echelon Form

Row Echelon Form and Reduced Row Echelon Form These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.

x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0. Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability

More information

PHY1020 BASIC CONCEPTS IN PHYSICS I

PHY1020 BASIC CONCEPTS IN PHYSICS I PHY1020 BASIC CONCEPTS IN PHYSICS I Jackson Levi Said 14 lectures/tutorials/past paper session Project on one of the interesting fields in physics (30%) Exam in January/February (70%) 1 The Course RECOMMENDED

More information

Factoring by Quantum Computers

Factoring by Quantum Computers Factoring by Quantum Computers Ragesh Jaiswal University of California, San Diego A Quantum computer is a device that uses uantum phenomenon to perform a computation. A classical system follows a single

More information

Quantum Systems for Information Technology

Quantum Systems for Information Technology Lecture Quantum Systems for Information Technology fall term (HS) 2010 Lecturer: e Andreas Wallraff office: HPF D 8/9, ETH Hoenggerberg email: qsit-lecture@phys.ethz.ch What is this lecture about? Quantum

More information

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n. ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?

More information

Chapter 6 Quantum Computing Based Software Testing Strategy (QCSTS)

Chapter 6 Quantum Computing Based Software Testing Strategy (QCSTS) Chapter 6 Quantum Computing Based Software Testing Strategy (QCSTS) 6.1 Introduction Software testing is a dual purpose process that reveals defects and is used to evaluate quality attributes of the software,

More information

MATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2

MATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2 MATHEMATICS FO ENGINEES BASIC MATIX THEOY TUTOIAL This is the second of two tutorials on matrix theory. On completion you should be able to do the following. Explain the general method for solving simultaneous

More information

Unified Lecture # 4 Vectors

Unified Lecture # 4 Vectors Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,

More information

Lecture 13: Factoring Integers

Lecture 13: Factoring Integers CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method

More information

Detection of quantum entanglement in physical systems

Detection of quantum entanglement in physical systems Detection of quantum entanglement in physical systems Carolina Moura Alves Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2005 Abstract Quantum entanglement

More information

Binary Adders: Half Adders and Full Adders

Binary Adders: Half Adders and Full Adders Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order

More information

Numerical Methods I Eigenvalue Problems

Numerical Methods I Eigenvalue Problems Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 September 30th, 2010 A. Donev (Courant Institute)

More information

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

7. Show that the expectation value function that appears in Lecture 1, namely 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

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

WHEN DOES A CROSS PRODUCT ON R n EXIST?

WHEN DOES A CROSS PRODUCT ON R n EXIST? WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

8.04: Quantum Mechanics Professor Allan Adams Massachusetts Institute of Technology. Problem Set 5

8.04: Quantum Mechanics Professor Allan Adams Massachusetts Institute of Technology. Problem Set 5 8.04: Quantum Mechanics Professor Allan Adams Massachusetts Institute of Technology Tuesday March 5 Problem Set 5 Due Tuesday March 12 at 11.00AM Assigned Reading: E&R 6 9, App-I Li. 7 1 4 Ga. 4 7, 6 1,2

More information

arxiv:quant-ph/9607009v1 11 Jul 1996

arxiv:quant-ph/9607009v1 11 Jul 1996 Distillability of Inseparable Quantum Systems Micha l Horodecki Department of Mathematics and Physics University of Gdańsk, 80 952 Gdańsk, Poland arxiv:quant-ph/9607009v1 11 Jul 1996 Pawe l Horodecki Faculty

More information

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8 Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e

More information

Properties of Stabilizing Computations

Properties of Stabilizing Computations Theory and Applications of Mathematics & Computer Science 5 (1) (2015) 71 93 Properties of Stabilizing Computations Mark Burgin a a University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA

More information

5. Orthogonal matrices

5. Orthogonal matrices L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal

More information

Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday.

Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday. Math 312, Fall 2012 Jerry L. Kazdan Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday. In addition to the problems below, you should also know how to solve

More information

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

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

More information

Just the Factors, Ma am

Just the Factors, Ma am 1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

More information

A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form

A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...

More information

5 Homogeneous systems

5 Homogeneous systems 5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m

More information

Operations with Algebraic Expressions: Multiplication of Polynomials

Operations with Algebraic Expressions: Multiplication of Polynomials Operations with Algebraic Expressions: Multiplication of Polynomials The product of a monomial x monomial To multiply a monomial times a monomial, multiply the coefficients and add the on powers with the

More information

Computing Relations in the Quantum Query Model 1

Computing Relations in the Quantum Query Model 1 Scientific Papers, University of Latvia, 2011. Vol. 770 Computer Science and Information Technologies 68 89 P. Computing Relations in the Quantum Query Model 1 Alina Vasilieva, Taisia Mischenko-Slatenkova

More information

Matrix Calculations: Applications of Eigenvalues and Eigenvectors; Inner Products

Matrix Calculations: Applications of Eigenvalues and Eigenvectors; Inner Products Matrix Calculations: Applications of Eigenvalues and Eigenvectors; Inner Products H. Geuvers Institute for Computing and Information Sciences Intelligent Systems Version: spring 2015 H. Geuvers Version:

More information

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9 Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

More information

Matrix-vector multiplication in terms of dot-products

Matrix-vector multiplication in terms of dot-products Matrix-vector multiplication in terms of dot-products Let M be an R C matrix. Dot-Product Definition of matrix-vector multiplication: M u is the R-vector v such that v[r] is the dot-product of row r of

More information

Introduction to computer science

Introduction to computer science Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

Lecture 1 Version: 14/08/28. Frontiers of Condensed Matter San Sebastian, Aug. 28-30, 2014. Dr. Leo DiCarlo l.dicarlo@tudelft.nl dicarlolab.tudelft.

Lecture 1 Version: 14/08/28. Frontiers of Condensed Matter San Sebastian, Aug. 28-30, 2014. Dr. Leo DiCarlo l.dicarlo@tudelft.nl dicarlolab.tudelft. Introduction to quantum computing (with superconducting circuits) Lecture 1 Version: 14/08/28 Frontiers of Condensed Matter San Sebastian, Aug. 28-30, 2014 Dr. Leo DiCarlo l.dicarlo@tudelft.nl dicarlolab.tudelft.nl

More information

The Limits of Adiabatic Quantum Computation

The Limits of Adiabatic Quantum Computation The Limits of Adiabatic Quantum Computation Alper Sarikaya June 11, 2009 Presentation of work given on: Thesis and Presentation approved by: Date: Contents Abstract ii 1 Introduction to Quantum Computation

More information

~ EQUIVALENT FORMS ~

~ EQUIVALENT FORMS ~ ~ EQUIVALENT FORMS ~ Critical to understanding mathematics is the concept of equivalent forms. Equivalent forms are used throughout this course. Throughout mathematics one encounters equivalent forms of

More information

CMPSCI 250: Introduction to Computation. Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013

CMPSCI 250: Introduction to Computation. Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013 CMPSCI 250: Introduction to Computation Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013 Regular Expressions and Their Languages Alphabets, Strings and Languages

More information

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

More information