Quantum Computer Algorithms: basics
|
|
- Gervase Reynolds
- 6 years ago
- Views:
Transcription
1 Quantum Computer Algorithms: basics Michele Mosca Canada Research Chair in Quantum Computation SQUINT Summer School on Quantum Information Processing June 3
2 Overview A quantum computing model Basis changes Eigenvalue kick-back Some simple algorithms
3 A QUANTUM COMPUTING MODEL
4 Classical logic gates A gate is a function from m bits to n bits, for some fied numbers m and n AND NOT a b a b a a
5 Classical circuits We glue gates together to make circuits (or arras of gates ) which compute Boolean functions
6 Universal sets of logic gates A set B of gates is universal if, for an Boolean function F, there is a circuit composed of gates in B that computes F E.g. B = { NOT } is not universal E.g B = { AND } is not universal E.g. B = {NOT, AND, FANOUT } is universal
7 eample A circuit made from gates from set A = {,, }
8 Universal sets of logic gates If B is universal B = {,, } then e.g. = C C C
9 Universal sets of logic gates We can eactl simulate the circuit with gates from A with a circuit with gates from B C C C C
10 Making irreversible gates reversible Note that irreversible gates are reall just reversible gates where we hardwire some inputs and/or throw awa some outputs a a b b a b a b a b
11 Making irreversible circuits reversible a b c d Replace irreversible gates with their reversible counterparts a b c d
12 New gates and notation X X -gate or NOT-gate X controlled-not gate b b b b
13 A Classical Computing Model Acclic circuits of reversible gates
14 Eample phsical realization NOT (negligible coupling to the environment)
15 More logic gates (negligible coupling to the environment)
16 A classical computation
17 Aside: Is this realistic? We do have a theor of classical linear error correction. But before we worr about stabilizing this sstem, let s push forward its capabilities.
18 A quantum gate i NOT + i NOT +
19 A simple quantum circuit i + NOT NOT i
20 Linear Algebra notation NOT NOT i i i i i i =
21 Notation = = = = = = =
22 A quantum computation NOT i + NOT I i + CNOT i +
23 A quantum computation NOT I + i + i c NOT I i i i i
24 A Quantum Computing Model Acclic circuits of unitar gates (from a finite universal set ) and von Neumann measurements in the computational basis? = {,} a n
25 Universalit A set B of quantum gates is universal if, for an positive integer n, an unitar operator ( n U S U ) on n qubits and for an e >, there is a finite circuit in those gates that implements satisfing U ~ U ~ U < e where A = min?? = A?
26 In other words A set B of quantum gates is universal if, for an positive integer n, the gates of B acting on n qubits span a dense subset of S U ( n ). Wh not demand eact implementation of all operators? Eact universalit would require an infinite set of gates B and/or infinite sized circuits.
27 Some universal sets {C-NOT, all -qubit gates} {C-NOT, H, P} most -qubit gates are universal
28 BASIS CHANGES
29 Distinguishing orthogonal states Given a state {??, }? B =,?, K N?? = i j d i j we can in principle determine which state we have b performing a Von Neumann measurement with respect to the basis B
30 Distinguishing orthogonal states We can implement this measurement efficientl if we can efficientl implement the unitar transformation A? j = j? j A A t? j j
31 In general We can measure an state wrt the basis B in this wa j a j? j A A t? j j a j j j with probabilit a j
32 The Hadamard basis change H H H + + H
33 The Hadamard transformation: summar b H + ( ) b
34 The Hadamard transformation: circuit notation b b H + ( )
35 The Hadamard transformation on several bits H + ( ) H + ( ) H 3 + ( ) 3
36 The Hadamard transformation: global view H 3 H {, } 3 ( ) 8 3 H
37 The Hadamard transformation: global view 3 H H H {, } 3 ( ) 8 3
38 The Hadamard transformation: global view H H H 3 = {,} 3 ( ) 8 3
39 The Hadamard transformation on several bits + ( ) H + ( ) H 3 + ( ) H 3
40 The Hadamard transformation: global view H {, } 3 ( ) 3 H 3 H
41 The Hadamard transformation: global view {, } 3 ( ) 3 H H H 3
42 Looking at NOT and CNOT in Hadamard bases Consider appling a NOT (or X ) gate to the following states + X + X ( ) In other words: X = H Z H Z =
43 e.g. Now consider appling a controlled-not gate to the following states ( ) C N O T + ( + ) ( ) C N O T + ( + ) ( ) C N O T ( ) ( ) C N O T ( )
44 e.g. Now consider appling a controlled-not gate to the following states ( )( ) C N O T + + ( + )( + ) ( )( ) C N O T + ( )( + ) ( )( ) C N O T + ( )( ) ( )( ) C N O T ( + )( )
45 Eigenvalue kick-back
46 Computing functions into the phase Suppose we know how to compute a function f : {,} {,} c U f a c f ( ) ( ) ( ) a ( ) f ( )
47 Generalization: Eigenvalue kick-back Suppose we know how to compute an operator U? = Then the controlled-u gives us e if? c U? =? c U? = e if? ( ) (? e if )? c U + = +
48 How do we implement c-u? Replace ever gate G in the circuit for with a c-g. For eample, =
49 SOME SIMPLE ALGORITHMS
50 Deutsch s problem Compute ( ) f ( ) using U onl once f f H H f
51 Deutsch algorithm H f () H ( ) f () f () f = ) f ( ) f ( ( ) + ( ) )( ) f ( ) ( ) ) ( f ( ) f ( + ( ) )( )
52 Deutsch-Jozsa problem f : {,} n {,} Suppose promise that f is either constant or balanced. Decide if f is constant or balanced. with the Equivalentl, determine ( ) n f ( )
53 Deutsch-Jozsa problem H H H H {,} 3 ( ) 3 f ( ) + H H Probabilit of measuring f is ( ) i.e. we measure iff f is constant 3 f ( )
54 Bernstein-Vazirani problem Suppose f ( ) = a f : {,} n for some {,} a {, } is of the form n Given determine c U a f c f ( ) a = a a K a n
55 Bernstein-Vazirani problem H H H H H H a a a 3 f {,} 3 3 {,} 3 ( ) 3 a
56 Another propert of Hadamard transformation Consider n Z S + = + S s s S S Let Then = + S t t n t S S H ) ( { } S s t s Z t t S n = =, :
57 e.g. Consider }, { s S = s S + = + Then ( ) = + = + S t n t t n t s t n t n t t t S H ) ( ) ( ) (
An Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
More informationQuantum 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 informationProblem Set # 5 Solutions
MIT./8.4/6.898/8.435 Quatum Iformatio Sciece I Fall, 00 Sam Ocko October 5, 00 Problem Set # 5 Solutios. Most uitar trasforms are hard to approimate. (a) We are dealig with boolea fuctios that take bits
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationQUANTUM 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 informationSimulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
More information6.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 informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationQuantum Circuits and Algorithms
Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements
More informationLecture 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 information8. BOOLEAN ALGEBRAS x x
8. BOOLEAN ALGEBRAS 8.1. Definition of a Boolean Algebra There are man sstems of interest to computing scientists that have a common underling structure. It makes sense to describe such a mathematical
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification
More informationX 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 informationDeutsch Algorithm on Classical Circuits
Deutsch Algorithm on Classical Circuits Assist.Prof.Dr. Osman Kaan EROL Istanbul Technical University, Electrical-Electronics Faculty, Computer Engineering Dept. Istanbul-Turkey Abstract: The well-known
More informationSingle 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 information2.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 informationQuantum Algorithms Lecture #2. Stephen Jordan
Quantum Algorithms Lecture #2 Stephen Jordan Last Time Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More informationLecture 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 informationWeek 3 September 5-7.
MA322 Weekl topics and quiz preparations Week 3 September 5-7. Topics These are alread partl covered in lectures. We collect the details for convenience.. Solutions of homogeneous equations AX =. 2. Using
More informationChapter 2. Basic Principles of Quantum mechanics
Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical
More informationIntroduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
More informationBoolean State Transformation
Quantum Computing Boolean State Transformation Quantum Computing 2 Boolean Gates Boolean gates transform the state of a Boolean system. Conventionally a Boolean gate is a map f : {,} n {,}, where n is
More informationChapter 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 informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationThe Maze Generation Problem is NP-complete
The Mae Generation Problem is NP-complete Mario Alviano Department of Mathematics, Universit of Calabria, 87030 Rende (CS), Ital alviano@mat.unical.it Abstract. The Mae Generation problem has been presented
More information2.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 informationToda s Theorem: PH P #P
CS254: Computational Compleit Theor Prof. Luca Trevisan Final Project Ananth Raghunathan 1 Introduction Toda s Theorem: PH P #P The class NP captures the difficult of finding certificates. However, in
More informationQuantum Phase Estimation using Multivalued Logic
Quantum Phase Estimation using Multivalued Logic Agenda Importance of Quantum Phase Estimation (QPE) QPE using binary logic QPE using MVL Performance Requirements Salient features Conclusion Introduction
More informationhydrogen atom: center-of-mass and relative
hdrogen atom: center-of-mass and relative apple ~ m e e -particle problem (electron & proton) ~ m p p + V ( ~r e ~r p ) (~r e, ~r p )=E (~r e, ~r p ) separation in center-of-mass and relative coordinates
More informationC/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21
C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum
More informationComplex 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 informationFourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More information*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 informationAn Introduction to Quantum Information and Applications
An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded
More informationLecture 5. Equations of Lines and Planes. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.
Lecture 5 Equations of Lines and Planes Dan Nichols nichols@math.umass.edu MATH 233, Spring 2018 Universit of Massachusetts Februar 6, 2018 (2) Upcoming midterm eam First midterm: Wednesda Feb. 21, 7:00-9:00
More informationQuantum Entanglement and the Bell Matrix
Quantum Entanglement and the Bell Matrix Marco Pedicini (Roma Tre University) in collaboration with Anna Chiara Lai and Silvia Rognone (La Sapienza University of Rome) SIMAI2018 - MS27: Discrete Mathematics,
More informationQuantum Computing Lecture 6. Quantum Search
Quantum Computing Lecture 6 Quantum Search Maris Ozols Grover s search problem One of the two most important algorithms in quantum computing is Grover s search algorithm (invented by Lov Grover in 1996)
More informationQuantum Algorithms Lecture #3. Stephen Jordan
Quantum Algorithms Lecture #3 Stephen Jordan Summary of Lecture 1 Defined quantum circuit model. Argued it captures all of quantum computation. Developed some building blocks: Gate universality Controlled-unitaries
More information1 Bernstein-Vazirani Algorithm
CMSC 33001: Novel Computing Architectures and Technologies Lecturer: Yongshan Ding, Pranav Gokhale Scribe: Shankar G. Menon Lecture 08: More on Algorithms November 1, 018 1 Bernstein-Vazirani Algorithm
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More information11.4 Polar Coordinates
11. Polar Coordinates 917 11. Polar Coordinates In Section 1.1, we introduced the Cartesian coordinates of a point in the plane as a means of assigning ordered pairs of numbers to points in the plane.
More informationIntroduction 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 informationRELATIONS AND FUNCTIONS through
RELATIONS AND FUNCTIONS 11.1.2 through 11.1. Relations and Functions establish a correspondence between the input values (usuall ) and the output values (usuall ) according to the particular relation or
More informationMathematics of Cryptography Part I
CHAPTER 2 Mathematics of Crptograph Part I (Solution to Practice Set) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinit to positive infinit. The set of
More informationSome 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 informationQuantum 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 informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationThe Force Table Introduction: Theory:
1 The Force Table Introduction: "The Force Table" is a simple tool for demonstrating Newton s First Law and the vector nature of forces. This tool is based on the principle of equilibrium. An object is
More informationQuantum 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 informationCartesian coordinates in space (Sect. 12.1).
Cartesian coordinates in space (Sect..). Overview of Multivariable Calculus. Cartesian coordinates in space. Right-handed, left-handed Cartesian coordinates. Distance formula between two points in space.
More informationIntroduction 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 informationPh 219b/CS 219b. Exercises Due: Wednesday 20 November 2013
1 h 219b/CS 219b Exercises Due: Wednesday 20 November 2013 3.1 Universal quantum gates I In this exercise and the two that follow, we will establish that several simple sets of gates are universal for
More informationYou don't have to be a mathematician to have a feel for numbers. John Forbes Nash, Jr.
Course Title: Real Analsis Course Code: MTH3 Course instructor: Dr. Atiq ur Rehman Class: MSc-II Course URL: www.mathcit.org/atiq/fa5-mth3 You don't have to be a mathematician to have a feel for numbers.
More informationIntroduction to Quantum Logic. Chris Heunen
Introduction to Quantum Logic Chris Heunen 1 / 28 Overview Boolean algebra Superposition Quantum logic Entanglement Quantum computation 2 / 28 Boolean algebra 3 / 28 Boolean algebra A Boolean algebra is
More informationQuantum Complexity Theory and Adiabatic Computation
Chapter 9 Quantum Complexity Theory and Adiabatic Computation 9.1 Defining Quantum Complexity We are familiar with complexity theory in classical computer science: how quickly can a computer (or Turing
More informationQuantum Recursion and Second Quantisation
Quantum Recursion and Second Quantisation Mingsheng Ying State Key Laboratory of Computer Science Outline 1. Introduction 2. Recursive Programming 3. Classical Recursion in Quantum Programming 4. Quantum
More informationReview: critical point or equivalently f a,
Review: a b f f a b f a b critical point or equivalentl f a, b A point, is called a of if,, 0 A local ma or local min must be a critical point (but not conversel) 0 D iscriminant (or Hessian) f f D f f
More informationQuantum 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 informationShort Course in Quantum Information Lecture 5
Short Course in Quantum Information Lecture 5 Quantum Algorithms Prof. Andrew Landahl University of New Mexico Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html
More informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationSystems of Linear Equations: Solving by Graphing
8.1 Sstems of Linear Equations: Solving b Graphing 8.1 OBJECTIVE 1. Find the solution(s) for a set of linear equations b graphing NOTE There is no other ordered pair that satisfies both equations. From
More informationSimulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P
Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits
More informationMATH Line integrals III Fall The fundamental theorem of line integrals. In general C
MATH 255 Line integrals III Fall 216 In general 1. The fundamental theorem of line integrals v T ds depends on the curve between the starting point and the ending point. onsider two was to get from (1,
More informationHilbert 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( 7, 3) means x = 7 and y = 3. ( 7, 3) works in both equations so. Section 5 1: Solving a System of Linear Equations by Graphing
Section 5 : Solving a Sstem of Linear Equations b Graphing What is a sstem of Linear Equations? A sstem of linear equations is a list of two or more linear equations that each represents the graph of a
More informationSection 1.5 Formal definitions of limits
Section.5 Formal definitions of limits (3/908) Overview: The definitions of the various tpes of limits in previous sections involve phrases such as arbitraril close, sufficientl close, arbitraril large,
More informationES.182A Topic 41 Notes Jeremy Orloff. 41 Extensions and applications of Green s theorem
ES.182A Topic 41 Notes Jerem Orloff 41 Etensions and applications of Green s theorem 41.1 eview of Green s theorem: Tangential (work) form: F T ds = curlf d d M d + N d = N M d d. Normal (flu) form: F
More informationThe Deutsch-Josza Algorithm in NMR
December 20, 2010 Matteo Biondi, Thomas Hasler Introduction Algorithm presented in 1992 by Deutsch and Josza First implementation in 1998 on NMR system: - Jones, JA; Mosca M; et al. of a quantum algorithm
More informationTRANSFORMATIONS OF f(x) = x Example 1
TRANSFORMATIONS OF f() = 2 2.1.1 2.1.2 Students investigate the general equation for a famil of quadratic functions, discovering was to shift and change the graphs. Additionall, the learn how to graph
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More information5. Zeros. We deduce that the graph crosses the x-axis at the points x = 0, 1, 2 and 4, and nowhere else. And that s exactly what we see in the graph.
. Zeros Eample 1. At the right we have drawn the graph of the polnomial = ( 1) ( 2) ( 4). Argue that the form of the algebraic formula allows ou to see right awa where the graph is above the -ais, where
More information1 Quantum Computing Simulation using the Auxiliary Field Decomposition
1 Quantum Computing Simulation using the Auiliar Field Decomposition Kurt Fischer, ans-georg Matuttis 1, Satoshi Yukawa, and Nobuasu Ito 1 Universit of Electro-Communications, Department of Mechanical
More informationMathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes
Mathematics 309 Conic sections and their applicationsn Chapter 2. Quadric figures In this chapter want to outline quickl how to decide what figure associated in 2D and 3D to quadratic equations look like.
More informationFoundations of Databases
Foundations of Databases (Slides adapted from Thomas Eiter, Leonid Libkin and Werner Nutt) Foundations of Databases 1 Quer optimization: finding a good wa to evaluate a quer Queries are declarative, and
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationThe Distance Formula & The Midpoint Formula
The & The Professor Tim Busken Mathematics Department Januar 14, 2015 Theorem ( : 1 dimension) If a and b are real numbers, then the distance between them on a number line is a b. a b : 2 dimensions Consider
More informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationProjects 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 informationPolynomial approximation and Splines
Polnomial approimation and Splines 1. Weierstrass approimation theorem The basic question we ll look at toda is how to approimate a complicated function f() with a simpler function P () f() P () for eample,
More information6. 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 informationQLang: 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 informationTeleportation 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 informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationGates for Adiabatic Quantum Computing
Gates for Adiabatic Quantum Computing Richard H. Warren Abstract. The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle
More information15. Eigenvalues, Eigenvectors
5 Eigenvalues, Eigenvectors Matri of a Linear Transformation Consider a linear ( transformation ) L : a b R 2 R 2 Suppose we know that L and L Then c d because of linearit, we can determine what L does
More informationROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL
arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,
More informationCh 3 Alg 2 Note Sheet.doc 3.1 Graphing Systems of Equations
Ch 3 Alg Note Sheet.doc 3.1 Graphing Sstems of Equations Sstems of Linear Equations A sstem of equations is a set of two or more equations that use the same variables. If the graph of each equation =.4
More informationPhysics Gravitational force. 2. Strong or color force. 3. Electroweak force
Phsics 360 Notes on Griffths - pluses and minuses No tetbook is perfect, and Griffithsisnoeception. Themajorplusisthat it is prett readable. For minuses, see below. Much of what G sas about the del operator
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
More informationRichard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo
CS 497 Frontiers of Computer Science Introduction to Quantum Computing Lecture of http://www.cs.uwaterloo.ca/~cleve/cs497-f7 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum
More informationCalculating with the square root of NOT
Calculating with the square root of NOT Alexis De Vos Imec v.z.w. and Universiteit Gent Belgium Cryptasc workshop Université Libre de Bruxelles, 6 Oct 2009 This is about groups This is about groups Groups
More informationAn Information Theory For Preferences
An Information Theor For Preferences Ali E. Abbas Department of Management Science and Engineering, Stanford Universit, Stanford, Ca, 94305 Abstract. Recent literature in the last Maimum Entrop workshop
More informationRealization of Quantum Hadamard Gate by Applying Optimal Control Fields to a Spin Qubit
00 nd International Conference on Mechanical and Electronics Engineering (ICMEE 00) Realiation of Quantum Hadamard Gate b Appling Optimal Control Fields to a Spin Qubit Sh Mohammad Nejad Nanoptronics Research
More informationEigenvectors and Eigenvalues 1
Ma 2015 page 1 Eigenvectors and Eigenvalues 1 In this handout, we will eplore eigenvectors and eigenvalues. We will begin with an eploration, then provide some direct eplanation and worked eamples, and
More informationRelations. Functions. Bijection and counting.
Relations.. and counting. s Given two sets A = {,, } B = {,,, 4} Their A B = {(, ), (, ), (, ), (, ), (, ), (, ), (, ), (, ), (, ), (, 4), (, 4), (, 4)} Question: What is the cartesian product of? ( is
More informationChapter 4 Page 1 of 16. Lecture Guide. Math College Algebra Chapter 4. to accompany. College Algebra by Julie Miller
Chapter 4 Page 1 of 16 Lecture Guide Math 105 - College Algebra Chapter 4 to accompan College Algebra b Julie Miller Corresponding Lecture Videos can be found at Prepared b Stephen Toner & Nichole DuBal
More information3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES
3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES 3.1 Introduction In this chapter we will review the concepts of probabilit, rom variables rom processes. We begin b reviewing some of the definitions
More informationQuantum Computation CMU BB, Fall Week 6 work: Oct. 11 Oct hour week Obligatory problems are marked with [ ]
Quantum Computation CMU 15-859BB, Fall 2018 Week 6 work: Oct. 11 Oct. 18 12-hour week Obligatory problems are marked with [ ] 1. [CCNOT.] In class we showed how to simulate classical AND, OR, NOT, and
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 1. Tropical ideals The idea of tropical scheme theor in general is the following. An ideal I K[ 1,..., n ] gives rise to a variet V (I) A n K a variet. With classical tropicalization
More information